Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction

From MaRDI portal
Publication:2027056
Jump to:navigation, search

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

zbMATH Keywords

multimodal transportation\(K\) shortest paths algorithmmulti-route planningoversize and heavyweight cargo (OHC)reconstruction of lines and nodes


Mathematics Subject Classification ID

Operations research and management science (90Bxx)


Related Items

Development of a railway out-of-gauge freight transport routing optimal method



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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2027056&oldid=14500289"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki