Optimization of customer orders routing in a collaborative distribution network

Abstract : This paper presents a sequential approach for the assessment of a multi-layered distribution network from a cluster of collaborating suppliers to a large set of customers. The transportation network includes three segments: suppliers routes from suppliers to a consolidation and distribution center, full truckload routes toward regional distribution centers, and less-than-truckload distribution toward final customers. In every shipping date, the optimization problem consists of assigning customers to regional distribution centers and determining the routes of vehicles through the whole distribution network. This problem is first modeled as a Mixed Integer Linear Problem (MILP). Then, we propose to decompose it into three smaller MILPs that are solved sequentially in order to quickly provide a good approximate solution. The experiments on real data show that the decomposition method provides near optimal solutions within a few minutes while the original model would require hours of calculation.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal-mines-nantes.archives-ouvertes.fr/hal-01088626
Contributor : Olivier Péton <>
Submitted on : Friday, November 28, 2014 - 11:56:13 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Long-term archiving on : Friday, April 14, 2017 - 10:49:17 PM

File

rapport auto14-6.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01088626, version 1

Citation

Fabien Lehuédé, Olivier Péton, Xin Tang. Optimization of customer orders routing in a collaborative distribution network. 2014. ⟨hal-01088626⟩

Share

Metrics

Record views

321

Files downloads

1484