This paper explores the issue of emergency transportation routes for coal. The main factors influencing the transportation of coal are taken into account, including transport time, transport costs, and the additional time and costs required for transit transport. The two primary modes of transport for coal are road transport and rail transport, considering unfavorable factors such as the excessive time consumed by waterway transport. In this paper, a coal emergency transport path optimization model is constructed. Moreover, this paper applies a hybrid algorithm of Dijkstra and genetic-simulated annealing to solve the coal transport path model, with minimum time and minimum cost as the objective function. A few transport routes with short paths are initially obtained by Dijkstra's algorithm, and these routes are used as input paths for the genetic-simulated annealing algorithm. Based on this hybrid algorithm, the optimal combination of transport modes is generated by combining population crossover and mutation. The hybrid algorithm can find the exact transport method relatively quickly.
Optimization of Coal Transportation Path Based on Dijkstra and Genetic-Simulated Annealing Algorithm
2021-11-12
1008588 byte
Conference paper
Electronic Resource
English
Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması
BASE | 2020
|Shortest Travel Path Searching System Based on Dijkstra Algorithm
Tema Archive | 2012
|Optimization Vehicle Scheduling Based on Simulated Annealing Genetic Algorithm
Trans Tech Publications | 2014
|Optimal Path Planning of Beidou Navigation System Based on Dijkstra Algorithm
Trans Tech Publications | 2014
|