Home > Research > Publications & Outputs > A unified tabu search algorithm for vehicle rou...

Research

Electronic data

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A unified tabu search algorithm for vehicle routing problems with soft time windows. / Fu, Z; Eglese, R W; Li, L Y O.
In: Journal of the Operational Research Society, Vol. 59, No. 5, 2008, p. 663-673.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Fu, Z, Eglese, RW & Li, LYO 2008, 'A unified tabu search algorithm for vehicle routing problems with soft time windows', Journal of the Operational Research Society, vol. 59, no. 5, pp. 663-673. https://doi.org/10.1057/palgrave.jors.2602371

APA

Fu, Z., Eglese, R. W., & 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), 663-673. https://doi.org/10.1057/palgrave.jors.2602371

Vancouver

Fu Z, Eglese RW, Li LYO. A unified tabu search algorithm for vehicle routing problems with soft time windows. Journal of the Operational Research Society. 2008;59(5):663-673. doi: 10.1057/palgrave.jors.2602371

Author

Fu, Z ; Eglese, R W ; Li, L Y O. / A unified tabu search algorithm for vehicle routing problems with soft time windows. In: Journal of the Operational Research Society. 2008 ; Vol. 59, No. 5. pp. 663-673.

Bibtex

@article{dc12d22fab934006902d17a3f28cc745,
title = "A unified tabu search algorithm for vehicle routing problems with soft time windows",
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.",
author = "Z Fu and Eglese, {R W} and Li, {L Y O}",
year = "2008",
doi = "10.1057/palgrave.jors.2602371",
language = "English",
volume = "59",
pages = "663--673",
journal = "Journal of the Operational Research Society",
issn = "1476-9360",
publisher = "Taylor and Francis Ltd.",
number = "5",

}

RIS

TY - JOUR

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

AU - Fu, Z

AU - Eglese, R W

AU - Li, L Y O

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1057/palgrave.jors.2602371

DO - 10.1057/palgrave.jors.2602371

M3 - Journal article

VL - 59

SP - 663

EP - 673

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 1476-9360

IS - 5

ER -