By Topic

Fast algorithm to solve the most economical path problem in sparse matrices

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
$33 $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)
K. Ambrus-Somogyi ; Óbuda University/Rejto Sándor Faculty, Institute of Media Technology and Light Industry, Budapest, Hungary ; A. Bakó ; P. Földesi ; J. Gáti

Several variations exist of the shortest path problem depending on the type of the graph. The most common problems are the shortest path problem between two points and between every pair of points (the so called multiterminal minimal path problem). Beside this several other variations are known. One of them is the shortest path in a network having gains, the time dependent path, the shortest path in a network, where the travelling time depends on the actual traffic flow. In this paper a powerful algorithm is presented in large scale, sparse network. In long term road network planning problem sometimes the size of the network is very large - about hundred thousand. The network is usually sparse, one point is connected with average 3 or 4 points. It will be shown that the presented algorithm in this case is much more powerful.

Published in:

2012 IEEE 16th International Conference on Intelligent Engineering Systems (INES)

Date of Conference:

13-15 June 2012