Multiple colony ant algorithm for job-shop scheduling problem

Ant colony optimization (ACO) is a metaheuristic that takes inspiration from the foraging behaviour of a real ant colony to solve the optimization problem. This paper presents a multiple colony ant algorithm to solve the Job-shop Scheduling Problem with the objective that minimizes the makespan. In a multiple colony ant algorithm, ants cooperate to find good solutions by exchanging information among colonies which are stored in a master pheromone matrix that serves the role of global memory. The exploration of the search space in each colony is guided by different heuristic information. Several specific features are introduced in the algorithm in order to improve the efficiency of the search. Among others is the local search method by which the ant can fine-tune their neighbourhood solutions. The proposed algorithm is tested over set of benchmark problems and the computational results demonstrate that the multiple colony ant algorithm performs well on the benchmark problems.

[1]  Vassilios S. Vassiliadis,et al.  A novel threshold accepting meta-heuristic for the job-shop scheduling problem , 2004, Comput. Oper. Res..

[2]  E. Spencer.  From the Library , 1936, British Journal of Ophthalmology.

[3]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[4]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[5]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[6]  Mehmet Emin Aydin,et al.  A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application , 2004, J. Intell. Manuf..

[7]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[8]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[9]  Marc Gravel,et al.  Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..

[10]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[11]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[12]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[13]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[14]  S. Shyu,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[15]  C. D. Tarantilis,et al.  A list-based threshold accepting method for job shop scheduling problems , 2002 .

[16]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[17]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[18]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

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

[20]  Alberto Gómez,et al.  A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[21]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[22]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[23]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[24]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[25]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

[27]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[28]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[29]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[30]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..