ABSTRACT
Single-path vehicle arrangement belongs to single loop transportation. It is defined that in transportation route optimization, which is assumed to be a set ‘A’, it is possible to find a loop path to traverse all nodes, eventually return to the initial node, aiming to achieve the shortest driving distance. Traveling Salesman Problem (TSP) is one of the most typical representatives (Grahovae J. & Chakravarty A. 2001). Scholars who are researching on this problem divided the model into single-objective model and multi-objective model, early used branch-bound algorithm to figure them out. But, due to these accurate algorithms were seldom used to deal with practical application, recently they tend to use a heuristic algorithm (Chart L. M. A. et al. 2002) to solve such problems.
