A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem

URN to cite this document:: urn:nbn:de:bvb:355-opus-7691
DOI to cite this document:: 10.5283/epub.4537

Wendolsky, Rolf ; Scheuerer, Stephan

Preview

PDF
(109kB)

Date of publication of this fulltext: 28 Mar 2007 13:47

Alternative links to fulltext:Repec Publisher

Details

Preview

Export bibliographical data

Abstract

The Vehicle Routing Problem (VRP) is one of the most studied problems in the field of Operations Research. Closely related to the VRP is the Capacitated Clustering Problem (CCP). The VRP can be considered as an 'extension' of the CCP in the way that for each cluster in the CCP solution, additionally a route through all cluster customers and the depot has to be constructed to generate the routing ...