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

Z. Fu, R. Eglese, Yuk On Li

Research output: Journal article publicationJournal articleAcademic researchpeer-review

51 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)663-673
Number of pages11
JournalJournal of the Operational Research Society
Issue number5
Publication statusPublished - 13 May 2008


  • Distribution
  • Heuristics
  • Soft time windows
  • Tabu search
  • Vehicle routing

ASJC Scopus subject areas

  • Management of Technology and Innovation
  • Strategy and Management
  • Management Science and Operations Research

Cite this