By Topic

The study of job-shop scheduling problem of adaptive mind evolutionary computation algorithm

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
$33 $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)
Chen Guo ; Software Technology Institute, Dalian Jiaotong University, China ; Ming Huang ; Xu Liang

JSP is an complex problem in process. This paper brings up an adaptive mind evolutionary computation algorithm, which is based on the researched algorithm. The idea of this method is that useing adaptive convergence operation to adaptive adjustment evolution of the search range and precision. This method of operation can improve efficiency, enhance the direction of evolution, and improve the algorithm's search capabilities. The adaptive algorithm overcomes the prematurity and the poor results of average fitness and genetic algorithm. Simulation experiment results have shown the effectiveness of this algorithm.

Published in:

Electronics and Optoelectronics (ICEOE), 2011 International Conference on  (Volume:4 )

Date of Conference:

29-31 July 2011