A Converging ACO Algorithm for Stochastic Combinatorial Optimization

The paper presents a general-purpose algorithm for solving stochastic combinatorial optimization problems with the expected value of a random variable as objective and deterministic constraints. The algorithm follows the Ant Colony Optimization (ACO) approach and uses Monte-Carlo sampling for estimating the objective. It is shown that on rather mild conditions, including that of linear increment of the sample size, the algorithm converges with probability one to the globally optimal solution of the stochastic combinatorial optimization problem. Contrary to most convergence results for metaheuristics in the deterministic case, the algorithm can usually be recommended for practical application in an unchanged form, i.e., with the ”theoretical” parameter schedule.

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

[2]  Andrzej Ruszczynski,et al.  On Optimal Allocation of Indivisibles Under Uncertainty , 1998, Oper. Res..

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

[4]  Dirk C. Mattfeld,et al.  A Computational Study , 1996 .

[5]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[6]  D. Serra,et al.  Probabilistic maximal covering location models for congested systems , 1994 .

[7]  L. Kallel,et al.  Theoretical Aspects of Evolutionary Computing , 2001, Natural Computing Series.

[8]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[9]  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).

[10]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[11]  Georg Ch. Pflug,et al.  Confidence sets for discrete stochastic optimization , 1995, Ann. Oper. Res..

[12]  Vladimir Marianov,et al.  PROBABILISTIC MAXIMAL COVERING LOCATION-ALLOCATION FOR CONGESTED SYSTEMS , 1998 .

[13]  J. MacGregor Smith,et al.  RESOURCE ALLOCATION IN STATE-DEPENDENT EMERGENCY EVACUATION NETWORKS , 1996 .

[14]  W. Gutjahr.  A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

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

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

[17]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[18]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[19]  Sanjoy Mitter,et al.  Analysis of simulated annealing for optimization , 1985, 1985 24th IEEE Conference on Decision and Control.

[20]  Dirk V. Arnold,et al.  Evolution strategies in noisy environments- a survey of existing work , 2001 .

[21]  Georg Ch. Pflug,et al.  Simulated Annealing for noisy cost functions , 1996, J. Glob. Optim..

[22]  Christine Strauss,et al.  A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management , 2000, INFORMS J. Comput..

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

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

[25]  Bonaventure Intercontinental,et al.  ON DECISION AND CONTROL , 1985 .

[26]  Luca Maria Gambardella,et al.  Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic , 2002, Ant Algorithms.

[27]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..