论文信息 - SOLVING A BEST PATH PROBLEM WHEN THE VALUE OF TIME FUNCTION IS NONLINEAR

SOLVING A BEST PATH PROBLEM WHEN THE VALUE OF TIME FUNCTION IS NONLINEAR

A great deal of attention has been devoted to the shortest path problem in a variety of disciplines. In many transportation applications, many drivers place almost no value on saving small amounts of time. This paper demonstrates that the inherited constraint algorithm can solve the minimum cost path problem when path costs include both time and tolls and the value of travel time is nonlinear.

D Bernstein | D. Bernstein | K Scott | K. Scott

[1] David Bernstein,et al. FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[2] Gabriel Y. Handler,et al. A dual algorithm for the constrained shortest path problem , 1980, Networks.

[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4] Robert B. Dial,et al. Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[5] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[6] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[7] R. Bellman. Dynamic programming. , 1957, Science.

[8] Nicos Christofides,et al. An algorithm for the resource constrained shortest path problem , 1989, Networks.

[9] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[10] Godwin C. Ovuworie,et al. Mathematical Programming: Structures and Algorithms , 1979 .