Abstract
An improved cellular genetic algorithm (cGA) is proposed to study the optimization of the job-shop scheduling problem (JSP). Combining with the characteristics of JSP, a sequence-based coding mechanism is presented. The small overlapped neibhborhoods of cGA help to enhance the population diversity and exploration. An adaptive selection operation based on fitness of neighborhood is designed to prevent from getting into local optimal. The improved cellular genetic algorithm is tested on some instances and compared with simple genetic algorithm. The computational results show that the improved cellular genetic algorithm is effective on JSP.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call