Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33278
Title: An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints
Authors: Pang, KW 
Keywords: Metaheuristics
Route construction
Time windows
Vehicle routing
Issue Date: 2011
Publisher: Pergamon Press
Source: Expert systems with applications, 2011, v. 38, no. 9, p. 11939-11946 How to cite?
Journal: Expert systems with applications 
Abstract: Vehicle routing problem with time windows (VRPTW) is a generalisation of the classical vehicle routing problem, where a group of customers with given capacity demand are required to be serviced, and the servicing of the customer demands has to be started within a restricted available time window at the customer locations. This class of routing problems can be used to solve many practical problems such as container truck routing, delivery service scheduling and many logistics system problems. In this paper, we present a route construction heuristic with an adaptive parallel scheme. The result from extensive computation experiments shows the proposed parallel route construction heuristic is efficient and effective for routes construction, which is particularly useful for generation of the initial solutions for many metaheuristic approaches with improved solution quality and convergence of the solution process.
URI: http://hdl.handle.net/10397/33278
ISSN: 0957-4174
EISSN: 1873-6793
DOI: 10.1016/j.eswa.2011.03.088
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

24
Last Week
0
Last month
2
Citations as of Sep 9, 2017

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
0
Citations as of Sep 13, 2017

Page view(s)

74
Last Week
5
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.