Anticipatory scheduling of synchromodal transport using approximate dynamic programming

DOI10.1007/S10479-022-04668-6MaRDI QIDQ6949446zbMATH OpenFDO

Authors Arturo Pérez Rivera, Martijn Mes

Publication date 1 August 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10479-022-04668-6

zbMATH Keywords

anticipatory schedulingapproximate dynamic programmingintermodal transportreinforcement learningsynchromodal transport

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
• Approximate dynamic programming. Solving the curses of dimensionality
• Bayesian exploration for approximate dynamic programming
• Exploration and exploitation in evolutionary algorithms: a survey
• Model predictive control for simultaneous planning of container and vehicle routes
• Multimodal freight transportation planning: a literature review
• Opportunities for OR in intermodal freight transport research: A review.
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Service and transfer selection for freights in a synchromodal network
• Service network design for freight transportation: a review
• The single-node dynamic service scheduling and dispatching problem

Cited in

(1)

• Optimization and artificial intelligence in logistics management

This page was built for publication: Anticipatory scheduling of synchromodal transport using approximate dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949446)