Models and genetic algorithm for designated-points shortest path problem

On the basis of the special requirements of military transportation in routing, the designated-points shortest paths problem is divided into three categories and their mathematics models are established. The improved genetic algorithm for the grouped and order-preserving designated-points shortest paths problem is presented. The algorithm constructs a unique fitness function, which makes that a chromosome with shorter distance and more designated-points would be selected to rebirth into next generation more easily. An order-preserving operation is proposed to ensure that some particular points are connected based on the determined order. By using novel mutation, the global search capability and convergence speed are improved. The experimental results show the effectiveness of the proposed algorithm.