2003 | OriginalPaper | Chapter
Savings Based Ants for Large-scale Vehicle Routing Problems
Authors : Marc Reimann, Karl Doerner
Published in: Operations Research Proceedings 2002
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we present a modified version of our Savings based Ant System for large-scale instances of the Vehicle Routing Problem (VRP). The main idea is to speed up the search by letting the ants solve only sub-problems rather than the whole problem. This is particularly necessary, when one has to solve large real world instances, for which the computation times of classic meta-heuristics are prohibitive. Our model is also inspired by Taillard ’s work on th e VRP ([1]), where the Tabu Search procedure employed solves only some sub-problems.