Optimal Shipping Path Algorithm Design for Coastal Port | Zendy

Yunfang Ma | Zendy; Dan Chang | Zendy; Hong Wang | Zendy; Mincong Tang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimal Shipping Path Algorithm Design for Coastal Port

Author(s) -

Yunfang Ma,

Dan Chang,

Hong Wang,

Mincong Tang

Publication year - 2019

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2019.11.298

Subject(s) - container (type theory) , port (circuit theory) , computer science , path (computing) , destinations , shortest path problem , operations research , competition (biology) , maritime industry , premise , dijkstra's algorithm , business , tourism , computer network , engineering , mechanical engineering , graph , ecology , linguistics , philosophy , electrical engineering , theoretical computer science , law , political science , biology , commerce

As coastal port shipping industry is facing severe economic competition currently; coastal port container transportation companies are unable to increase profits by raising container’s mileage freight rate substantially as before. Against such a background, on the premise that the container transportation of coastal ports could arrive at destinations safely, the paper makes improvements on current optimal path algorithm for coastal ports, extends the meaning of optimal path such as the shortest distance, the lowest cost as well as the overall evaluation of path and cost, and made improved verification of the algorithm. By addressing the problem of choosing optimal path for coastal port shipping, the paper aims to promote the quick reaction of container shipping, reduce operation cost, enhance the competitiveness of coastal port container shipping and the economic efficiency of the algorithm, while providing new thoughts for the application of the algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research