A many-to-one algorithm to solve a many-to-many matching problem for routing

Conference paper (2018)

Authors

W. Guo Support Marine and Transport Techology
W.W.A. Beelaerts van Blokland Transport Engineering and Logistics - Mechanical, Maritime and Materials Engineering
R.R. Negenborn Transport Engineering and Logistics - Mechanical, Maritime and Materials Engineering
Research Group
Transport Engineering and Logistics (Mechanical, Maritime and Materials Engineering) (TU Delft)
More Info
expand_more

Published Date

2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Mechanical, Maritime and Materials Engineering

Department

Marine and Transport Technology

Research Group

Transport Engineering and Logistics

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.

Files

Guo2018_Chapter_AMany_to_OneAl... (pdf)
(pdf | 0.603 Mb)
Unknown license

Download not available