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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Arslan, A., Agatz, N., Kroon, L.G., Zuidwijk, R.A.: Crowdsourced delivery - a pickup and delivery problem with ad-hoc drivers. SSRN Electron. J. 1–26 (2016)
Chen, W., Mes, M., Schutten, M.: Multi-hop driver-parcel matching problem with time windows. Flex. Serv. Manuf. J. 1–37 (2017)
Eurostat: Modal split of freight transport (2018). http://ec.europa.eu/eurostat/tgm/refreshTableAction.do?tab=table&plugin=1&pcode=t2020_rk320&language=en
Guo, W., Beelaerts van Blokland, W., Lodewijks, G.: Survey on characteristics and challenges of synchromodal transportation in global cold chains. In: Bektaş, T., Coniglio, S., Martinez-Sykora, A., Voß, S. (eds.) Computational Logistics. LNCS, vol. 10572, pp. 420–434. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68496-3_28
Guo, W., Beelaerts van Blokland, W., Negenborn, R.R.: Multi-commodity multi-service matching design for hinterland container transportation. Delft University of Technology, Technical report (2018)
Mahmoudi, M., Zhou, X.: Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: a dynamic programming approach based on state–space–time network representations. Transp. Res. Part B Methodol. 89, 19–42 (2016)
Masoud, N., Jayakrishnan, R.: A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system. Transp. Res. Part B Methodol. 106, 218–236 (2017)
van Riessen, B., Negenborn, R.R., Dekker, R.: Real-time container transport planning with decision trees based on offline obtained optimal solutions. Decis. Support Syst. 89, 1–16 (2016)
van Riessen, B., Negenborn, R.R., Lodewijks, G., Dekker, R.: Impact and relevance of transit disturbances on planning in intermodal container networks using disturbance cost analysis. Maritime Econ. Logist. 17(4), 440–463 (2014)
SteadieSeifi, M., Dellaert, N., Nuijten, W., Woensel, T.V., Raoufi, R.: Multimodal freight transportation planning: a literature review. Eur. J. Oper. Res. 233(1), 1–15 (2014)
Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: The benefits of meeting points in ride-sharing systems. Transp. Res. Part B Methodol. 82, 36–53 (2015)
Acknowledgments
This research is financially supported by the China Scholarship Council under Grant 201606950003.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
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: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-00898-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00897-0
Online ISBN: 978-3-030-00898-7
eBook Packages: Computer ScienceComputer Science (R0)