Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Guo, W., Beelaerts van Blokland, W., & Negenborn, R. R. (2018). A many-to-one algorithm to solve a many-to-many matching problem for routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11184 LNCS, pp. 279–294). Springer Verlag. https://doi.org/10.1007/978-3-030-00898-7_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
