We investigate a multiperiod drayage problem in which customers request transportation services over several days, possibly leaving the carrier some flexibility to change service periods. We compare three approaches for the problem: a path-based model with all feasible routes, a “Price-and-Branch” algorithm in which the pricing is formulated as a collection of shortest path problems in a cunningly constructed acyclic network, and a compact arc-flow formulation based on this network. The experiments shows that the latter formulation is the most efficient, and can solve to optimality instances of real- world size (and beyond) in time compatible with typical operational constraints. Also, the models allow us to assess that limited amounts of flexibility from customers can significantly improve routing costs for the carrier while decreasing customers’ cost as well.

A multiperiod drayage problem with customer-dependent service periods

Ali Ghezelsoflu;Massimo Di Francesco
;
Paola Zuddas
2021-01-01

Abstract

We investigate a multiperiod drayage problem in which customers request transportation services over several days, possibly leaving the carrier some flexibility to change service periods. We compare three approaches for the problem: a path-based model with all feasible routes, a “Price-and-Branch” algorithm in which the pricing is formulated as a collection of shortest path problems in a cunningly constructed acyclic network, and a compact arc-flow formulation based on this network. The experiments shows that the latter formulation is the most efficient, and can solve to optimality instances of real- world size (and beyond) in time compatible with typical operational constraints. Also, the models allow us to assess that limited amounts of flexibility from customers can significantly improve routing costs for the carrier while decreasing customers’ cost as well.
File in questo prodotto:
File Dimensione Formato  
CAOR_105189.pdf

Solo gestori archivio

Tipologia: versione editoriale
Dimensione 2.04 MB
Formato Adobe PDF
2.04 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/11584/303831
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact