On the basis of establishing the optimalmodel ofmilitary transportation routes, a genetic
algorithm was designed to obtain the routewith aminimum generalized weigh.t To solve the problems
of“necessity-nodes”,i. e., the nodes amilitary transportation routemustpass, and order preserving
ofnodes, the rules of coding and the methods of crossover and mutation were constructed. Initial
chromosomeswere predisposed to improve the efficiency of this algorithm. In the end, comparative
experimentswere performed and the experimental resultwas analyzed so as to show the feasibility and
effectiveness of the algorithm.