We introduce a methodology for operational planning of cooperation between two independent shippers who manage their own fleets of vehicles in a given geographic area. We assume that shippers are willing to establish partial cooperation by sharing only a subset of customers. Our approach is based on the iterative attempt of identifying subsets of shareable customers which can be fruitfully exchanged between shippers. We resort to classic concepts of vehicle routing literature such as savings and insertion costs, providing both a heuristic and an exact approach.

A savings-based model for two-shipper cooperative routing

Gaudioso, Manlio;Giallombardo, Giovanni;MIGLIONICO, Giovanna
2018-01-01

Abstract

We introduce a methodology for operational planning of cooperation between two independent shippers who manage their own fleets of vehicles in a given geographic area. We assume that shippers are willing to establish partial cooperation by sharing only a subset of customers. Our approach is based on the iterative attempt of identifying subsets of shareable customers which can be fruitfully exchanged between shippers. We resort to classic concepts of vehicle routing literature such as savings and insertion costs, providing both a heuristic and an exact approach.
2018
Horizontal cooperation; Savings algorithm; Vehicle routing problem; Control and Optimization
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/20.500.11770/268244
 Attenzione

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

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