Hybrid bat algorithm for flow shop scheduling problems

Ömür Tosun and M.K. Marichelvam

International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 1, 125-138

Abstract: In this paper, a hybrid bat algorithm is proposed to solve the permutation flow shop scheduling problems with makespan criterion. Developed for numerical optimisation, local search techniques are integrated into the bat algorithm to solve the flow shop problems. Reeves test problems from the literature are used to compare the performance of the proposed algorithm against the best known solutions, NEH and with different metaheuristics. Computational results and statistical analysis indicate that the proposed algorithm can be more efficient than many other metaheuristic algorithms addressed in the literature.

Keywords: flowshop scheduling; makespan; bat algorithm; metaheuristics; local search. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=77560 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:9:y:2016:i:1:p:125-138

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().