A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph

David S.W. Lai, Ozgun Caliskan Demirag, Janny M.Y. Leung

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

60 Citaten (Scopus)

Samenvatting

We study a time-constrained heterogeneous vehicle routing problem on a multigraph where parallel arcs between pairs of vertices represent different travel options based on criteria such as time, cost, and distance. We formulate the problem as a mixed-integer linear programming model and develop a tabu search heuristic that efficiently addresses computational challenges due to parallel arcs. Numerical experiments show that the heuristic is highly effective and that freight operators can achieve advantages in cost and customer service by considering alternative paths, especially when route duration limits are restrictive and/or when vehicles of smaller capacity are dispatched to serve remote customers.

Originele taal-2Engels
Pagina's (van-tot)32-52
Aantal pagina's21
TijdschriftTransportation Research Part E: Logistics and Transportation Review
Volume86
DOI's
StatusGepubliceerd - 1 feb 2016
Extern gepubliceerdJa

Vingerafdruk

Duik in de onderzoeksthema's van 'A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph'. Samen vormen ze een unieke vingerafdruk.

Citeer dit