An ant system with steps counter for the job shop scheduling problem

In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showed that natural ants can count their steps when they build the path between the nest and their food source. Experiments using a set of well-known job shop scheduling problems and a comparison against state-of-the-art techniques show that the proposed approach can reduce the number of evaluations performed without a degradation of performance. Additionally, our proposed approach reduces the number of parameters that need to be tuned by the user (specifically the parameters that balance the importance between the pheromone trail and heuristic values), with respect to the original ant system algorithm.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3]  Mauricio G. C. Resende,et al.  A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..

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

[5]  Carlos A. Coello Coello,et al.  A Cultural Algorithm for Solving the Job Shop Scheduling Problem , 2005 .

[6]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[7]  M. Dorigo,et al.  The Ant Colony Optimization MetaHeuristic 1 , 1999 .

[8]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[9]  Carlos A. Coello Coello,et al.  Job Shop Scheduling using the Clonal Selection Principle , 2004 .

[10]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[11]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[12]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

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

[14]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

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

[16]  Michael Sampels,et al.  Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  R. Wehner,et al.  The Ant Odometer: Stepping on Stilts and Stumps , 2006, Science.

[18]  Sanja Petrovic,et al.  Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation , 2006, ANTS Workshop.

[19]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  T. Yamada,et al.  Job shop scheduling , 1997 .

[21]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

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

[23]  Takeshi Yamada,et al.  A genetic algorithm with multi-step crossover for job-shop scheduling problems , 1995 .