To find the shortest path in a network is often a problem in transportation applications. This paper considers a shortest path problem in which the costs are a particular nonlinear, nonseparable function. An algorithm of feasible-directions variety in which subproblems are simple minimum cost flow linear programs is presented. To ensure that a path which produces a lower function value is found, the algorithm contains a heuristic component.
The California Department of Transportation set a goal of doubling walking and transit use and tripling bicycling in the state between 2010 and 2020. ...
Many cities are focused on increasing bicycle use through development of infrastructure such as bicycle lanes and multi-use paths. Traditionally, trav...
Links with this icon indicate that you are leaving a Bureau of Transportation
Statistics (BTS)/National Transportation Library (NTL)
Web-based service.
Thank you for visiting.
You are about to access a non-government link outside of
the U.S. Department of Transportation's National
Transportation Library.
Please note: While links to Web sites outside of DOT are
offered for your convenience, when you exit DOT Web sites,
Federal privacy policy and Section 508 of the Rehabilitation
Act (accessibility requirements) no longer apply. In
addition, DOT does not attest to the accuracy, relevance,
timeliness or completeness of information provided by linked
sites. Linking to a Web site does not constitute an
endorsement by DOT of the sponsors of the site or the
products presented on the site. For more information, please
view DOT's Web site linking policy.
To get back to the page you were previously viewing, click
your Cancel button.