This paper introduces a rolling horizon algorithm to plan the delivery of vehicles to automotive dealers by a heterogeneous fleet of auto-carriers. The problem consists in scheduling the deliveries over a multiple-day planning horizon during which requests for transportation arrive dynamically. In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers. The objective is to minimize the sum of traveled distances, fixed costs for auto-carrier operation, service costs, and penalties for late deliveries. The problem is solved by a heuristic that first selects the vehicles to be delivered in the next few days and then optimizes the deliveries by an iterated local search procedure. A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework. Computational results on data from a major European logistics service provider show that the heuristic is fast and yields significant improvements compared to the sequential solution of independent daily problems.

A rolling horizon algorithm for auto-carrier transportation / Cordeau, Jean François; Dell'Amico, Mauro; Falavigna, Simone; Iori, Manuel. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - STAMPA. - 76:(2015), pp. 68-80. [10.1016/j.trb.2015.02.009]

A rolling horizon algorithm for auto-carrier transportation

DELL'AMICO, Mauro;FALAVIGNA, SIMONE;IORI, MANUEL
2015

Abstract

This paper introduces a rolling horizon algorithm to plan the delivery of vehicles to automotive dealers by a heterogeneous fleet of auto-carriers. The problem consists in scheduling the deliveries over a multiple-day planning horizon during which requests for transportation arrive dynamically. In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers. The objective is to minimize the sum of traveled distances, fixed costs for auto-carrier operation, service costs, and penalties for late deliveries. The problem is solved by a heuristic that first selects the vehicles to be delivered in the next few days and then optimizes the deliveries by an iterated local search procedure. A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework. Computational results on data from a major European logistics service provider show that the heuristic is fast and yields significant improvements compared to the sequential solution of independent daily problems.
76
68
80
A rolling horizon algorithm for auto-carrier transportation / Cordeau, Jean François; Dell'Amico, Mauro; Falavigna, Simone; Iori, Manuel. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - STAMPA. - 76:(2015), pp. 68-80. [10.1016/j.trb.2015.02.009]
Cordeau, Jean François; Dell'Amico, Mauro; Falavigna, Simone; Iori, Manuel
File in questo prodotto:
File Dimensione Formato  
DellAmico-Falavigna-Iori-TRB-2015.pdf

non disponibili

Descrizione: Articolo principale
Tipologia: Versione dell'editore (versione pubblicata)
Dimensione 582.2 kB
Formato Adobe PDF
582.2 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1066047
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 21
social impact