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

A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem

Citations

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


Cited by:

  1. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  2. Tanaka, Shunji & Uraguchi, Yukihiro & Araki, Mituhiko, 2005. "Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm," European Journal of Operational Research, Elsevier, vol. 167(2), pages 574-587, December.
  3. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
  4. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
  5. Gerardo Berbeglia & Jean-François Cordeau & Gilbert Laporte, 2012. "A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 343-355, August.
  6. Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
  7. Tanaka, Shunji & Uraguchi, Yukihiro & Araki, Mituhiko, 2005. "Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part I. Formulation and simulations," European Journal of Operational Research, Elsevier, vol. 167(2), pages 550-573, December.
  8. Ozbaygin, Gizem & Savelsbergh, Martin, 2019. "An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 207-235.
  9. Bouman, P.C. & Agatz, N.A.H. & Schmidt, M.E., 2017. "Dynamic Programming Approaches for the Traveling Salesman Problem with Drone," ERIM Report Series Research in Management ERS-2017-011-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  10. Belma Turan & Tina Wakolbinger, 2023. "The Electric Scooter Collection Problem: A Case Study in the City of Vienna," Sustainability, MDPI, vol. 15(13), pages 1-20, June.
  11. Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
  12. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
  13. Vismara, Luca & Chew, Lock Yue & Saw, Vee-Liem, 2021. "Optimal assignment of buses to bus stops in a loop by reinforcement learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 583(C).
  14. Hanif D. Sherali & Patrick J. Driscoll, 2002. "On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems," Operations Research, INFORMS, vol. 50(4), pages 656-669, August.
  15. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
  16. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
  17. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
  18. Chen, Peng Will & Nie, Yu Marco, 2017. "Analysis of an idealized system of demand adaptive paired-line hybrid transit," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 38-54.
  19. Yang, Senyan & Ning, Lianju & Shang, Pan & (Carol) Tong, Lu, 2020. "Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 135(C).
  20. van Lon, Rinde R.S. & Ferrante, Eliseo & Turgut, Ali E. & Wenseleers, Tom & Vanden Berghe, Greet & Holvoet, Tom, 2016. "Measures of dynamism and urgency in logistics," European Journal of Operational Research, Elsevier, vol. 253(3), pages 614-624.
  21. Abdelkader Sbihi & Richard W. Eglese, 2007. "The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey," Working Papers hal-00644133, HAL.
  22. Chandra, Shailesh & Quadrifoglio, Luca, 2013. "A model for estimating the optimal cycle length of demand responsive feeder transit services," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 1-16.
  23. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
  24. Hyland, Michael & Mahmassani, Hani S., 2020. "Operational benefits and challenges of shared-ride automated mobility-on-demand services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 251-270.
  25. Quan Lu & Maged Dessouky, 2004. "An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 503-514, November.
  26. Nanry, William P. & Wesley Barnes, J., 2000. "Solving the pickup and delivery problem with time windows using reactive tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 34(2), pages 107-121, February.
  27. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
  28. 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.
  29. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
  30. Bruni, M.E. & Guerriero, F. & Beraldi, P., 2014. "Designing robust routes for demand-responsive transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 1-16.
  31. 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.
  32. Shen, Chan & Sun, Yao & Bai, Zijian & Cui, Hongjun, 2021. "Real-time customized bus routes design with optimal passenger and vehicle matching based on column generation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
  33. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
  34. Kergosien, Y. & Lenté, Ch. & Piton, D. & Billaut, J.-C., 2011. "A tabu search heuristic for the dynamic transportation of patients between care units," European Journal of Operational Research, Elsevier, vol. 214(2), pages 442-452, October.
  35. 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.
  36. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
  37. Matusiak, Marek & de Koster, René & Kroon, Leo & Saarinen, Jari, 2014. "A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse," European Journal of Operational Research, Elsevier, vol. 236(3), pages 968-977.
  38. Michel Gendreau & Alain Hertz & Gilbert Laporte & Mihnea Stan, 1998. "A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows," Operations Research, INFORMS, vol. 46(3), pages 330-335, June.
  39. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
  40. Xue, Li & Luo, Zhixing & Lim, Andrew, 2016. "Exact approaches for the pickup and delivery problem with loading cost," Omega, Elsevier, vol. 59(PB), pages 131-145.
  41. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
  42. 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.
  43. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
  44. 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.
  45. Wang, Jun & Wang, Xiaolei & Yang, Shan & Yang, Hai & Zhang, Xiaoning & Gao, Ziyou, 2021. "Predicting the matching probability and the expected ride/shared distance for each dynamic ridepooling order: A mathematical modeling approach," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 125-146.
  46. Diego Muñoz-Carpintero & Doris Sáez & Cristián E. Cortés & Alfredo Núñez, 2015. "A Methodology Based on Evolutionary Algorithms to Solve a Dynamic Pickup and Delivery Problem Under a Hybrid Predictive Control Approach," Transportation Science, INFORMS, vol. 49(2), pages 239-253, May.
  47. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
  48. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
  49. Velaga, Nagendra R. & Beecroft, Mark & Nelson, John D. & Corsar, David & Edwards, Peter, 2012. "Transport poverty meets the digital divide: accessibility and connectivity in rural communities," Journal of Transport Geography, Elsevier, vol. 21(C), pages 102-112.
  50. Zhixing Luo & Mengyang Liu & Andrew Lim, 2019. "A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation," Service Science, INFORMS, vol. 53(1), pages 113-130, February.
  51. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
  52. Gitae Kim, 2023. "Dynamic Vehicle Routing Problem with Fuzzy Customer Response," Sustainability, MDPI, vol. 15(5), pages 1-13, March.
  53. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
  54. Lauri Häme & Harri Hakula, 2015. "A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances," Transportation Science, INFORMS, vol. 49(2), pages 295-310, May.
  55. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1605-1615, December.
  56. Rui Yao & Shlomo Bekhor, 2021. "A Dynamic Tree Algorithm for Peer-to-Peer Ridesharing Matching," Networks and Spatial Economics, Springer, vol. 21(4), pages 801-837, December.
  57. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
  58. Luo, Ying & Schonfeld, Paul, 2007. "A rejected-reinsertion heuristic for the static Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(7), pages 736-755, August.
  59. Dai, Rongjian & Ding, Chuan & Gao, Jian & Wu, Xinkai & Yu, Bin, 2022. "Optimization and evaluation for autonomous taxi ride-sharing schedule and depot location from the perspective of energy consumption," Applied Energy, Elsevier, vol. 308(C).
  60. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2008. "The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments," European Journal of Operational Research, Elsevier, vol. 185(2), pages 534-551, March.
  61. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
  62. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
  63. Kai Gutenschwager & Christian Niklaus & Stefan Voß, 2004. "Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 434-446, November.
  64. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  65. Farzaneh Karami & Wim Vancroonenburg & Greet Vanden Berghe, 2020. "A periodic optimization approach to dynamic pickup and delivery problems with time windows," Journal of Scheduling, Springer, vol. 23(6), pages 711-731, December.
  66. Zheng Zhang & Bin Ji & Samson S. Yu, 2023. "An Adaptive Tabu Search Algorithm for Solving the Two-Dimensional Loading Constrained Vehicle Routing Problem with Stochastic Customers," Sustainability, MDPI, vol. 15(2), pages 1-23, January.
  67. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
  68. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
  69. 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.
  70. Omar Rifki, 2024. "Autonomous Ride-Sharing Service Using Graph Embedding and Dial-a-Ride Problem: Application to the Last-Mile Transit in Lyon City," Mathematics, MDPI, vol. 12(4), pages 1-17, February.
  71. 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).
  72. Roberto Baldacci & Vittorio Maniezzo & Aristide Mingozzi, 2004. "An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation," Operations Research, INFORMS, vol. 52(3), pages 422-439, June.
  73. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
  74. 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.
  75. Li, Baoxiang & Krushinsky, Dmitry & Reijers, Hajo A. & Van Woensel, Tom, 2014. "The Share-a-Ride Problem: People and parcels sharing taxis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 31-40.
  76. Yu, Yao & Machemehl, Randy B. & Xie, Chi, 2015. "Demand-responsive transit circulator service network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 160-175.
  77. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
  78. Dessouky, Maged M. & Aldaihani, Majid & Shah, Rutvij, 2002. "Evaluating the Impact of ITS on Personalized Public Transit," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt7fb4h2dg, Institute of Transportation Studies, UC Berkeley.
  79. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
  80. 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.
  81. 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.
  82. Tu, Meiting & Li, Ye & Li, Wenxiang & Tu, Minchao & Orfila, Olivier & Gruyer, Dominique, 2019. "Improving ridesplitting services using optimization procedures on a shareability network: A case study of Chengdu," Technological Forecasting and Social Change, Elsevier, vol. 149(C).
  83. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
  84. 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).
  85. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
  86. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
  87. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
  88. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.