A Hybrid Imperialist Competitive Algorithm for the Flexible Job Shop Problem

Flexible job shop scheduling problem FJSP is one of the hardest combinatorial optimization problems known to be NP-hard. This paper proposes a novel hybrid imperialist competitive algorithm with simulated annealing HICASA for solving the FJSP. HICASA explores the search space by using imperial competitive algorithm ICA and use a simulated annealing SA algorithm for exploitation in the search space. In order to obtain reliable results from HICASA algorithm, a robust parameter design is applied. HICASA is compared with the widely-used genetic algorithm GA and the relatively new imperialist competitive algorithm ICA. Experimental results suggest that HICASA algorithm is superior to GA and ICA on the FJSP.

[1]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Manoj Kumar Tiwari,et al.  Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and , 2004 .

[3]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[4]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[5]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[6]  Mostafa Zandieh,et al.  Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm , 2009, Expert Syst. Appl..

[7]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[8]  Reza Tavakkoli-Moghaddam,et al.  A Novel Imperialist Competitive Algorithm to Solve Flexible Flow Shop Scheduling Problem in Order to Minimize Maximum Completion Time , 2011 .

[9]  Zafer Bingul,et al.  Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems , 2006, Eng. Appl. Artif. Intell..

[10]  Reza Tavakkoli-Moghaddam,et al.  A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness , 2009, Soft Comput..

[11]  N.M. Najid,et al.  A modified simulated annealing method for flexible job shop scheduling problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[12]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[13]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[14]  Mostafa Zandieh,et al.  A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties , 2011, Expert Syst. Appl..

[15]  P. Balasubramanie,et al.  Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling , 2009, ArXiv.

[16]  Nasser Shahsavari-Pour,et al.  A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling , 2013 .

[17]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[18]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[19]  Caro Lucas,et al.  Imperialist competitive algorithm for minimum bit error rate beamforming , 2009, Int. J. Bio Inspired Comput..

[20]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[23]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[24]  Andrew Y. C. Nee,et al.  Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts , 2002 .

[25]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[26]  Siamak Talatahari,et al.  Optimum design of skeletal structures using imperialist competitive algorithm , 2010 .

[27]  Reza Tavakkoli-Moghaddam,et al.  Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan , 2010, Knowl. Based Syst..

[28]  Zahra Nasiri-Gheidari,et al.  Application of an imperialist competitive algorithm to the design of a linear induction motor , 2010 .

[29]  Reza Tavakkoli-Moghaddam,et al.  Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm , 2010, Comput. Ind. Eng..

[30]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[31]  Haoxun Chen,et al.  A genetic algorithm for flexible job-shop scheduling , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).