By Topic

New Evolutionary Subset: Application to Symbiotic Evolutionary Algorithm for Job-Shop Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

Evolutionary algorithms (EAs) prove to be powerful in solving combinatorial optimization problems. Construction mechanism of evolutionary subset affects the search capacity and efficiency. In this paper, random evolutionary subset is proposed to promote EAs' performance and compared with traditional neighborhood evolutionary subset. During the evolution process, evolutionary subsets are formed for localized evolution. To construct neighborhood evolutionary subset all individuals are chosen from a neighborhood in the population while in random evolutionary subset randomly. Two parameters affect the performance of neighborhood evolutionary subset: size and location. For random evolutionary subset, size is the only parameter that affects the evolution process and the suitable value is 6-15 on the basis of experimental results. The experimental results show the random evolutionary subset has better performance: showing high efficiency in getting much better solutions and fairly well solutions are obtained in early stage of evolution process.

Published in:

Natural Computation, 2008. ICNC '08. Fourth International Conference on  (Volume:1 )

Date of Conference:

18-20 Oct. 2008