By Topic

Research on Path Scheduling Model and its Stochastic Evolutionary Algorithm with Uncertain Node Set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiao-Hu Xing ; Logistics Res. Center, Shanghai Maritime Univ., Shanghai, China ; Zhi-Hua Hu ; Bin Yang ; Yan-Ping Meng

In general path planning problem, the road network is presumed to be determined, and real-time optimization method is used to establish optimal path. The result of this approach is not practical. In the rapidly developing China, the road network in fact is changing rapidly, while the road networks of the electronic maps are often not real-time updated; even if the path of their own real-time planning is feasible, the driver will take more time significantly than expected be because of lack of experience on the new road. Considering the uncertainty of the passed nodes, it is feasible to generate stable periodic path to balance the cost and time spent in the path. In this paper, path planning model with uncertainly passed nodes is proposed and a stochastic evolutionary algorithm is designed. Simulation studies show that the model is valid with promising solving performance. The achievement is expected to be integrated in the distribution or transportation decision support system for route planning.

Published in:

Information Science and Management Engineering (ISME), 2010 International Conference of  (Volume:1 )

Date of Conference:

7-8 Aug. 2010