Back to Search
Start Over
Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm.
- Source :
-
AIP Conference Proceedings . 4/16/2009, Vol. 1117 Issue 1, p157-162. 6p. - Publication Year :
- 2009
-
Abstract
- Ant colony system is a metaheuristic algorithm inspired by the behavior of real ants and was proposed by Dorigo et al. as a method for solving hard combinatorial optimization problems. In this paper we show its successful application to solving a network design problem: Generalized Vehicle Routing Problem. The Generalized Vehicle Routing Problem (GVRP) is the problem of designing optimal delivery or collection routes, subject to capacity restrictions, from a given depot to a number of predefined, mutually exclusive and exhaustive clusters. Computational results for several benchmark problems are reported. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 1117
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 38316251
- Full Text :
- https://doi.org/10.1063/1.3130618