Go to content
UR Home

A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem

URN to cite this document: urn:nbn:de:bvb:355-opus-7691

Wendolsky, Rolf and Scheuerer, Stephan (2006) A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem. Regensburger Diskussionsbeiträge zur Wirtschaftswissenschaft 415, Working Paper.

Download (109kB)

at ReconPapers

Other URL: http://www.opus-bayern.de/uni-regensburg/volltexte/2006/769


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


Export bibliographical data

Item Type:Monograph (Working Paper)
Series of the University of Regensburg:Regensburger Diskussionsbeiträge zur Wirtschaftswissenschaft
Institutions:Business, Economics and Information Systems
Identification Number:
RePEc:bay:rdwiwi:769RePEc Handle
Keywords:Operations Research , Metaheuristik, Tourenplanung , Scatter Search, Vehicle Routing , Scatter Search
Dewey Decimal Classification:300 Social sciences > 330 Economics
Refereed:No, this document will not be refereed
Created at the University of Regensburg:Yes
Deposited On:23 Sep 2008 09:24
Last Modified:13 Mar 2014 10:32
Item ID:4537
Owner Only: item control page


Downloads per month over past year

  1. Homepage UR

University Library

Publication Server

Contact person
Gernot Deinzer

Phone +49 941 943-2759