IDEAS home Printed from https://ideas.repec.org/r/inm/ortrsc/v34y2000i2p198-215.html
   My bibliography  Save this item

Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Yang, Xuejing & Low, Joyce M.W. & Tang, Loon Ching, 2011. "Analysis of intermodal freight from China to Indian Ocean: A goal programming approach," Journal of Transport Geography, Elsevier, vol. 19(4), pages 515-527.
  2. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
  3. Jeffrey P. Kharoufeh & Natarajan Gautam, 2004. "Deriving Link Travel-Time Distributions via Stochastic Speed Processes," Transportation Science, INFORMS, vol. 38(1), pages 97-106, February.
  4. Du, Lili & Han, Lanshan & Li, Xiang-Yang, 2014. "Distributed coordinated in-vehicle online routing using mixed-strategy congestion game," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 1-17.
  5. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
  6. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
  7. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
  8. Zhou, Wei & Zhang, Cheng & Wang, Qiangqiang, 2018. "Concealment measurement and flow distribution of military supply transportation: A double-entropy model," European Journal of Operational Research, Elsevier, vol. 264(2), pages 570-581.
  9. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
  10. Wu, Xing, 2015. "Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 275-290.
  11. Wen, Liang & Çatay, Bülent & Eglese, Richard, 2014. "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge," European Journal of Operational Research, Elsevier, vol. 236(3), pages 915-923.
  12. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
  13. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
  14. Ehsan Jafari & Stephen D. Boyles, 2017. "Multicriteria Stochastic Shortest Path Problem for Electric Vehicles," Networks and Spatial Economics, Springer, vol. 17(3), pages 1043-1070, September.
  15. Elise Miller-Hooks & Baiyu Yang, 2005. "Updating Paths in Time-Varying Networks Given Arc Weight Changes," Transportation Science, INFORMS, vol. 39(4), pages 451-464, November.
  16. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
  17. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
  18. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
  19. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
  20. Dongqing Zhang & Zhaoxia Guo, 2019. "On the Necessity and Effects of Considering Correlated Stochastic Speeds in Shortest Path Problems Under Sustainable Environments," Sustainability, MDPI, vol. 12(1), pages 1-14, December.
  21. Xing, Tao & Zhou, Xuesong, 2011. "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1660-1679.
  22. Jeffrey P. Kharoufeh & Natarajan Gautam, 2004. "A fluid queueing model for link travel time moments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(2), pages 242-257, March.
  23. Michael Redmond & Ann Melissa Campbell & Jan Fabian Ehmke, 2020. "Data-driven planning of reliable itineraries in multi-modal transit networks," Public Transport, Springer, vol. 12(1), pages 171-205, March.
  24. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
  25. Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
  26. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
  27. S. Waller & David Fajardo & Melissa Duell & Vinayak Dixit, 2013. "Linear Programming Formulation for Strategic Dynamic Traffic Assignment," Networks and Spatial Economics, Springer, vol. 13(4), pages 427-443, December.
  28. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
  29. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.
  30. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
  31. Yu Nie & Xing Wu & Tito Homem-de-Mello, 2012. "Optimal Path Problems with Second-Order Stochastic Dominance Constraints," Networks and Spatial Economics, Springer, vol. 12(4), pages 561-587, December.
  32. Jiang, Yi & Li, Shuo & Shamo, Daniel E., 2006. "A platoon-based traffic signal timing algorithm for major-minor intersection types," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 543-562, August.
  33. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
  34. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.
  35. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.
  36. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.
  37. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
  38. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
  39. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
  40. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
  41. Dongjoo Park & Laurence Rilett & Byron Gajewski & Clifford Spiegelman & Changho Choi, 2009. "Identifying optimal data aggregation interval sizes for link and corridor travel time estimation and forecasting," Transportation, Springer, vol. 36(1), pages 77-95, January.
  42. Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2014. "Ranking paths in stochastic time-dependent networks," European Journal of Operational Research, Elsevier, vol. 236(3), pages 903-914.
  43. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
  44. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
  45. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
  46. Taesung Hwang & Yanfeng Ouyang, 2015. "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations," Sustainability, MDPI, vol. 7(6), pages 1-16, May.
  47. Levering, Nikki & Boon, Marko & Mandjes, Michel & Núñez-Queija, Rudesindo, 2022. "A framework for efficient dynamic routing under stochastically varying conditions," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 97-124.
  48. Androutsopoulos, Konstantinos N. & Zografos, Konstantinos G., 2009. "Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network," European Journal of Operational Research, Elsevier, vol. 192(1), pages 18-28, January.
  49. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
  50. David Corredor-Montenegro & Nicolás Cabrera & Raha Akhavan-Tabatabaei & Andrés L. Medaglia, 2021. "On the shortest $$\alpha$$ α -reliable path problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 287-318, April.
  51. Antonio Polimeni & Antonino Vitetta, 2013. "Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 805-818, March.
  52. Nielsen, Lars Relund & Pretolani, Daniele & Andersen, Kim Allan, 2004. "K shortest paths in stochastic time-dependent networks," CORAL Working Papers L-2004-05, University of Aarhus, Aarhus School of Business, Department of Business Studies.
  53. Zhang, Dongqing & Wallace, Stein W. & Guo, Zhaoxia & Dong, Yucheng & Kaut, Michal, 2021. "On scenario construction for stochastic shortest path problems in real road networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  54. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
  55. López, David & Lozano, Angélica, 2020. "Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 541-559.
  56. Arthur Flajolet & Sébastien Blandin & Patrick Jaillet, 2018. "Robust Adaptive Routing Under Uncertainty," Operations Research, INFORMS, vol. 66(1), pages 210-229, January.
  57. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.