Service and transfer selection for freights in a synchromodal network

Arturo Pérez Rivera, Martijn Mes

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

Abstract

We study the problem of selecting services and transfers in a synchromodal network to transport freights with different characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new freights that arrive each period. Although freights become known gradually over time, the planner has probabilistic knowledge about their arrival. Using this knowledge, the planner balances current and future costs at each period, with the objective of minimizing the expected costs over the entire horizon. To model this stochastic finite horizon optimization problem, we propose a Markov Decision Process (MDP) model. To overcome the computational complexity of solving the MDP, we propose a heuristic approach based on approximate dynamic programming. Using different problem settings, we show that our look-ahead approach has significant benefits compared to a benchmark heuristic.
Original languageEnglish
Title of host publicationComputational Logistics
Subtitle of host publication7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings
EditorsAna Paias, Mario Ruthmair, Stefan Voß
Place of PublicationCham
PublisherSpringer
Pages227-242
ISBN (Electronic)978-3-319-44896-1
ISBN (Print)978-3-319-44896-1
DOIs
Publication statusPublished - 7 Sep 2016
Event7th International Conference on Computational Logistics, ICCL 2016 - Lisbon, Portugal
Duration: 7 Sep 20169 Sep 2016
Conference number: 7

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9855
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Computational Logistics, ICCL 2016
Abbreviated titleICCL
CountryPortugal
CityLisbon
Period7/09/169/09/16

Fingerprint

Stochastic models
Dynamic programming
Costs
Computational complexity

Keywords

  • METIS-318326
  • IR-101808

Cite this

Pérez Rivera, A., & Mes, M. (2016). Service and transfer selection for freights in a synchromodal network. In A. Paias, M. Ruthmair, & S. Voß (Eds.), Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings (pp. 227-242). (Lecture Notes in Computer Science; Vol. 9855). Cham: Springer. https://doi.org/10.1007/978-3-319-44896-1_15
Pérez Rivera, Arturo ; Mes, Martijn. / Service and transfer selection for freights in a synchromodal network. Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings. editor / Ana Paias ; Mario Ruthmair ; Stefan Voß. Cham : Springer, 2016. pp. 227-242 (Lecture Notes in Computer Science).
@inproceedings{119c1927e55f487dbf01b49c0bedb370,
title = "Service and transfer selection for freights in a synchromodal network",
abstract = "We study the problem of selecting services and transfers in a synchromodal network to transport freights with different characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new freights that arrive each period. Although freights become known gradually over time, the planner has probabilistic knowledge about their arrival. Using this knowledge, the planner balances current and future costs at each period, with the objective of minimizing the expected costs over the entire horizon. To model this stochastic finite horizon optimization problem, we propose a Markov Decision Process (MDP) model. To overcome the computational complexity of solving the MDP, we propose a heuristic approach based on approximate dynamic programming. Using different problem settings, we show that our look-ahead approach has significant benefits compared to a benchmark heuristic.",
keywords = "METIS-318326, IR-101808",
author = "{P{\'e}rez Rivera}, Arturo and Martijn Mes",
year = "2016",
month = "9",
day = "7",
doi = "10.1007/978-3-319-44896-1_15",
language = "English",
isbn = "978-3-319-44896-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "227--242",
editor = "Ana Paias and Mario Ruthmair and Stefan Vo{\ss}",
booktitle = "Computational Logistics",

}

Pérez Rivera, A & Mes, M 2016, Service and transfer selection for freights in a synchromodal network. in A Paias, M Ruthmair & S Voß (eds), Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9855, Springer, Cham, pp. 227-242, 7th International Conference on Computational Logistics, ICCL 2016, Lisbon, Portugal, 7/09/16. https://doi.org/10.1007/978-3-319-44896-1_15

Service and transfer selection for freights in a synchromodal network. / Pérez Rivera, Arturo; Mes, Martijn.

Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings. ed. / Ana Paias; Mario Ruthmair; Stefan Voß. Cham : Springer, 2016. p. 227-242 (Lecture Notes in Computer Science; Vol. 9855).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

TY - GEN

T1 - Service and transfer selection for freights in a synchromodal network

AU - Pérez Rivera, Arturo

AU - Mes, Martijn

PY - 2016/9/7

Y1 - 2016/9/7

N2 - We study the problem of selecting services and transfers in a synchromodal network to transport freights with different characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new freights that arrive each period. Although freights become known gradually over time, the planner has probabilistic knowledge about their arrival. Using this knowledge, the planner balances current and future costs at each period, with the objective of minimizing the expected costs over the entire horizon. To model this stochastic finite horizon optimization problem, we propose a Markov Decision Process (MDP) model. To overcome the computational complexity of solving the MDP, we propose a heuristic approach based on approximate dynamic programming. Using different problem settings, we show that our look-ahead approach has significant benefits compared to a benchmark heuristic.

AB - We study the problem of selecting services and transfers in a synchromodal network to transport freights with different characteristics, over a multi-period horizon. The evolution of the network over time is determined by the decisions made, the schedule of the services, and the new freights that arrive each period. Although freights become known gradually over time, the planner has probabilistic knowledge about their arrival. Using this knowledge, the planner balances current and future costs at each period, with the objective of minimizing the expected costs over the entire horizon. To model this stochastic finite horizon optimization problem, we propose a Markov Decision Process (MDP) model. To overcome the computational complexity of solving the MDP, we propose a heuristic approach based on approximate dynamic programming. Using different problem settings, we show that our look-ahead approach has significant benefits compared to a benchmark heuristic.

KW - METIS-318326

KW - IR-101808

U2 - 10.1007/978-3-319-44896-1_15

DO - 10.1007/978-3-319-44896-1_15

M3 - Conference contribution

SN - 978-3-319-44896-1

T3 - Lecture Notes in Computer Science

SP - 227

EP - 242

BT - Computational Logistics

A2 - Paias, Ana

A2 - Ruthmair, Mario

A2 - Voß, Stefan

PB - Springer

CY - Cham

ER -

Pérez Rivera A, Mes M. Service and transfer selection for freights in a synchromodal network. In Paias A, Ruthmair M, Voß S, editors, Computational Logistics: 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings. Cham: Springer. 2016. p. 227-242. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-44896-1_15