Change search
ReferencesLink to record
Permanent link

Direct link
Minimum Work Paths in Elevated Networks
Department of Geoinformation and Cartography, Vienna University of Technology.ORCID iD: 0000-0001-5572-7395
2008 (English)In: Networks, ISSN 0028-3045, E-ISSN 1097-0037, Vol. 52, no 2, 88-97 p.Article in journal (Refereed) Published
Abstract [en]

A new variant of the shortest path problem involves a bicycle traveling from an origin to a destination through a network situated on a hilly geography. Determining a path that takes the least amount of pedaling work involves a conservative force, gravity, and a nonconservative force, friction, acting on the bicycle. The cyclist's pedaling work to overcome the friction of each arc varies with the bicycle's kinetic and gravitational potential energies, which transform to one another. Although geometric characteristics of the network are invariable, arc weights representing required pedaling work are variable. This problem is formulated as a quadratic integer program and an approximation procedure is presented.

Place, publisher, year, edition, pages
Wiley-Blackwell, 2008. Vol. 52, no 2, 88-97 p.
Keyword [en]
shortest paths; physical constraints; state-dependent networks; dynamic programming
National Category
Computer Science
URN: urn:nbn:se:kth:diva-66467DOI: 10.1002/net.20225ISI: 000258909900004OAI: diva2:484120

QC 20120126

Available from: 2012-01-26 Created: 2012-01-26 Last updated: 2014-08-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Shirabe, Takeshi
In the same journal
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link