Time-varying shortest path problems with constraints

@article{Cai1997TimevaryingSP,
  title={Time-varying shortest path problems with constraints},
  author={X. Cai and Ton Kloks and Chak-Kuen Wong},
  journal={Networks},
  year={1997},
  volume={29},
  pages={141-150}
}
The shortest path problem is considered with yet another extension. The transit times b(x,y,u) and the arc costs c(x,y,u) on arc (x,y) vary as a function of the departure time u at the beginning vertex of the arc. The problem considered is to find the shortest path between a pair of nodes such that the total traverse time is lesser than some specified value T. Waiting times at nodes are considered as decision variables in this paper as well. Three variations of the problem are analyzed in which… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

A Multiobjective Path-Planning Algorithm With Time Windows for Asset Routing in a Dynamic Weather-Impacted Environment

IEEE Transactions on Systems, Man, and Cybernetics: Systems • 2017
View 4 Excerpts
Highly Influenced

Optimal Pricing to Manage Electric Vehicles in Coupled Power and Transportation Networks

IEEE Transactions on Control of Network Systems • 2017
View 1 Excerpt

81 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…