Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
From MaRDI portal
Publication:2027056
DOI10.1016/j.cor.2020.105172OpenAlexW3111566991MaRDI QIDQ2027056
Yan Luo, Jiaxiao Huang, Yinggui Zhang, Huiyu Yang
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105172
multimodal transportation\(K\) shortest paths algorithmmulti-route planningoversize and heavyweight cargo (OHC)reconstruction of lines and nodes
Related Items
Cites Work
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Best routes selection in multimodal networks using multi-objective genetic algorithm
- Finding the \(K\) shortest paths in a schedule-based transit network
- Best routes selection in international intermodal networks
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Finding the k Shortest Paths
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- Finding the K Shortest Loopless Paths in a Network