Differential Lévy-Flights Bat Algorithm for Minimization Makespan in Permutation Flow Shops

  • Jian Xie
  • Yongquan Zhou
  • Zhonghua Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7996)


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.


Bat Algorithm Lévy-Flight Minimization Makespan Permutation Flow Shop Scheduling Virtual Population Neighborhoods Search 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rinnooy, K.A.: Machine Scheduling Problems: Classification, Complexity, and Computations. The Hague, Nijhoff (1976)Google Scholar
  2. 2.
    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)zbMATHCrossRefGoogle Scholar
  3. 3.
    Wand, L., Liu, B.: Particle Swarm Optimization and Scheduling Algorithms. Tsinghua university press, Beijing (2008)Google Scholar
  4. 4.
    Zhou, Y., Yang, Y.: A Mean Particle Swarm Optimization Algorithm Based on Coordinate Rotation Angle. Advanced Science Letters 5(2), 737–740 (2012)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Wang, L., Zheng, D.Z.: An Effective Hybrid Heuristic for Flow Shop Scheduling. Int. J. Adv. Manuf. Technol. 21, 38–44 (2003)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Yang, X.S.: A New Metaheuristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization 284, 65–74 (2010)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Yang, X.S., Gandom, A.H.: Bat Algorithm: a Novel Approach for Global Engineering Op-timization. Engineering Computations 29, 464–483 (2012)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jian Xie
    • 1
  • Yongquan Zhou
    • 1
    • 2
  • Zhonghua Tang
    • 1
  1. 1.College of Information Science and EngineeringGuangxi University for NationalitiesNanningChina
  2. 2.Guangxi Key Laboratory of Hybrid Computation and IC Design AnalysisNanningChina

Personalised recommendations