This paper investigates the multi-commodity multi-service matching problem of synchromodal hinterland container transportation. To improve the computational efficiency, this paper proposes a many-to-one algorithm to solve the many-to-many matching problem. We assess the performance of the proposed method with 51 instances of the problem, and perform sensitivity analysis to analyze the influence of different demand patterns. The computational results indicate that the algorithm is suitable for large-scale instances of the problem.
|Name||Lecture Notes in Computer Science (LNCS)|
|Conference||ICCL 2018: 9th International Conference on Computational Logistics|
|City||Vietri sul Mare|
|Period||1/10/18 → 3/10/18|
- Hinterland container transportation
- Many-to-one algorithm