Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2019.0923
Download full text from publisher
References listed on IDEAS
- Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
- Ilgaz Sungur & Yingtao Ren & Fernando Ordóñez & Maged Dessouky & Hongsheng Zhong, 2010. "A Model and Algorithm for the Courier Delivery Problem with Uncertainty," Transportation Science, INFORMS, vol. 44(2), pages 193-205, May.
- 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.
- Irnich, S. & Schneider, M. & Vigo, D., 2014. "Four Variants of the Vehicle Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 63514, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
- Pessoa, Artur & Sadykov, Ruslan & Uchoa, Eduardo, 2018. "Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 270(2), pages 530-543.
- Chrysanthos E. Gounaris & Panagiotis P. Repoussis & Christos D. Tarantilis & Wolfram Wiesemann & Christodoulos A. Floudas, 2016. "An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(4), pages 1239-1260, November.
- Sebastián Ceria & Robert A Stubbs, 2006. "Incorporating estimation errors into portfolio selection: Robust portfolio construction," Journal of Asset Management, Palgrave Macmillan, vol. 7(2), pages 109-127, July.
- Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2010. "The Vehicle Routing Problem with Stochastic Demand and Duration Constraints," Transportation Science, INFORMS, vol. 44(4), pages 474-492, November.
- Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Xinyun Wu & Zhipeng Lü & Fred Glover, 2022. "A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 817-833, March.
- Zhang, Yanzi & Diabat, Ali & Zhang, Zhi-Hai, 2021. "Reliable closed-loop supply chain design problem under facility-type-dependent probabilistic disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 180-209.
- Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
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.- Anirudh Subramanyam & Frank Mufalli & José M. Lí?nez-Aguirre & Jose M. Pinto & Chrysanthos E. Gounaris, 2021. "Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty," Operations Research, INFORMS, vol. 69(1), pages 30-60, January.
- 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.
- Lu, Da & Gzara, Fatma, 2019. "The robust vehicle routing problem with time windows: Solution by branch and price and cut," European Journal of Operational Research, Elsevier, vol. 275(3), pages 925-938.
- Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
- Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
- Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
- Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
- Chen, Lu & Gendreau, Michel & Hà, Minh Hoàng & Langevin, André, 2016. "A robust optimization approach for the road network daily maintenance routing problem with uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 40-51.
- Yossiri Adulyasak & Patrick Jaillet, 2016. "Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines," Transportation Science, INFORMS, vol. 50(2), pages 608-626, May.
- Artur Alves Pessoa & Michael Poss & Ruslan Sadykov & François Vanderbeck, 2021. "Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty," Operations Research, INFORMS, vol. 69(3), pages 739-754, May.
- Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
- Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
- Jinil Han & Chungmok Lee & Sungsoo Park, 2014. "A Robust Scenario Approach for the Vehicle Routing Problem with Uncertain Travel Times," Transportation Science, INFORMS, vol. 48(3), pages 373-390, August.
- Paola Cappanera & Maria Grazia Scutellà, 2022. "Addressing consistency and demand uncertainty in the Home Care planning problem," Flexible Services and Manufacturing Journal, Springer, vol. 34(1), pages 1-39, March.
- Gülpinar, Nalan & Pachamanova, Dessislava, 2013. "A robust optimization approach to asset-liability management under time-varying investment opportunities," Journal of Banking & Finance, Elsevier, vol. 37(6), pages 2031-2041.
- Yu, Yang & Wang, Sihan & Wang, Junwei & Huang, Min, 2019. "A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 511-527.
- Ashlea Bennett Milburn & Emre Kirac & Mina Hadianniasar, 2017. "Case Article—Growing Pains: A Case Study for Large-Scale Vehicle Routing," INFORMS Transactions on Education, INFORMS, vol. 17(2), pages 75-80, January.
- Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
- Andrew Butler & Roy H. Kwon, 2021. "Data-driven integration of norm-penalized mean-variance portfolios," Papers 2112.07016, arXiv.org, revised Nov 2022.
- Liang Sun, 2022. "Modeling and evolutionary algorithm for solving a multi-depot mixed vehicle routing problem with uncertain travel times," Journal of Heuristics, Springer, vol. 28(5), pages 619-651, December.
More about this item
Keywords
robust optimization; vehicle routing; demand uncertainty; local search; metaheuristics; branch-and-cut;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:inm:orijoc:v:32:y:3:i:2020:p:661-681. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.