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

Combining multicriteria analysis and tabu search for dial-a-ride problems

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. Schilde, M. & Doerner, K.F. & Hartl, R.F., 2014. "Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 18-30.
  3. Shafahi, Ali & Wang, Zhongxiang & Haghani, Ali, 2018. "SpeedRoute: Fast, efficient solutions for school bus routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 473-493.
  4. 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.
  5. Haiyan Yu & Xianwei Luo & Tengyu Wu, 0. "Online pickup and delivery problem with constrained capacity to minimize latency," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
  6. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
  7. Ge, Qian & Han, Ke & Liu, Xiaobo, 2021. "Matching and routing for shared autonomous vehicles in congestible network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
  8. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
  9. Demir, Emrah & Bektaş, Tolga & Laporte, Gilbert, 2014. "The bi-objective Pollution-Routing Problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 464-478.
  10. Naoum-Sawaya, Joe & Cogill, Randy & Ghaddar, Bissan & Sajja, Shravan & Shorten, Robert & Taheri, Nicole & Tommasi, Pierpaolo & Verago, Rudi & Wirth, Fabian, 2015. "Stochastic optimization approach for the car placement problem in ridesharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 173-184.
  11. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
  12. 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.
  13. Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.
  14. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
  15. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.
  16. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
  17. Can Huang & Defu Zhang & Yain-Whar Si & Stephen C. H. Leung, 2016. "Tabu search for the real-world carpooling problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 492-512, August.
  18. Haiyan Yu & Xianwei Luo & Tengyu Wu, 2022. "Online pickup and delivery problem with constrained capacity to minimize latency," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 974-993, July.
  19. Michelle Dunbar & Simon Belieres & Nagesh Shukla & Mehrdad Amirghasemi & Pascal Perez & Nishikant Mishra, 2020. "A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney DropPoint network," Annals of Operations Research, Springer, vol. 290(1), pages 923-941, July.
  20. Tafreshian, Amirmahdi & Abdolmaleki, Mojtaba & Masoud, Neda & Wang, Huizhu, 2021. "Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 227-259.
  21. 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.
  22. Sonia Nasri & Hend Bouziri & Wassila Aggoune-Mtalaa, 2022. "An Evolutionary Descent Algorithm for Customer-Oriented Mobility-On-Demand Problems," Sustainability, MDPI, vol. 14(5), pages 1-18, March.
  23. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
  24. Bai, Ruibin & Xue, Ning & Chen, Jianjun & Roberts, Gethin Wyn, 2015. "A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 79(C), pages 134-148.
  25. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
  26. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
  27. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
  28. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
  29. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
  30. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
  31. 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.
  32. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
  33. Chen, Chialin & Achtari, Guyves & Majkut, Kevin & Sheu, Jiuh-Biing, 2017. "Balancing equity and cost in rural transportation management with multi-objective utility analysis and data envelopment analysis: A case of Quinte West," Transportation Research Part A: Policy and Practice, Elsevier, vol. 95(C), pages 148-165.
  34. Kirchler, Dominik & Wolfler Calvo, Roberto, 2013. "A Granular Tabu Search algorithm for the Dial-a-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 120-135.
  35. 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.
  36. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
  37. G. Dikas & I. Minis, 2018. "Scheduled Paratransit Transport Enhanced by Accessible Taxis," Transportation Science, INFORMS, vol. 52(5), pages 1122-1140, October.
  38. 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.
  39. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.