×

An ant colony algorithm for the capacitated vehicle routing. (English) Zbl 1075.90568

Liebling, T. (ed.) et al., Latin-American conference on combinatorics, graphs and applications. Papers from the conference, Santiago, Chile, August 16–20, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 18, 181-186 (2004).
For the entire collection see [Zbl 1074.05004].

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90B06 Transportation, logistics and supply chain management
PDFBibTeX XMLCite
Full Text: Link

References:

[1] Bullnheimer, B.; Hartl, R. F.; Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of operations res. 89, 319-328 (1999) · Zbl 0937.90125
[2] Clarke, G.; Wright, J. V.: Scheduling of vehicles from a central depot to a number of delivery points. Operations research 12, 568-581 (1964)
[3] Colorni, A.; Dorigo, M.; Maniezzo, V.: Distributed optimization by ant colonies. First European conference on artificial life, 134-142 (1991)
[4] Lin, S.; Kernighan, B. W.: An effective heuristic algorithm for the traveling salesman problem. Operations research 21, 498-516 (1973) · Zbl 0256.90038
[5] S. Mazzeo. ”Un algoritmo de colonia de hormigas para el problema de ruteo de vehĂ­culos”, Tesis de Licenciatura, FCEN, UBA, 2003
[6] I. Or.”Traveling Salesman-type combinatorial optimization problems and the relation to the logistics of regional blood banking”. Ph.D. dissertation. NorthWestern Univ.,1976
[7] Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of operations res. 41, 421-451 (1993) · Zbl 0775.90153
[8] Toth, P.; Vigo, D.: SIAM monographs on discrete mathematics and applications. (2002) · Zbl 1076.90554
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.