In this paper, we investigate a routing problem arising in the last-mile delivery of small packages. The problem, called Multi-Depot Vehicle Routing Problem with Private fleet and Common carriers (MDVRPPC), is an extension of the Multi-Depot Vehicle Routing Problem (MDVRP) where customers can either be served by the private fleet based at self-owned depots or by common carriers, i.e., subcontractors. We develop an effective Variable Neighborhood Search algorithm based on the use of cyclic-exchange neighborhoods that incorporates an adaptive mechanism to bias the random shaking step. The approach is successfully used to solve MDVRPPC as well as closely related problems, such as the MDVRP and the single-depot VRP with Private fleet and Common carriers (VRPPC), obtaining high quality solutions within short computing time. Our extensive testing on these problems shows the positive impact of the adaptive mechanism with respect to a standard VNS algorithm.

A. Stenger, D. Vigo, S. Enz, M. Schwind (2013). An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping. TRANSPORTATION SCIENCE, 47, 64-80 [10.1287/trsc.1110.0396].

An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping

VIGO, DANIELE;
2013

Abstract

In this paper, we investigate a routing problem arising in the last-mile delivery of small packages. The problem, called Multi-Depot Vehicle Routing Problem with Private fleet and Common carriers (MDVRPPC), is an extension of the Multi-Depot Vehicle Routing Problem (MDVRP) where customers can either be served by the private fleet based at self-owned depots or by common carriers, i.e., subcontractors. We develop an effective Variable Neighborhood Search algorithm based on the use of cyclic-exchange neighborhoods that incorporates an adaptive mechanism to bias the random shaking step. The approach is successfully used to solve MDVRPPC as well as closely related problems, such as the MDVRP and the single-depot VRP with Private fleet and Common carriers (VRPPC), obtaining high quality solutions within short computing time. Our extensive testing on these problems shows the positive impact of the adaptive mechanism with respect to a standard VNS algorithm.
2013
A. Stenger, D. Vigo, S. Enz, M. Schwind (2013). An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping. TRANSPORTATION SCIENCE, 47, 64-80 [10.1287/trsc.1110.0396].
A. Stenger;D. Vigo;S. Enz;M. Schwind
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/183702
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 106
  • ???jsp.display-item.citation.isi??? 97
social impact