Two Mark Nearest Preferential Algorithm in Urban Multi-destination Routing Problem
Yang He · Computer and Modernization · 2008
The study of multi-destination routing problem in urban area can largely reduce distribution time,cut cost,and enhance the efficiency of vehicles.In this paper,the problem is compared with the Traveling Salesman Problem(TSP),and an algorithm is proposed and implemented,which contains some idea from Dijkstra algorithm and nearest preference algorithm of TSP,it can be used to do comparatively precise routing.Experiments show it is practical and reliable in urban logistics distribution.