A Method Of Path Planning For Multimodal Transportation Based On Genetic Algorithm

Multimodal transportation is an important way to strengthen the capability of force projection, and the first step of program a transport program is finding the most appropriate path. To solve this problem, a solution the main frame of which is genetic algorithm is proposed in this paper.Firstly, the usage of multimodal transportation in military transport is analyzed from the perspective of transportation demand, transportation process and application scenarios. Then the problem of routing in multimodal transportation is proposed and a mathematical modal in consideration of time, cost and distance is formulated.To improve the computational efficiency of genetic algorithm, the subproblem that how to find the shortest route in a single mode network is separated from the main problem based on hierarchical spatial reasoning. The topology of multimodal transportation network is built by divided the network of railway, waterway, highway and airway into zones and layers, which can also reduce the scale of geographical data.When applying the genetic algorithm into solving the problem, the fundamental elements are designed meticulously, and some measures are taken to improve the efficiency of this problem. A* algorithm is used to find the shortest route between two nodes due to its higher efficiency compared with Dijkstra algorithm. The redundancy of geographic data is employed to make further efforts for the efficiency of the genetic algorithm.At last, the solution proposed above is confirmed feasible through experiments.