IDEAS home Printed from https://ideas.repec.org/r/eee/transb/v81y2015ip1p267-288.html
   My bibliography  Save this item

A branch-and-cut algorithm for a realistic dial-a-ride problem

Citations

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


Cited by:

  1. Braekers, Kris & Kovacs, Attila A., 2016. "A multi-period dial-a-ride problem with driver consistency," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 355-377.
  2. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
  3. Zhang, Li & Liu, Zhongshan & Yu, Bin & Long, Jiancheng, 2024. "A ridesharing routing problem for airport riders with electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
  4. Baïou, Mourad & Colares, Rafael & Kerivin, Hervé, 2023. "Complexity, algorithmic, and computational aspects of a dial-a-ride type problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 552-565.
  5. Li, Chongshou & Gong, Lijun & Luo, Zhixing & Lim, Andrew, 2019. "A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing," Omega, Elsevier, vol. 89(C), pages 71-91.
  6. Farshad Majzoubi & Lihui Bai & Sunderesh S. Heragu, 2021. "The EMS vehicle patient transportation problem during a demand surge," Journal of Global Optimization, Springer, vol. 79(4), pages 989-1006, April.
  7. Ahamed, Tanvir & Zou, Bo & Farazi, Nahid Parvez & Tulabandhula, Theja, 2021. "Deep Reinforcement Learning for Crowdsourced Urban Delivery," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 227-257.
  8. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
  9. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
  10. Johnsen, Lennart C. & Meisel, Frank, 2022. "Interrelated trips in the rural dial-a-ride problem with autonomous vehicles," European Journal of Operational Research, Elsevier, vol. 303(1), pages 201-219.
  11. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
  12. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
  13. Ning Wang & Yelin Lyu & Shengling Jia & Chaojun Zheng & Zhiquan Meng & Jingyun Chen, 2024. "A dynamic graph-based many-to-one ride-matching approach for shared autonomous electric vehicles," Transportation, Springer, vol. 51(5), pages 1879-1905, October.
  14. Huang, Nan & Qin, Hu & Du, Yuquan & Wang, Li, 2024. "An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower," European Journal of Operational Research, Elsevier, vol. 319(1), pages 31-49.
  15. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
  16. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
  17. Mohamed Amine Masmoudi & Manar Hosny & Emrah Demir & Erwin Pesch, 2020. "Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem," Journal of Heuristics, Springer, vol. 26(1), pages 83-118, February.
  18. Wu, Weitiao & Liu, Ronghui & Jin, Wenzhou, 2016. "Designing robust schedule coordination scheme for transit networks with safety control margins," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 495-519.
  19. Tamke, Felix & Buscher, Udo, 2021. "A branch-and-cut algorithm for the vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 174-203.
  20. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
  21. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Koh, Jimmy, 2024. "Dynamic tugboat deployment and scheduling with stochastic and time-varying service demands," Transportation Research Part B: Methodological, Elsevier, vol. 188(C).
  22. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
  23. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
  24. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.
  25. Zhang, Bojian & Zhao, Jun & D’Ariano, Andrea & Zhang, Yongxiang & Feng, Tao & Peng, Qiyuan, 2024. "An iterative method for integrated hump sequencing, train makeup, and classification track assignment in railway shunting yard," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
  26. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
  27. Shang, Huayan & Chang, Yi & Huang, Haijun & Zhao, Fangxia, 2022. "Integration of conventional and customized bus services: An empirical study in Beijing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.