A unified tabu search algorithm for vehicle routing problems with soft time windows

Fu, Z and Eglese, R W and Li, L Y O (2008) A unified tabu search algorithm for vehicle routing problems with soft time windows. Journal of the Operational Research Society, 59 (5). pp. 663-673. ISSN 1476-9360

[img]
Preview
PDF (A unified tabu search algorithm for vehicle routing problems with soft time windows)
10.pdf - Submitted Version

Download (127kB)

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.

Item Type: Journal Article
Journal or Publication Title: Journal of the Operational Research Society
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
Departments: Lancaster University Management School > Management Science
ID Code: 45023
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:25
Refereed?: Yes
Published?: Published
Last Modified: 21 Sep 2019 00:15
URI: https://eprints.lancs.ac.uk/id/eprint/45023

Actions (login required)

View Item View Item