Clustered enhanced differential evolution for the blocking flow shop scheduling problem

Clustered enhanced differential evolution for the blocking flow shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20126349
Volume: 20
Issue: 4
Start Page Number: 679
End Page Number: 717
Publication Date: Dec 2012
Journal: Central European Journal of Operations Research
Authors: , , , ,
Keywords: combinatorial optimization, scheduling, programming: dynamic
Abstract:

A novel clustered population paradigm is presented in this paper which is based on Chaos principles of edges and attractors. Convergence in evolutionary algorithms is viewed as a manifestation through cyclic dynamics and thus a new population is developed which is clustered and separated through new segregation bias rules. This population is embedded on the Enhanced Differential Evolution and the flow shop scheduling problem with blocking is solved. The two flow shop benchmark problems of Rec/Car/Hel and Taillard are solved with this new approach and the results favorably compared with published results in literature. A total of 49 new upper bounds for the Taillard problems was obtained during experimentation.

Reviews

Required fields are marked *. Your email address will not be published.