Go to content
UR Home

A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem

URN to cite this document:
DOI to cite this document:
Wendolsky, Rolf ; Scheuerer, Stephan
Date of publication of this fulltext: 28 Mar 2007 13:47


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 ...


Owner only: item control page
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons