SavingsAnts for the vehicle routing problem

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP....

MoreLess

Year of publication:	2001-12-01
Authors:	Doerner, Karl ; Gronalt, Manfred ; Hartl, Richard F. ; Reimann, Marc ; Strauss, Christine ; Stummer, Michael
Published in:	Wirtschaftsuniversität Wien - Forschungsbezogene elektronische Publikationen - SFB Report Series ; 2001,63
Publisher:	Institut für Informationsverarbeitung und -wirtschaft <Wien>
Subject:	Vehicle-routing-Problem

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	212992 bytes 10 p. application/pdf
Type of publication:	Book / Working Paper
Language:	English
Notes:	This paper was accepted for publication in:Proceedings of the EvoWorkshops 2002, EuroGP 2002.Kinsale, Ireland, April 3-4, 2002. LNCS/LNAI, Springer Verlag
Classification:	Subject matter and research method of business administration ; Operations Research. General ; Individual Reports, Studies ; No country specification
Source:	USB Cologne (business full texts)

Persistent link: https://www.econbiz.de/10005841598