Implementation of an Ant Colony Optimization technique for job shop scheduling problem

Research on optimization of the job shop scheduling problem (JSP) is one of the most significant and promising areas of optimization. Instead of the traditional optimization method, this paper presents an investigation into the use of an Ant Colony System (ACS) to optimize the JSP. The main characteristics of this system are positive feedback, distributed computation, robustness and the use of a constructive greedy heuristic. In this paper, an improvement of the performance of ACS will be discussed. The numerical experiments of ACS were implemented in a small JSP. The optimized results of the ACS are favourably compared with the traditional optimization methods.

[1]  Nidhal Rezg,et al.  An integrated greedy heuristic for a flexible job shop scheduling problem , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[2]  De-Shuang Huang,et al.  Determining the centers of radial basis probabilistic neural networks by recursive orthogonal least square algorithms , 2005, Appl. Math. Comput..

[3]  De-Shuang Huang,et al.  Zeroing polynomials using modified constrained neural network approach , 2005, IEEE Transactions on Neural Networks.

[4]  Feng Wan,et al.  Job shop scheduling by taboo search with fuzzy reasoning , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[5]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

[7]  M. A. B. Candido A genetic algorithm based procedure for more realistic job shop scheduling problems , 1998 .

[8]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[9]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[10]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[11]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[12]  De-Shuang Huang,et al.  Linear and Nonlinear Feedforward Neural Network Classifiers: A Comprehensive Understanding , 1999 .

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

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

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

[16]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[17]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[18]  C. S. George Lee,et al.  An evolutionary approach to the job-shop scheduling problem , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[19]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[20]  Zhou Pin,et al.  An ant colony algorithm for job shop scheduling problem , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[21]  R. Matthews,et al.  Ants. , 1898, Science.

[22]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

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