A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

D. C. Paraskevopoulos, P. P. Repoussis, C. D. Tarantilis, G. Ioannou, G. P. Prastacos

Research output: Contribution to journalArticle

62 Citations (Scopus)

Abstract

This paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both the total distance travelled by vehicles and the fixed vehicle costs, such that all problem's constraints are satisfied. The problem is solved using a two-phase solution framework based upon a hybridized Tabu Search, within a new Reactive Variable Neighborhood Search metaheuristic algorithm. Computational experiments on benchmark data sets yield high quality solutions, illustrating the effectiveness of the approach and its applicability to realistic routing problems.
Original languageEnglish
Pages (from-to)425-455
Number of pages21
JournalJournal of Heuristics
Volume14
Issue number5
DOIs
Publication statusPublished - 1 Oct 2008

Fingerprint Dive into the research topics of 'A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows'. Together they form a unique fingerprint.

  • Cite this

    Paraskevopoulos, D. C., Repoussis, P. P., Tarantilis, C. D., Ioannou, G., & Prastacos, G. P. (2008). A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. Journal of Heuristics, 14(5), 425-455. https://doi.org/10.1007/s10732-007-9045-z