A*-guided heuristic for a multi-objective bus passenger Trip Planning Problem
Author
Abstract
Suggested Citation
DOI: 10.1007/s12469-019-00204-1
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
- Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
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.- Kai Lu & Tao Tang & Chunhai Gao, 2020. "The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network," Sustainability, MDPI, vol. 12(13), pages 1-16, July.
- Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
- Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
- Ding Luo & Oded Cats & Hans Lint, 2020. "Can passenger flow distribution be estimated solely based on network properties in public transport systems?," Transportation, Springer, vol. 47(6), pages 2757-2776, December.
- E. Codina & A. Marín & F. López, 2013. "A model for setting services on auxiliary bus lines under congestion," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 48-83, April.
- Preston, John, 2008. "Competition in transit markets," Research in Transportation Economics, Elsevier, vol. 23(1), pages 75-84, January.
- Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
- Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
- Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
- Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
- 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.
- Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
- Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
- Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
- Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
- Taiba Zahid & Fouzia Gillani & Usman Ghafoor & Muhammad Raheel Bhutta, 2022. "Synchromodal Transportation Analysis of the One-Belt-One-Road Initiative Based on a Bi-Objective Mathematical Model," Sustainability, MDPI, vol. 14(6), pages 1-14, March.
- David Canca & Belén Navarro-Carmona & Gabriel Villa & Alejandro Zarzo, 2023. "A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem," Mathematics, MDPI, vol. 11(19), pages 1-36, October.
- Amirali Zarrinmehr & Mahmoud Saffarzadeh & Seyedehsan Seyedabrishami & Yu Marco Nie, 2016. "A path-based greedy algorithm for multi-objective transit routes design with elastic demand," Public Transport, Springer, vol. 8(2), pages 261-293, September.
- Wang, David Z.W. & Nayan, Ashish & Szeto, W.Y., 2018. "Optimal bus service design with limited stop services in a travel corridor," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 70-86.
- Batarce, Marco, 2016. "Estimation of urban bus transit marginal cost without cost data," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 241-262.
More about this item
Keywords
Trip Planning Problem; Pareto dominance; A* algorithm;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:pubtra:v:13:y:2021:i:3:d:10.1007_s12469-019-00204-1. 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.