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

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

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.
Original languageEnglish
Title of host publicationComputational Logistics
Subtitle of host publicationProceedings of the 9th International Conference, ICCL 2018
EditorsRaffaele Cerulli, Andrea Raiconi, Stefan Voß
Place of PublicationCham, Switzerland
PublisherSpringer
Pages279-294
ISBN (Electronic)978-3-030-00898-7
ISBN (Print)978-3-030-00897-0
DOIs
Publication statusPublished - 2018
EventICCL 2018: 9th International Conference on Computational Logistics - Vietri sul Mare, Italy
Duration: 1 Oct 20183 Oct 2018

Publication series

NameLecture Notes in Computer Science (LNCS)
Volume11184
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceICCL 2018: 9th International Conference on Computational Logistics
CountryItaly
CityVietri sul Mare
Period1/10/183/10/18

Keywords

  • Hinterland container transportation
  • Synchromodality
  • Multi-commodity
  • Matching
  • Many-to-one algorithm

Fingerprint Dive into the research topics of 'A many-to-one algorithm to solve a many-to-many matching problem for routing'. Together they form a unique fingerprint.

Cite this