Research on the location-routing problem (LRP) is very active, producing a good number of effective exact and approximated solution approaches. It is noteworthy that most of the contributions present in the literature address the single-commodity LRP, whereas the multi-commodity case has been scarcely investigated. Yet, this issue assumes an important role in many LRP applications, particularly in the context of designing single-tier freight distribution City Logistics systems. To fill this gap, we define a new multi-commodity LRP, proposing an original integer linear programming model for it. The proposed formulation takes into account the multi-commodity feature of the problem, modeling the strategic location and the tactical routing decisions using the flow intercepting approach. We therefore name this problem the flow intercepting facility location-routing problem. It is solved by a branch-and-cut algorithm which exploits cuts derived and adapted from literature. The proposed method is successfully experienced and validated on test instances reproducing different network topologies and problem settings.

Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm / Boccia, Maurizio; Crainic, Teodor Gabriel; Sforza, Antonio; Sterle, Claudio. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 89:(2018), pp. 94-112. [10.1016/j.cor.2017.08.013]

Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm

BOCCIA, MAURIZIO;Sforza, Antonio;Sterle, Claudio
2018

Abstract

Research on the location-routing problem (LRP) is very active, producing a good number of effective exact and approximated solution approaches. It is noteworthy that most of the contributions present in the literature address the single-commodity LRP, whereas the multi-commodity case has been scarcely investigated. Yet, this issue assumes an important role in many LRP applications, particularly in the context of designing single-tier freight distribution City Logistics systems. To fill this gap, we define a new multi-commodity LRP, proposing an original integer linear programming model for it. The proposed formulation takes into account the multi-commodity feature of the problem, modeling the strategic location and the tactical routing decisions using the flow intercepting approach. We therefore name this problem the flow intercepting facility location-routing problem. It is solved by a branch-and-cut algorithm which exploits cuts derived and adapted from literature. The proposed method is successfully experienced and validated on test instances reproducing different network topologies and problem settings.
2018
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm / Boccia, Maurizio; Crainic, Teodor Gabriel; Sforza, Antonio; Sterle, Claudio. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 89:(2018), pp. 94-112. [10.1016/j.cor.2017.08.013]
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0305054817302204-main.pdf

solo utenti autorizzati

Tipologia: Documento in Post-print
Licenza: Accesso privato/ristretto
Dimensione 1.49 MB
Formato Adobe PDF
1.49 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/11588/700353
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 42
  • ???jsp.display-item.citation.isi??? 33
social impact