Logistics Vehicle Routing Problem between Two Objects based on Real-Time Traffic Data
Efficient fastest path computation on a large scale road network is an essential problem in logistics distribution,especially based on real-time traffic information.In this paper,we present an adaptive fastest path algorithm capable of efficiently accounting for the network with real-time traffic data.(1) Logistics vehicle routing between two cities usually choose the road network through the largest roads.According to this traveler character and the natural hierarchy present in road network,we classify the roads into largest roads and smaller ones.(2) Based on the largestest roads and smaller roads,we can partition the road network into areas.(3) Finally,we propose an efficient A* algorithm that uses the road network partition to limit the search space and considers the real-time traffic information.Through an extensive experimental evaluation on real road network we show that our algorithm provides desirable routes,and that it significantly fast and effective.
A* algorithm road hierarchy traveler character based vehicle routing problem
Shuying Lin Wenxue Cai
School of Economics and CommerceSouth China University of TechnologyGuangzhou,China School of Economics and Commerce South China University of Technology Guangzhou,China
国际会议
北京
英文
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）