Username   Password       Forgot your password?  Forgot your username? 

Modified Bat Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problem

Volume 13, Number 7, November 2017 - Paper 1  - pp. 999-1012
DOI: 10.23940/ijpe.17.07.p1.9991012

Haodong Zhua,b, Baofeng Hea, Hongchan Lib,*

aSchool of Electronic Information Engineering, Sias International University, Zhengzhou University, Xinzheng, Henan,451150, China
bSchool of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou, Henan, 450002, China 

(Submitted on July 21, 2017; Revised on September 8, 2017; Accepted on October 10, 2017)



Abstract:

In this paper, a modified bat algorithm (MBA) is proposed for solving the multi-objective flexible job shop scheduling problem. Three different production performance indicators are considered which are the makespan, the total workload of machines and the critical machine workload. Firstly, to make the algorithm adaptive to the problem, the converting approaches are presented to implement the conversion between the continuous position vector and the discrete scheduling code. Secondly, an initialization scheme combining heuristics and random rule is introduced to ensure good quality and diversity of the initial population. Furthermore, five neighborhood structures are designed based on individual positions. Then, a local search algorithm is embedded into the BA to enhance the local searching ability. Finally, simulation results demonstrate the feasibility and effectiveness of our proposed algorithm.

 

References: 27

      1. A. Bagheri, M. Zandieh, I. Mahdavi, M. Yazdani, “An artificial immune algorithm for the flexible job-shop scheduling problem,” Future Generation Computer Systems, vol. 26, no. 4, pp. 533-541, 2010.
      2. P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search,” Annals of Operations Research, vol. 41, no. 3, pp. 157-183, 1993.
      3. K. Z. Gao, P. N. Suganthan, Q. K. Pan, “Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling,” Information Sciences, vol. 289, no. 7, pp. 76-90, 2014.
      4. A. H. Gandomi, X. S. Yang, A. H. Alavi, S. Talatahari, “Bat algorithm for constrained optimization tasks,” Neural Computing and Applications, vol. 22, no. 6, pp. 1239-1255, 2013.
      5. A. Henchiri, M. Enngirou, “Particle swarm optimization combined with tabu search in a multi-agent model for flexible job shop problem,” Computer Science, vol. 7929, no. 1, pp. 385-394, 2013.
      6. I. Kacem, S. Hammadi, P. Borne, “Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 32, no. 1, pp. 1-13, 2002.
      7. I. Kacem, S. Hammadi, P. Borne, “Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic,” Mathematics and Computers in Simulation, vol. 60, no. 3, pp. 245-276, 2012.
      8. V. Kaplanoğlu, “An object-oriented approach for multi-objective flexible job-shop scheduling problem,” Expert Systems with Applications, vol. 45, no. 7, pp. 71-84, 2016.
      9. J. Li, Q. Pan, Y. C. Liang, “An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 647-662, 2010.
      10. J. Q. Li, Q. K. Pan, M. F. Tasgetiren, “A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities,” Applied Mathematical Modelling, vol. 38, no. 3, pp. 1111-1132, 2014.
      11. Q. Luo, Y. Zhou, J. Xie, et al, “Discrete bat Algorithm for optimal problem of permutation flow shop scheduling,” The Scientific World Journal, vol. 25, no. 1, pp. 1-25, 2014.
      12. M. K. Marichelvam, T. Prabaharam, “A bat algorithm for realistic hybrid flowshop scheduling problems to minimize makespan and mean flow time,” ICTACT Journal on Soft Computing, vol. 3, no. 1, pp. 428-433, 2012.
      13. M. K. Marichelvam, T. Prabaharan, X. S. Yang, et al, “Solving hybrid flow shop scheduling problems using bat algorithm,” International Journal of Logistics Economics and Globalisation, vol. 5, no. 1, pp. 15-29, 2013.
      14. G. Moslehi, M. Mahnam, “A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search,” International Journal of Production Economics, vol. 129, no. 1, pp. 14-22, 2011.
      15. S. H. A. Rahmati, M. Zandieh, “A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 58, no. 12, pp. 1115-1129, 2012.
      16. B. Ramesh, V. C. J. Mohan, V. C. V. Reddy, “Application of bat algorithm for combined economic load and emission dispatch,” International Journal of Electricl Engineering and Telecommunications, vol. 2, no. 1, pp. 1-9, 2013.
      17. M. Saidi-Mehrabad, P. Fattahi, “Flexible job shop scheduling with tabu search algorithms,” The International Journal of Advanced Manufacturing Technology, vol. 32, no. 6, pp. 563-570, 2007.
      18. N. Shivasankaran, P. S. Kumar, K. V. Raja, “Hybrid sorting immune simulated annealing algorithm for flexible Job shop scheduling,” International Journal of Computational Intelligence Systems, vol. 8, no. 3, pp. 455-466, 2015.
      19. Ö. Tosun, M. K. Marichelvam, “Hybrid bat algorithm for flow shop scheduling problems,” International Journal of Mathematics in Operational Research, vol. 9, no. 1, pp. 125-138, 2016.
      20. L. Wang, G. Zhou, Y. Xu, S. Wang, “An effective artificial bee colony algorithm for the flexible job-shop scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 60, no. 4, pp. 303-315, 2012.
      21. S. Wang, C. Liu, D. Pei, J. Wang, “A novel hybrid election campaign optimisation algorithm for multi-objective flexible job-shop scheduling problem,” International Journal of Materials and Structural Integrity, vol. 7, no. 1, pp. 160-170, 2013.
      22. W. Xia, Z. Wu, “An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems,” Computers & Industrial Engineering, vol. 48, no. 2, pp. 409-425, 2005.
      23. M. Yazdani, M. Amiri, M. Zandieh, “Flexible job-shop scheduling with parallel variable neighborhood search algorithm,” Expert Systems with Applications, vol. 37, no. 1, pp. 678-687, 2010.
      24. X. S. Yang, “A new metaheuristic bat-inspired algorithm,” Springer Berlin Heidelberg, Germany,2010.
      25. X. S. Yang, “Bat algorithm for multi-objective optimization,” International Journal of Bio-Inspired Computation, vol. 3, no. 5, pp. 267-274, 2011.
      26. Y. Yuan, H. Xu, J. Yang, “A hybrid harmony search algorithm for the flexible job shop scheduling problem,” Applied Soft Computing, vol. 13, no. 7, pp. 3259-3272, 2013.
      27. G. Zhang, L. Gao, Y. Shi, “An effective genetic algorithm for the flexible job-shop scheduling problem,” Expert Systems with Applications, vol. 38, no. 4, pp. 3563-3573, 2011.

           

          Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

           
          This site uses encryption for transmitting your passwords. ratmilwebsolutions.com