IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v44y1996i2p286-304.html
   My bibliography  Save this item

A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty

Citations

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


Cited by:

  1. Vitalii NAUMOV, 2017. "Forming Delivery Routes While Processing The Stochastic Flow Of Requests For Forwarding Services," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(4), pages 73-82, December.
  2. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
  3. Justin C. Goodson & Jeffrey W. Ohlmann & Barrett W. Thomas, 2013. "Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits," Operations Research, INFORMS, vol. 61(1), pages 138-154, February.
  4. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.
  5. Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn, 2012. "Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 437-458, November.
  6. José Magalhães & Jorge Sousa, 2006. "Dynamic VRP in pharmaceutical distribution—a case study," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(2), pages 177-192, June.
  7. 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.
  8. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
  9. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
  10. Papadakos, Nikolaos & Tzallas-Regas, George & Rustem, Berç & Thoms, Joanne, 2011. "Risky traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 69-73, July.
  11. Jürgen Branke & Martin Middendorf & Guntram Noeth & Maged Dessouky, 2005. "Waiting Strategies for Dynamic Vehicle Routing," Transportation Science, INFORMS, vol. 39(3), pages 298-312, August.
  12. John Gunnar Carlsson & Fan Jia, 2015. "Continuous Facility Location with Backbone Network Costs," Transportation Science, INFORMS, vol. 49(3), pages 433-451, August.
  13. Bertazzi, Luca & Secomandi, Nicola, 2018. "Faster rollout search for the vehicle routing problem with stochastic demands and restocking," European Journal of Operational Research, Elsevier, vol. 270(2), pages 487-497.
  14. Carlsson, John Gunnar & Behroozi, Mehdi, 2017. "Worst-case demand distributions in vehicle routing," European Journal of Operational Research, Elsevier, vol. 256(2), pages 462-472.
  15. Jeroen Corstjens & Nguyen Dang & Benoît Depaire & An Caris & Patrick Causmaecker, 2019. "A combined approach for analysing heuristic algorithms," Journal of Heuristics, Springer, vol. 25(4), pages 591-628, October.
  16. Warren B. Powell & Michael T. Towns & Arun Marar, 2000. "On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance," Transportation Science, INFORMS, vol. 34(1), pages 67-85, February.
  17. Walter Rei & Michel Gendreau & Patrick Soriano, 2010. "A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 44(1), pages 136-146, February.
  18. E. Angelelli & R. Mansini & M. Vindigni, 2016. "The Stochastic and Dynamic Traveling Purchaser Problem," Transportation Science, INFORMS, vol. 50(2), pages 642-658, May.
  19. Pishchulov, Grigory & Richter, Knut, 2009. "Inventory rationing and sharing in pre-sell distribution with mobile communication technologies," International Journal of Production Economics, Elsevier, vol. 121(2), pages 584-600, October.
  20. Chrysanthos E. Gounaris & Wolfram Wiesemann & Christodoulos A. Floudas, 2013. "The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty," Operations Research, INFORMS, vol. 61(3), pages 677-693, June.
  21. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
  22. Li, Jing-Quan & Mirchandani, Pitu B. & Borenstein, Denis, 2009. "Real-time vehicle rerouting problems with time windows," European Journal of Operational Research, Elsevier, vol. 194(3), pages 711-727, May.
  23. Q Mu & Z Fu & J Lysgaard & R Eglese, 2011. "Disruption management of the vehicle routing problem with vehicle breakdown," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 742-749, April.
  24. Aykagan Ak & Alan L. Erera, 2007. "A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 41(2), pages 222-237, May.
  25. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
  26. Anupam Gupta & Viswanath Nagarajan & R. Ravi, 2012. "Technical Note---Approximation Algorithms for VRP with Stochastic Demands," Operations Research, INFORMS, vol. 60(1), pages 123-127, February.
  27. Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
  28. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
  29. Nicola Secomandi, 2001. "A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 49(5), pages 796-802, October.
  30. Cardos, Manuel & Garcia-Sabater, Jose P., 2006. "Designing a consumer products retail chain inventory replenishment policy with the consideration of transportation costs," International Journal of Production Economics, Elsevier, vol. 104(2), pages 525-535, December.
  31. Demir, Emrah & Burgholzer, Wolfgang & Hrušovský, Martin & Arıkan, Emel & Jammernegg, Werner & Woensel, Tom Van, 2016. "A green intermodal service network design problem with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 789-807.
  32. Justin C. Goodson & Barrett W. Thomas & Jeffrey W. Ohlmann, 2016. "Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits," Transportation Science, INFORMS, vol. 50(2), pages 591-607, May.
  33. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
  34. Chiang, Wen-Chyuan & Russell, Robert & Xu, Xiaojing & Zepeda, David, 2009. "A simulation/metaheuristic approach to newspaper production and distribution supply chain problems," International Journal of Production Economics, Elsevier, vol. 121(2), pages 752-767, October.
  35. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
  36. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
  37. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
  38. Chen, Lichun & Miller-Hooks, Elise, 2012. "Optimal team deployment in urban search and rescue," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 984-999.
  39. John Lees-Miller, 2016. "Minimising average passenger waiting time in personal rapid transit systems," Annals of Operations Research, Springer, vol. 236(2), pages 405-424, January.
  40. Martin I. Reiman & Rodrigo Rubio & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem," Transportation Science, INFORMS, vol. 33(4), pages 361-380, November.
  41. Ji, Ying & Du, Jianhui & Han, Xiaoya & Wu, Xiaoqing & Huang, Ripeng & Wang, Shilei & Liu, Zhimin, 2020. "A mixed integer robust programming model for two-echelon inventory routing problem of perishable products," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 548(C).
  42. Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
  43. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
  44. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
  45. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
  46. John Gunnar Carlsson & Mehdi Behroozi & Raghuveer Devulapalli & Xiangfei Meng, 2016. "Household-Level Economies of Scale in Transportation," Operations Research, INFORMS, vol. 64(6), pages 1372-1387, December.
  47. Luca Bertazzi & Nicola Secomandi, 2020. "Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 68(3), pages 671-675, May.
  48. John D. Lees-Miller, 2016. "Minimising average passenger waiting time in personal rapid transit systems," Annals of Operations Research, Springer, vol. 236(2), pages 405-424, January.
  49. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
  50. Wei-Ning Chen, 2009. "Application Of Queuing Theory To Dynamic Vehicle Routing Problem," Global Journal of Business Research, The Institute for Business and Finance Research, vol. 3(2), pages 85-91.
  51. Zhi-Long Chen & Hang Xu, 2006. "Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 40(1), pages 74-88, February.
  52. Axel Parmentier, 2019. "Algorithms for non-linear and stochastic resource constrained shortest path," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(2), pages 281-317, April.
  53. Gilbert Laporte & FranÇois V. Louveaux & Luc van Hamme, 2002. "An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 50(3), pages 415-423, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.