Optimizing maritime routes: A multi-method analysis from Shanghai to Vladivostok
This research analyzes the marine route plan from Shanghai to Vladivostok utilizing Dijkstra’s algorithm, Markov chain analysis, game theory, and congestion analysis. Dijkstra determines the route through Busan and Hungnam as the shortest, with a total distance of 2114 kilometers and minimal travel...
Saved in:
Main Authors: | Syed Wajahat Ali Bokhari, Nasir Ali, Abid Hussain |
---|---|
Format: | Article |
Language: | English |
Published: |
Croatian Operational Research Society
2025-01-01
|
Series: | Croatian Operational Research Review |
Subjects: | |
Online Access: | https://hrcak.srce.hr/file/473266 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Designing and implementing a Web-based real time routing service for crisis management (a case study for district 11 of Tehran)
by: javad sadidi, et al.
Published: (2019-06-01) -
Searching Optimum Route With Variable Travel Time
by: Yamauchi Shuki, et al.
Published: (2025-01-01) -
Comparison of Continuous-Time Partial Markov Chain Construction by Heuristic Algorithms for Purpose of Approximate Transient Analysis
by: Eimutis Valakevičius, et al.
Published: (2025-01-01) -
Study on the Path of Cultivating and Enhancing National Maritime Awareness Under the Threshold of the Great Power Game
by: WANG Fuxin, et al.
Published: (2024-09-01) -
Manipulation Game Considering No-Regret Strategies
by: Julio B. Clempner
Published: (2025-01-01)