Abstract
The permutation flow shop problem (PFSP) is an NP-hard problem with wide engineering and theoretical background. In this paper, a differential Lévy-flights bat algorithm (DLBA) is proposed to improve basic bat algorithm for PFSP. In DLBA, LOV rule is introduced to convert the continuous position in DLBA to the discrete job permutation, the combination of NEH heuristic and random initialization is used to initialize the population with certain quality and diversity, and a virtual population neighborhoods search is used to enhance the global optimal solution and help the algorithm to escape from local optimal. Experimental results and comparisons show the effectiveness of the proposed DLBA for PFSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rinnooy, K.A.: Machine Scheduling Problems: Classification, Complexity, and Computations. The Hague, Nijhoff (1976)
Croce, F.D., Ghirardi, M., Tadei, R.: An Improved Branch-and-bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem. Eur. J. Oper. Res. 139, 293–301 (2002)
Wand, L., Liu, B.: Particle Swarm Optimization and Scheduling Algorithms. Tsinghua university press, Beijing (2008)
Zhou, Y., Yang, Y.: A Mean Particle Swarm Optimization Algorithm Based on Coordinate Rotation Angle. Advanced Science Letters 5(2), 737–740 (2012)
Chen, H., Zhou, Y., He, S., et al.: Invasive Weed Optimization Algorithm for Solving Per-mutation Flow-Shop Scheduling Problem. Journal of Computational and Theoretical Nanoscience 10, 708–713 (2013)
Wang, L., Zheng, D.Z.: An Effective Hybrid Heuristic for Flow Shop Scheduling. Int. J. Adv. Manuf. Technol. 21, 38–44 (2003)
Li, X.T., Yin, M.H.: An Opposition-based Differential Evolution Algorithm for Permutation Flow Shop Scheduling Based on Diversity Measure. Advances in Engineering Software 55, 10–31 (2013)
Yang, X.S.: A New Metaheuristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization 284, 65–74 (2010)
Gandomi, A.H., Yang, X.S., Alavi, A.H., et al.: Bat Algorithm for Constrained Optimiza-tion Tasks. Neural Computing and Applications 22, 1239–1255 (2012)
Yang, X.S., Gandom, A.H.: Bat Algorithm: a Novel Approach for Global Engineering Op-timization. Engineering Computations 29, 464–483 (2012)
Chechkin, A.V., Metzler, R., Klafter, J., et al.: Introduction to The Theory of Lévy Flights, Anomalous Transport: Foundations and Applications, pp. 129–162. Wiley-VCH (2008)
Yang, X.S., Deb, S.: Cuckoo Search via Lévy Flights. In: Proc. of World Congress on Nature & Biologically Inspired Computing, pp. 210–214 (2009)
Qian, B., Wang, L., Hu, R., et al.: A Hybrid Differential Evolution Method for Permutation Flow-shop Scheduling. The International Journal of Advanced Manufacturing Technology 38, 757–777 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, J., Zhou, Y., Tang, Z. (2013). Differential Lévy-Flights Bat Algorithm for Minimization Makespan in Permutation Flow Shops. In: Huang, DS., Jo, KH., Zhou, YQ., Han, K. (eds) Intelligent Computing Theories and Technology. ICIC 2013. Lecture Notes in Computer Science(), vol 7996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39482-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-39482-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39481-2
Online ISBN: 978-3-642-39482-9
eBook Packages: Computer ScienceComputer Science (R0)