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

M Nakamura,S Kyan,K Onaga

doi:10.1109/iscas.1992.230445

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

M Nakamura, S Kyan + Show 1 more

https://doi.org/10.1109/iscas.1992.230445

Copy DOI

Publication Date: May 3, 1992

Affiliation: University of the Ryukyus University Hospital, Hiroshima University

#Piecewise Linear #Minimum Cost Path + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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. >

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.