by Bernd Bullnheimer, Richard F. Hartl, Christine Strauss
http://www.bwl.univie.ac.at/bwl/prod/papers/pom-wp-4-97.ps
Add To MetaCart
Abstract:
In this paper we use a recently proposed metaheuristic, the Ant System, to solve the Vehicle Routing Problem (VRP) in its basic form, i.e. with capacity and distance restrictions, one central depot and identical vehicles. A "hybrid " Ant System algorithm is first presented and then improved using problem specific information (savings, capacity utilization). Experiments on various aspects of the algorithm and computational results for fourteen benchmark problems are reported and compared to those of other metaheuristic approaches such as Tabu Search, Simulated Annealing and Neural Networks. 1
Citations
|
4828
|
Genetic Algorithms
– Goldberg
- 1989
|
|
479
|
Ant system: optimization by a colony of cooperating agents
– Dorigo, Maniezzo, et al.
- 1996
|
|
342
|
Ant colony system: A cooperative learning approach to the traveling salesman problem
– Dorigo, Gambardella
- 1997
|
|
131
|
Distributed optimization by ant-colonies
– Colorni, Dorigo, et al.
- 1991
|
|
100
|
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
– Clarke, Wright
- 1963
|
|
100
|
The ant system applied to the quadratic assignment problem
– Maniezzo, Colorni
- 1999
|
|
97
|
A Tabu Search heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
– Gendreau, Laporte, et al.
- 1996
|
|
78
|
A.: Ants Can Colour Graphs
– Costa, Hertz
- 1997
|
|
75
|
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems
– Osman
- 1993
|
|
73
|
Probabilistic diversification and intensification in local search for vehicle routing
– Rochat, Taillard
- 1995
|
|
67
|
Ant system for Job-shop Scheduling
– Colorni, Dorigo, et al.
- 1994
|
|
63
|
The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem
– Stützle, Hoos
- 1997
|
|
56
|
Parallel iterative search methods for vehicle routing problems
– Taillard
- 1993
|
|
51
|
The Vehicle Routing Problem
– Christofides, Mingozzi, et al.
- 1989
|
|
40
|
A hybrid genetic algorithm for highly constrained timetabling problems
– Burke, Elliman, et al.
- 1995
|
|
28
|
A New Rank Based Version of the Ant System --- A Computational Study
– Bullnheimer, Hartl, et al.
- 1997
|
|
24
|
A method for solving traveling-salesman problems
– Croes
- 1958
|
|
24
|
A Heuristic Algorithm for the Vehicle Dispatching Problem
– Gillet, Miller
- 1974
|
|
20
|
A parallel tabu search algorithm using ejection chains for the vehicle routing problem
– Rego, Roucairol
- 1996
|
|
8
|
Optimization, Learning and Natural Algorithms. Doctoral Dissertation, Politecnico di
– DORIGO
- 1992
|
|
5
|
Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem
– GHAZIRI
- 1996
|
|
3
|
Learning in Automated Manufacturing
– Pesch
- 1994
|
|
2
|
Parallelization Strategies for the Ant System. Paper presented at
– Bullnheimer, Kotsis, et al.
- 1997
|
|
2
|
Entwicklung eines hybriden Genetischen Algorithmus zur
– Kopfer, Pankratz, et al.
- 1994
|
