Permutation flow-shop scheduling using a hybrid differential evolution algorithm Online publication date: Sat, 10-May-2014
by Hai-yan Wang; Ye-bo Lu; Wen-li Peng
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 3, 2013
Abstract: In this paper, a hybrid differential evolution algorithm is developed for the permutation flow-shop scheduling problem to minimise the makespan. The iterative evolution procedure of the algorithm includes a DE-based global search for the population and an insert-based local search for the best individual. Experiments are performed, with the goal to discuss the impacts of different parameter values and the local search on the performance of the algorithm. The results reveal that choosing an appropriate CR is crucial on the global search performance for medium or larger-sized problems, and local search procedure brings the improvement in the optimisation ability, but leads to inevitable increase of computational time. Our future work is to exploit a more effective local search, which is capable of ensuring great optimisation power with reasonable computation time.
Online publication date: Sat, 10-May-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com