| Title: |
Vehicle Sequencing at Transshipment Terminals with Handover Relations. |
| Authors: |
Briskorn, Dirk; Fliedner, Malte; Tschöke, Martin |
| Source: |
INFORMS Journal on Computing; Spring2021, Vol. 33 Issue 2, p477-494, 18p |
| Subject Terms: |
TRANSSHIPMENT; JOINTS (Engineering); STATISTICAL decision making; COMPUTATIONAL complexity; GRAPH theory; CONTAINER terminals; TERMINALS (Transportation) |
| Abstract: |
Operational planning at transshipment nodes is a wide and challenging field of research that covers a vast number of distinct relevant applications, spanning from seaport container terminals to rail terminals to cross-docks. In this work, we study the feasibility version of a fundamental synchronization problem that assigns incoming vehicles to docking resources subject to handover relations. We carry out a comprehensive analysis of computational complexity of various problem variants and establish structural connections to famous decision problems in graph theory. We further propose an exact solution algorithm for finding feasible dock assignments, if vehicles can visit the node only once and evaluate its performance in a comprehensive computational study. [ABSTRACT FROM AUTHOR] |
| : |
Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |