Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/11470
Title: | A unified tabu search algorithm for vehicle routing problems with soft time windows | Authors: | Fu, Z Eglese, R Li, LYO |
Keywords: | Distribution Heuristics Soft time windows Tabu search Vehicle routing |
Issue Date: | 2008 | Publisher: | Palgrave Macmillan | Source: | Journal of the Operational Research Society, 2008, v. 59, no. 5, p. 663-673 How to cite? | Journal: | Journal of the Operational Research Society | Abstract: | The different ways of allowing time window violations lead to different types of the vehicle routing problems with soft time windows (VRPSTW). In this paper, different types of VRPSTW are analysed. A unified penalty function and a unified tabu search algorithm for the main types of VRPSTW are presented, with which different types of VRPSTW can be solved by simply changing the values of corresponding parameters in the penalty function. Computational results on benchmark problems are provided and compared with other methods in the literature. Some best known solutions for the benchmark problems in the literature have been improved with the proposed algorithm. | URI: | http://hdl.handle.net/10397/11470 | ISSN: | 0160-5682 | EISSN: | 1476-9360 | DOI: | 10.1057/palgrave.jors.2602371 |
Appears in Collections: | Journal/Magazine Article |
Show full item record
SCOPUSTM
Citations
22
Last Week
0
0
Last month
0
0
Citations as of Apr 7, 2018
WEB OF SCIENCETM
Citations
18
Last Week
0
0
Last month
0
0
Citations as of Apr 21, 2018
Page view(s)
62
Last Week
5
5
Last month
Citations as of Apr 23, 2018

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