This paper is motivated by the case of a forwarder dealing with inland transportation planning, from a seaport, of inbound containers filled with pallets having different destinations in the land-side. Although the forwarder is not the owner nor controls any vehicle, he is required to plan both the assignment of containers to intermediate depots, where the pallets are unpacked, and the assignment of pallets to the vehicles used for the distribution from depots to consignees. We present a mathematical model supporting the forwarder in this two-echelon network to minimize assignment costs, while accounting for a balanced workload among all carriers involved in this distribution scheme. We discuss a tailor-made implementation of the model in a realistic context and present a heuristic method to solve realistic-sized instances. Our computational experiments confirm the viability of this method.

The forwarder planning problem in a two‐echelon network

Di Francesco, Massimo
Primo
;
Gaudioso, Manlio
Secondo
;
Gorgone, Enrico
Penultimo
;
Zuddas, Paola
Ultimo
2019-01-01

Abstract

This paper is motivated by the case of a forwarder dealing with inland transportation planning, from a seaport, of inbound containers filled with pallets having different destinations in the land-side. Although the forwarder is not the owner nor controls any vehicle, he is required to plan both the assignment of containers to intermediate depots, where the pallets are unpacked, and the assignment of pallets to the vehicles used for the distribution from depots to consignees. We present a mathematical model supporting the forwarder in this two-echelon network to minimize assignment costs, while accounting for a balanced workload among all carriers involved in this distribution scheme. We discuss a tailor-made implementation of the model in a realistic context and present a heuristic method to solve realistic-sized instances. Our computational experiments confirm the viability of this method.
2019
Combinatorial optimization; Forwarder; Freight transportation; Heuristics; Two-echelon networks
File in questo prodotto:
File Dimensione Formato  
Feight_forwarder.pdf

Solo gestori archivio

Tipologia: versione pre-print
Dimensione 313.92 kB
Formato Adobe PDF
313.92 kB 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/278175
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact