By Topic

Simplified algorithm on network shortest path problem

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

1 Author(s)
Xie Jin-bao ; Sch. of Traffic & Transp., Lanzhou Jiaotong Univ., Lanzhou, China

An algorithm on the network shortest path problem by gradually eliminating loops on a network is put forward. Using the wagon routing arrowhead line, we start from the origin, plot the routing arrowhead lines in the current loop and the adjacent loops, and decide which edge the arrowhead pointed to should be moved; then according to the structure of the candidate edges to be removed and certain regulations, remove one edge to enlarge the current loop; select the loop nearest to the origin and repeat the above process, until obtain the shortest routing tree taking the origin as its root. The case study carried out shows that the algorithm is simple, practical, knowable, and suitable for manual searching the shortest route on a simple non-directional network.

Published in:

Business Management and Electronic Information (BMEI), 2011 International Conference on  (Volume:5 )

Date of Conference:

13-15 May 2011