Resource title

SavingsAnts for the vehicle routing problem

Resource image

image for OpenScout resource :: SavingsAnts for the vehicle routing problem

Resource description

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. We compare our approach with some other classic, powerful meta-heuristics and show that our results are competitive. (author's abstract) ; Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"

Resource author

Karl Doerner, Manfred Gronalt, Richard F. Hartl, Marc Reimann, Christine Strauß, Michael Stummer

Resource publisher

Resource publish date

Resource language


Resource content type


Resource resource URL

Resource license

Adapt according to the license agreement. Always reference the original source and author.