An Ant Colony Optimization Approach to the Minimum Tool Switching Instant Problem in Flexible Manufacturing System

Efficient tool management is very important for the productivity in flexible manufacturing systems. This paper proposes an ant colony approach to minimize the number of tool switching instants in flexible manufacturing systems for the first time. The proposed approach is compared to optimal results from the literature, and very promising results are reported.

[1]  Frederick Ducatelle,et al.  Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..

[2]  Richard F. Hartl,et al.  AntPacking - An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem , 2004, EvoCOP.

[3]  C. Rajendran,et al.  An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops , 2006 .

[4]  Ching-Jong Liao,et al.  An ant colony system approach for scheduling problems , 2003 .

[5]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[6]  Hugo Terashima-Marín,et al.  Building Hyper-heuristics Through Ant Colony Optimization for the 2D Bin Packing Problem , 2005, KES.

[7]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[8]  K. S. Al-Sultan,et al.  A tabu search based algorithm for minimizing the number of tool switches on a flexible machine , 2003 .

[9]  Serhiy D. Shtovba.  Ant Algorithms: Theory and Applications , 2005, Programming and Computer Software.

[10]  George Bilchev.  Evolutionary Metaphors for the Bin Packing Problem , 1996, Evolutionary Programming.

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

[12]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

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

[14]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[15]  Luca Maria Gambardella,et al.  AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks , 2005, Eur. Trans. Telecommun..

[16]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

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

[18]  Frits C. R. Spieksma,et al.  Minimizing the number of tool switches on a flexible machine , 1994 .

[19]  Meltem Denizel.  Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach , 2003, Oper. Res..

[20]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[21]  Alice E. Smith,et al.  An ant colony optimization algorithm for the redundancy allocation problem (RAP) , 2004, IEEE Transactions on Reliability.

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

[23]  GILBERT LAPORTE,et al.  Exact algorithms for the job sequencing and tool switching problem , 2002 .

[24]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[25]  Mauro Birattari,et al.  Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..

[26]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants , 1988, Oper. Res..

[27]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[28]  J. Bard.  A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .