Please use this identifier to cite or link to this item:
Title: Vehicle routing problem with a heterogeneous fleet and time windows
Authors: Jiang, J.
Ng, K.M. 
Poh, K.L. 
Teo, K.M. 
Keywords: Heuristics
Vehicle routing problem with time windows
Issue Date: 15-Jun-2014
Citation: Jiang, J., Ng, K.M., Poh, K.L., Teo, K.M. (2014-06-15). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications 41 (8) : 3748-3760. ScholarBank@NUS Repository.
Abstract: In this paper, a problem variant of the vehicle routing problem with time windows is introduced to consider vehicle routing with a heterogeneous fleet, a limited number of vehicles and time windows. A method that extends an existing tabu search procedure to solve the problem is then proposed. To evaluate the performance of the proposed method, experiments are conducted on a large set of test cases, which comprises several benchmark problems from numerous problem variants of the vehicle routing problem with a heterogeneous fleet. It is observed that the proposed method can be used to give reasonably good results for these problem variants. In addition, some ideas are presented to advance the research in heuristics, such as fair reporting standards, publication of benchmark problems and executable routines developed for algorithmic comparison. © 2013 Published by Elsevier Ltd.
Source Title: Expert Systems with Applications
ISSN: 09574174
DOI: 10.1016/j.eswa.2013.11.029
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



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