By Topic

Heuristics genetic algorithm using 80/20 rule

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

2 Author(s)
Li, B. ; Res. Inst. of Autom. Control, East China Univ. of Sci. & Technol., Shanghai, China ; Jiang, W.S.

Genetic algorithm (GA) has been widely used in optimizing difficult problems. Many achievements have been published so far. In practice, premature convergence and evolving too slowly are the common problems we often meet when a simple GA (SGA) is used. Over the years, many modifications have been suggested to alleviate the difficulties. This paper introduces an improved genetic algorithm (IGA) using 80/20 rule. SGA and the improved GA are both used to solve scheduling problems. The global optimum can not be obtained by SGA at all because of the serious premature convergence problem. When we use the improved GA, the results become much better. The global minimum or approximate global minimum can be obtained in a short time. The premature convergence problem has also been solved

Published in:

Industrial Technology, 1996. (ICIT '96), Proceedings of The IEEE International Conference on

Date of Conference:

2-6 Dec 1996