Dynamic and Stochastic Shipment Matching Problem in Multimodal Transportation
Author(s) -
Guo Wenjing,
Atasoy Bilge,
Beelaerts van Blokland Wouter,
Negenborn Rudy R.
Publication year - 2020
Publication title -
transportation research record
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.624
H-Index - 119
eISSN - 2169-4052
pISSN - 0361-1981
DOI - 10.1177/0361198120905592
Subject(s) - multimodal transport , flexibility (engineering) , computer science , matching (statistics) , realization (probability) , operations research , stochastic optimization , volume (thermodynamics) , mathematical optimization , transport engineering , engineering , economics , mathematics , statistics , quantum mechanics , physics , management
Multimodal transportation, as an efficient and sustainable alternative to unimodal transportation, refers to the utilization of multiple modes, the utilization of standard loading units, and flexibility in planning. The complexity of multimodal transportation at the operational level lies in being able to deal with dynamic events that are unknown before their realization. However, stochastic information on some of the events might be available from historical data. This paper proposes an anticipatory optimization approach to handle dynamic shipment requests in multimodal transportation by incorporating stochastic information of requests’ origin, destination, volume, announce time, release time and due time. The experimental results show that the anticipatory approach outperforms a myopic approach in which decisions are made only based on deterministic information in reducing total costs under various scenarios of the multimodal matching system.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom