IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v11y2011i2p233-254.html
   My bibliography  Save this article

Optimal Information Location for Adaptive Routing

Author

Listed:
  • Stephen Boyles
  • S. Waller

Abstract

No abstract is available for this item.

Suggested Citation

  • Stephen Boyles & S. Waller, 2011. "Optimal Information Location for Adaptive Routing," Networks and Spatial Economics, Springer, vol. 11(2), pages 233-254, June.
  • Handle: RePEc:kap:netspa:v:11:y:2011:i:2:p:233-254
    DOI: 10.1007/s11067-009-9108-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-009-9108-9
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11067-009-9108-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pretolani, Daniele, 2000. "A directed hypergraph model for random time dependent shortest paths," European Journal of Operational Research, Elsevier, vol. 123(2), pages 315-324, June.
    2. Avinash Unnikrishnan & Steven Waller, 2009. "User Equilibrium with Recourse," Networks and Spatial Economics, Springer, vol. 9(4), pages 575-593, December.
    3. 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.
    4. Harilaos N. Psaraftis & John N. Tsitsiklis, 1993. "Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs," Operations Research, INFORMS, vol. 41(1), pages 91-101, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Pramesh Kumar & Alireza Khani, 2021. "Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network," Networks and Spatial Economics, Springer, vol. 21(4), pages 771-800, December.
    2. Amir Khakbaz & Ali Nookabadi & S. Shetab-bushehri, 2013. "A Model for Locating Park-and-Ride Facilities on Urban Networks Based on Maximizing Flow Capture: A Case Study of Isfahan, Iran," Networks and Spatial Economics, Springer, vol. 13(1), pages 43-66, March.
    3. 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.
    4. 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.
    5. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    6. Xinming Zang & Zhenqi Guo & Jingai Ma & Yongguang Zhong & Xiangfeng Ji, 2021. "Target-Oriented User Equilibrium Considering Travel Time, Late Arrival Penalty, and Travel Cost on the Stochastic Tolled Traffic Network," Sustainability, MDPI, vol. 13(17), pages 1-22, September.
    7. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. Pramesh Kumar & Alireza Khani, 2021. "Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network," Networks and Spatial Economics, Springer, vol. 21(4), pages 771-800, December.
    4. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
    5. Kasun P Wijayaratna & Vinayak V Dixit & Laurent Denant-Boemont & S Travis Waller, 2017. "An experimental study of the Online Information Paradox: Does en-route information improve road network performance?," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-17, September.
    6. 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.
    7. 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.
    8. 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.
    9. Kucharski, Rafał & Gentile, Guido, 2019. "Simulation of rerouting phenomena in Dynamic Traffic Assignment with the Information Comply Model," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 414-441.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Madhushini Narayana Prasad & Nedialko Dimitrov & Evdokia Nikolova, 2023. "Non-Aggressive Adaptive Routing in Traffic," Mathematics, MDPI, vol. 11(17), pages 1-25, August.
    16. Liu, Zeyu & Li, Xueping & Khojandi, Anahita, 2022. "The flying sidekick traveling salesman problem with stochastic travel time: A reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    17. 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.
    18. D'Acierno, Luca & Cartenì, Armando & Montella, Bruno, 2009. "Estimation of urban traffic conditions using an Automatic Vehicle Location (AVL) System," European Journal of Operational Research, Elsevier, vol. 196(2), pages 719-736, July.
    19. Pretolani, Daniele & Nielsen, Lars Relund & Andersen, Kim Allan & Ehrgott, Matthias, 2008. "Time-adaptive versus history-adaptive strategies for multicriterion routing in stochastic time-dependent networks," CORAL Working Papers L-2008-05, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    20. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:11:y:2011:i:2:p:233-254. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.