Applying a Chaos-Based Firefly Algorithm to the Permutation Flow Shop Scheduling Problem

The Permutation Flow Shop scheduling Problem (PFSP) is a typical combinatorial optimization problem. In order to improve the efficacy in solving the PFSP, we applied a discrete mechanism to convert the real value of individuals into discrete job sequences at first. In particular, a Chaos-based Firefly Algorithm (CFA) is used to optimize the initial population, which provided a superior initial environment and improved the quality of optimization. In addition, the proposed method is tested by seven famous classic benchmark worksheets and compared with Particle Swarm Optimization (PSO) and a Genetic Algorithm (GA). At last, the simulation results show that the proposed CFA outperforms the others.

[1]  Jeffrey E. Schaller,et al.  A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness , 2013 .

[2]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[3]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[4]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .

[5]  Xiong Hegen.  Job shop scheduling problem based on particle swarm optimization , 2009 .

[6]  Mostafa Zandieh,et al.  A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times , 2011, J. Intell. Manuf..

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

[8]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[9]  Tao Zhang,et al.  A novel hybrid particle swarm optimisation method applied to economic dispatch , 2010, Int. J. Bio Inspired Comput..

[10]  Deming Lei,et al.  Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling , 2012 .

[11]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[12]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[13]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .

[14]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[15]  Thomas Hanne,et al.  A genetic algorithm with an embedded Ikeda map applied to an order picking problem in a multi-aisle warehouse , 2014, 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

[16]  Rui Zhang.  A Simulated Annealing-Based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness , 2013 .

[17]  A. Rezaee Jordehi,et al.  A chaotic-based big bang–big crunch algorithm for solving global optimisation problems , 2014, Neural Computing and Applications.

[18]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[19]  Yuqing He,et al.  Parameter extraction of solar cell models using chaotic asexual reproduction optimization , 2014, Neural Computing and Applications.

[20]  A. Rezaee Jordehi.  A chaotic-based big bang–big crunch algorithm for solving global optimisation problems , 2014 .

[21]  David P. Feldman,et al.  Chaos and Fractals: An Elementary Introduction , 2012 .

[22]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .