Gambardella, L. M., Taillard, E. & Agazzi, G. (1999), MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows, Technical report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Ants can solve Constraint Satisfaction Problems - Solnon (2001) (4 citations) (Correct)
.... optimization metaheuristic ACO is a stochastic approach that has been proposed to solve di erent hard combinatorial optimization problems such as traveling salesman problems [6] 10] 9] graph colouring problems [4] quadratic assignment problems [12] 20] and vehicle routing problems [1] [13]. The main idea of ACO is to model the problem as the search for a minimum cost path in a graph. Arti cial ants walk through this graph, looking for good paths. Each ant has a rather simple behaviour so that it will typically only nd rather poor quality paths on its own. Better paths are found ....
L.M. Gambardella, E.D. Taillard, and G. Agazzi. MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 63-76. McGraw Hill, London, UK, 1999.
A Two-Pronged Attack on the Dragon of Intractability - Gilmour, Dras (2005) (Correct)
No context found.
Gambardella, L. M., Taillard, E. & Agazzi, G. (1999), MACSVRPTW: A multiple ant colony system for vehicle routing problems with time windows, Technical report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC