By Topic

Single populated genetic algorithm and its application to jobshop scheduling

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

3 Author(s)
Morikawa, K. ; Dept. of Electron.-Mech. Eng., Nagoya Univ., Japan ; Furuhashi, T. ; Uchikawa, Y.

The authors present an efficient genetic algorithm (GA) called the single populated genetic algorithm (SPGA). The algorithm uses an individual in a generation. Without using crossover, the solution is improved through mutations only. The algorithm is very fast in terms of convergence and the solution quality is excellent. The SPGA was applied in the traveling salesman problem (TSP) and was verified to be efficient through simulations. An application of the SPGA to the jobshop scheduling problem (JSP) is also studied. A representation method for the JSP is described. The genotype represented by the new method is simple and no illegal schedule is produced. The new genetic algorithm together with the representation method can realize flexible scheduling for job shop

Published in:

Industrial Electronics, Control, Instrumentation, and Automation, 1992. Power Electronics and Motion Control., Proceedings of the 1992 International Conference on

Date of Conference:

9-13 Nov 1992