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

Wenjing Guo; Wouter Beelaerts van Blokland; Rudy Negenborn

doi:10.1007/978-3-030-00898-7_18

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

Wenjing Guo, Wouter Beelaerts van Blokland, Rudy Negenborn

Transport Engineering and Logistics

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

3 Citations (Scopus)

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 language	English
Title of host publication	Computational Logistics
Subtitle of host publication	Proceedings of the 9th International Conference, ICCL 2018
Editors	Raffaele Cerulli, Andrea Raiconi, Stefan Voß
Place of Publication	Cham, Switzerland
Publisher	Springer
Pages	279-294
ISBN (Electronic)	978-3-030-00898-7
ISBN (Print)	978-3-030-00897-0
DOIs	https://doi.org/10.1007/978-3-030-00898-7_18
Publication status	Published - 2018
Event	ICCL 2018: 9th International Conference on Computational Logistics - Vietri sul Mare, Italy Duration: 1 Oct 2018 → 3 Oct 2018

Publication series

Name	Lecture Notes in Computer Science (LNCS)
Volume	11184
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	ICCL 2018: 9th International Conference on Computational Logistics
Country/Territory	Italy
City	Vietri sul Mare
Period	1/10/18 → 3/10/18

Keywords

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

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-030-00898-7_18

Cite this

Guo, W., Beelaerts van Blokland, W., & Negenborn, R. (2018). A many-to-one algorithm to solve a many-to-many matching problem for routing. In R. Cerulli, A. Raiconi, & S. Voß (Eds.), Computational Logistics: Proceedings of the 9th International Conference, ICCL 2018 (pp. 279-294). (Lecture Notes in Computer Science (LNCS); Vol. 11184). Springer. https://doi.org/10.1007/978-3-030-00898-7_18

Guo, Wenjing ; Beelaerts van Blokland, Wouter ; Negenborn, Rudy. / A many-to-one algorithm to solve a many-to-many matching problem for routing. Computational Logistics: Proceedings of the 9th International Conference, ICCL 2018. editor / Raffaele Cerulli ; Andrea Raiconi ; Stefan Voß. Cham, Switzerland : Springer, 2018. pp. 279-294 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{dd76698e7f9a4b7b98256d53e204d0c5,

title = "A many-to-one algorithm to solve a many-to-many matching problem for routing",

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.",

keywords = "Hinterland container transportation, Synchromodality , Multi-commodity, Matching, Many-to-one algorithm ",

author = "Wenjing Guo and {Beelaerts van Blokland}, Wouter and Rudy Negenborn",

year = "2018",

doi = "10.1007/978-3-030-00898-7_18",

language = "English",

isbn = "978-3-030-00897-0",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "279--294",

editor = "Cerulli, {Raffaele } and Raiconi, {Andrea } and Vo{\ss}, {Stefan }",

booktitle = "Computational Logistics",

note = "ICCL 2018: 9th International Conference on Computational Logistics ; Conference date: 01-10-2018 Through 03-10-2018",

}

Guo, W, Beelaerts van Blokland, W & Negenborn, R 2018, A many-to-one algorithm to solve a many-to-many matching problem for routing. in R Cerulli, A Raiconi & S Voß (eds), Computational Logistics: Proceedings of the 9th International Conference, ICCL 2018. Lecture Notes in Computer Science (LNCS), vol. 11184, Springer, Cham, Switzerland, pp. 279-294, ICCL 2018: 9th International Conference on Computational Logistics, Vietri sul Mare, Italy, 1/10/18. https://doi.org/10.1007/978-3-030-00898-7_18

A many-to-one algorithm to solve a many-to-many matching problem for routing. / Guo, Wenjing; Beelaerts van Blokland, Wouter ; Negenborn, Rudy.
Computational Logistics: Proceedings of the 9th International Conference, ICCL 2018. ed. / Raffaele Cerulli; Andrea Raiconi; Stefan Voß. Cham, Switzerland: Springer, 2018. p. 279-294 (Lecture Notes in Computer Science (LNCS); Vol. 11184).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

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

AU - Guo, Wenjing

AU - Beelaerts van Blokland, Wouter

AU - Negenborn, Rudy

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - Hinterland container transportation

KW - Synchromodality

KW - Multi-commodity

KW - Matching

KW - Many-to-one algorithm

U2 - 10.1007/978-3-030-00898-7_18

DO - 10.1007/978-3-030-00898-7_18

M3 - Conference contribution

SN - 978-3-030-00897-0

T3 - Lecture Notes in Computer Science (LNCS)

SP - 279

EP - 294

BT - Computational Logistics

A2 - Cerulli, Raffaele

A2 - Raiconi, Andrea

A2 - Voß, Stefan

PB - Springer

CY - Cham, Switzerland

T2 - ICCL 2018: 9th International Conference on Computational Logistics

Y2 - 1 October 2018 through 3 October 2018

ER -

Guo W, Beelaerts van Blokland W , Negenborn R. A many-to-one algorithm to solve a many-to-many matching problem for routing. In Cerulli R, Raiconi A, Voß S, editors, Computational Logistics: Proceedings of the 9th International Conference, ICCL 2018. Cham, Switzerland: Springer. 2018. p. 279-294. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-030-00898-7_18

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

Abstract

Publication series

Conference

Keywords

UN SDGs

Access to Document

Fingerprint

Cite this