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 information. In a previous study the Scatter Search methodology was used to solve the CCP. This algorithm had an excellent performance compared to other ones based on existing benchmark problems. This paper presents the necessary modifications to adopt this approach to the VRP.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: Date of creation: 28 Mar 2007 Date of revision: Handle: RePEc:bay:rdwiwi:769
Note: This paper is part of http://www.opus-bayern.de/uni-regensburg/schriftenreihen_ebene2.php?sr_id=3 Contact details of provider: Postal: D-93040 Regensburg Phone: +49 941 943-2392 Fax: +49 941 943-4752 Email: Web page: http://www.wiwi.uni-regensburg.de/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Marc Reymann) The email address of this maintainer does not seem to be valid anymore. Please ask Marc Reymann to update the entry or send us the correct address..