Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
 

Summary: Fast Ejection Chain Algorithms for
Vehicle Routing with Time Windows
Herman Sontrop1
, Pieter van der Horn1
, and Marc Uetz2
1
Philips Research Laboratories, Prof. Holstlaan 4, 5656 AA Eindhoven, The
Netherlands. E-mail: {Herman.Sontrop,Pieter.van.der.Horn}@philips.com
2
Maastricht University, Quantitative Economics, P.O. Box 616, 6200 MD
Maastricht, The Netherlands. E-mail: M.Uetz@ke.unimaas.nl
Abstract. This paper introduces a new algorithm, based on the con-
cept of ejection chains, to effectively target vehicle routing problems
with time window constraints (VRPTW). Ejection chains create pow-
erful compound moves within Local Search algorithms. Their potential
to yield state of the art algorithms has been validated for the traveling
salesman problem (TSP), for example. We show how ejection chains can
be used to tackle the more general VRPTW as well. The yardstick behind
ejection chain procedures is the underlying reference structure; it is used
to coordinate the moves that are available for the Local Search algorithm

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering