Research on applications of the logistic routine problem with enhanced ant algorithm

The structure of logistic routine problem described corresponding to the structure and parameters of M-TSP is studied. The optimizing method of the main logistic routine problem is brought forward. To deal with the M-TSP, which has the constrains and optimizing objectives of logistic routine problem, the optimizing methods are presented. The combinatorial optimization problem which is NP-complete in M-TSP is solved by enhanced ant algorithm. Simulations on some different dimensions of TSP examples have shown that the ant algorithm has effective convergence with good robustness and is supposed to be practical.