By Topic

Polynomial time minimum cost path algorithms for acyclic networks of C-depth bridges with piece-wise linear time-varying travel costs and transit delays

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

3 Author(s)
Nakamura, M. ; Fac. of Eng., Ryukyus Univ., Okinawa, Japan ; Kyan, S. ; Onaga, K.

Minimum cost path problems are considered for time-varying networks which possess piecewise linear travel costs/transit delays on edges and constant parking costs/enterable-unenterable restrictions on nodes. The arrival characteristics and departure characteristics are formulated, and their computation algorithms are designed. These characteristics are not values but curves with respect to generic time, which are novel features contrasted with the conventional time-invariant problems. Piecewise linearity of costs and delays drastically reduces the computational complexity

Published in:

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on  (Volume:4 )

Date of Conference:

3-6 May 1992