Quotation Tricoire, Fabien, Doerner, Karl F., Hartl, Richard F., Iori, Manuel. 2011. Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum. 33 (4), 931-959.




The multi-pile vehicle routing problem is a particular combination of loading and routing problems, in which items have to be loaded into different piles within vehicles, and then delivered with minimum cost. The problem is motivated by a real-world timber distribution problem, and is of both theoretical and practical interest. In this paper, we first develop heuristic and exact methods to solve the loading problem. We then include these methods into a tailored combination of Variable Neighborhood Search and Branch-and-Cut, to solve the overall problem. Extensive computational results show how the resulting algorithms are capable of solving to optimality a large number of small-size instances, and of consistently outperforming previous algorithms from the literature on large-size and real-world instances.


Press 'enter' for creating the tag

Publication's profile

Status of publication Published
Affiliation External
Type of publication Journal article
Journal OR Spectrum
Citation Index SCI
WU Journalrating 2009 A
WU-Journal-Rating new FIN-A, INF-A, STRAT-A, VW-C, WH-A
Language English
Title Heuristic and exact algorithms for the multi-pile vehicle routing problem
Volume 33
Number 4
Year 2011
Page from 931
Page to 959
Reviewed? Y
URL https://link.springer.com/article/10.1007/s00291-009-0179-2
DOI https://doi.org/10.1007/s00291-009-0179-2
Open Access N


Tricoire, Fabien (Details)
Doerner, Karl F. (Universität Wien, Austria)
Hartl, Richard F. (Universität Wien, Austria)
Iori, Manuel (Università degli Studi di Modena e Reggio Emilia, Italy)
Google Scholar: Search