VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH

Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standard constructive heuristic and by previously constructed solutions. This article is composed of three parts. The first one frames ACO in current trends of research on metaheuristics for combinatorial optimization. The second outlines some current research within the ACO community, reporting recent results obtained on different problems, while the third part focuses on a particular research line, named ANTS, providing some details on the algorithm and presenting results recently obtained on a prototypical strongly constrained problem: the set partitioning problem.

[1]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

[2]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[3]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[4]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[5]  Marco Dorigo,et al.  HC-ACO: The Hyper-Cube Framework for Ant Colony Optimization , 2001 .

[6]  John E. Beasley,et al.  Constraint Handling in Genetic Algorithms: The Set Partitioning Problem , 1998, J. Heuristics.

[7]  Antonella Carbonaro,et al.  An ANTS heuristic for the frequency assignment problem , 2000, Future Gener. Comput. Syst..

[8]  Vittorio Maniezzo,et al.  Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[11]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

[12]  Francesco Maffioli,et al.  Coloured Ant System and Local Search to Design Local Telecommunication Networks , 2001, EvoWorkshops.

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

[14]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[15]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[16]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

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

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

[19]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[20]  Z. Michalewicz,et al.  A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[21]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[22]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[23]  Jun Ouyang,et al.  A multi-group ant colony system algorithm for TSP , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[24]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[25]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[26]  Matthijs den Besten,et al.  Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.

[27]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[29]  Zbigniew Michalewicz,et al.  An ant system for the maximum independent set problem , 2001 .

[30]  Matteo Golfarelli,et al.  An ANTS Algorithm for Optimizing the Materialization of Fragmented Views in Data Warehouses: Preliminary Results , 2001, EvoWorkshops.

[31]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[32]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[33]  Matteo Golfarelli,et al.  Materialization of fragmented views in multidimensional databases , 2004, Data Knowl. Eng..

[34]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[35]  Daniel Merkle,et al.  Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine , 2004, Applied Intelligence.

[36]  Vittorio Maniezzo,et al.  An Ant-Based Framework for Very Strongly Constrained Problems , 2002, Ant Algorithms.

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

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

[39]  Lawrence J. Fogel,et al.  Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming , 1999 .

[40]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[41]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

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

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

[45]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[46]  Christian Blum,et al.  Metaheuristics for the edge-weighted K-cardinality tree problem , 2003 .

[47]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

[48]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[49]  Thomas Stützle,et al.  Iterated Ants: An Experimental Study for the Quadratic Assignment Problem , 2006, ANTS Workshop.

[50]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[51]  Martin W. P. Savelsbergh,et al.  A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems , 1996, J. Heuristics.

[52]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[53]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[54]  Karl F. Doerner,et al.  A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.

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

[56]  David M. Levine,et al.  A Genetic Algorithm for the Set Partitioning Problem , 1993, International Conference on Genetic Algorithms.

[57]  SchoolImperial CollegeLondon.  A Genetic Algorithm for the Set Partitioning Problem , 1995 .

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

[59]  Mario Giacobini,et al.  Applications of Evolutionary Computing , 2009, Lecture Notes in Computer Science.

[60]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[61]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[62]  ČernýV..  Thermodynamical approach to the traveling salesman problem , 1985 .

[63]  Lamberto Cesari,et al.  Optimization-Theory And Applications , 1983 .

[64]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

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

[66]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

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

[68]  Marc Gravel,et al.  Comparing Parallelization of an ACO: Message Passing vs. Shared Memory , 2005, Hybrid Metaheuristics.

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

[70]  Christian Blum,et al.  Theoretical and practical aspects of ant colony optimization , 2004 .

[71]  Christine Solnon,et al.  Searching for Maximum Cliques with Ant Colony Optimization , 2003, EvoWorkshops.

[72]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .