Abstract This paper introduces a mixed integer programming model for the two-echelon production routing problem with cross-docking satellites. This problem is important in e-commerce, home delivery services, and city logistics. To solve this problem, we propose a branch-and-cut algorithm with proved valid inequalities and a matheuristic that can provide feasible initial solutions. Extensive computational results are reported, which are obtained on instances derived from benchmarks for the production routing problems and two echelon vehicle routing problems. Management insights on dynamic balance among handling costs, inventory costs, and routing costs are also drawn from the sensitivity analysis.
The two-echelon production routing problem with cross-docking satellites
Yuzhuo Qiu,Dan Zhou,Yanan Du,Jie Liu,P. Pardalos,Jun Qiao
Published 2021 in Transportation Research Part E: Logistics and Transportation Review
ABSTRACT
PUBLICATION RECORD
- Publication year
2021
- Venue
Transportation Research Part E: Logistics and Transportation Review
- Publication date
2021-03-01
- Fields of study
Business, Engineering, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-37 of 37 references · Page 1 of 1
CITED BY
Showing 1-31 of 31 citing papers · Page 1 of 1