Sciweavers

Share
ANTSW
2004
Springer

S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty

10 years 1 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigated. Whereas in a prior publication, theoretical convergence of S-ACO to the globally optimal solution has been demonstrated, the present article is concerned with an experimental study of S-ACO on two stochastic problems of fixedroutes type: First, a pre-test is carried out on the probabilistic traveling salesman problem. Then, more comprehensive tests are performed for a traveling salesman problem with time windows (TSPTW) in the case of stochastic service times. As a yardstick, a stochastic simulated annealing (SSA) algorithm has been implemented for comparison. Both approaches are tested at randomly generated problem instances of different size. It turns out that S-ACO outperforms the SSA approach on the considered test instances. Some conclusions for fine-tuning S-ACO are drawn.
Walter J. Gutjahr
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where ANTSW
Authors Walter J. Gutjahr
Comments (0)
books