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

Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows

Citations

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


Cited by:

  1. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
  2. Sun, Peng & Veelenturf, Lucas P. & Dabia, Said & Van Woensel, Tom, 2018. "The time-dependent capacitated profitable tour problem with time windows and precedence constraints," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1058-1073.
  3. Qin, Hu & Su, E. & Wang, Yilun & Li, Jiliu, 2022. "Branch-and-price-and-cut for the electric vehicle relocation problem in one-way carsharing systems," Omega, Elsevier, vol. 109(C).
  4. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
  5. Ozbaygin, Gizem & Ekin Karasan, Oya & Savelsbergh, Martin & Yaman, Hande, 2017. "A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 115-137.
  6. 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.
  7. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
  8. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
  9. Said Dabia & Emrah Demir & Tom Van Woensel, 2017. "An Exact Approach for a Variant of the Pollution-Routing Problem," Transportation Science, INFORMS, vol. 51(2), pages 607-628, May.
  10. Lukas Spengler & Eva Gößwein & Ingmar Kranefeld & Magnus Liebherr & Frédéric Etienne Kracht & Dieter Schramm & Marc Gennat, 2023. "From Modeling to Optimizing Sustainable Public Transport: A New Methodological Approach," Sustainability, MDPI, vol. 15(10), pages 1-17, May.
  11. 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).
  12. Mohammadi, Mostafa & Rahmanifar, Golman & Hajiaghaei-Keshteli, Mostafa & Fusco, Gaetano & Colombaroni, Chiara & Sherafat, Ali, 2023. "A dynamic approach for the multi-compartment vehicle routing problem in waste management," Renewable and Sustainable Energy Reviews, Elsevier, vol. 184(C).
  13. Lera-Romero, Gonzalo & Miranda Bront, Juan José & Soulignac, Francisco J., 2024. "A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 312(3), pages 978-995.
  14. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
  15. Klaus-Dieter Rest & Patrick Hirsch, 2016. "Daily scheduling of home health care services using time-dependent public transport," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 495-525, September.
  16. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
  17. Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
  18. Lera-Romero, Gonzalo & Miranda-Bront, Juan José, 2021. "A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 879-896.
  19. Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2017. "Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost," Transportation Science, INFORMS, vol. 51(2), pages 668-687, May.
  20. Bettinelli, Andrea & Cacchiani, Valentina & Crainic, Teodor Gabriel & Vigo, Daniele, 2019. "A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities," European Journal of Operational Research, Elsevier, vol. 279(3), pages 824-839.
  21. Ulsrud, Karl Petter & Vandvik, Anders Helgeland & Ormevik, Andreas Breivik & Fagerholt, Kjetil & Meisel, Frank, 2022. "A time-dependent vessel routing problem with speed optimization," European Journal of Operational Research, Elsevier, vol. 303(2), pages 891-907.
  22. Thomas R. Visser & Remy Spliet, 2020. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(4), pages 1091-1112, July.
  23. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
  24. Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
  25. Guodong Yu & Yu Yang, 2019. "Dynamic routing with real-time traffic information," Operational Research, Springer, vol. 19(4), pages 1033-1058, December.
  26. Tom Woensel, 2019. "Comments on: Perspectives on integer programming for time-dependent models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 180-183, July.
  27. Aarabi, Fatemeh & Batta, Rajan, 2020. "Scheduling spatially distributed jobs with degradation: Application to pothole repair," Socio-Economic Planning Sciences, Elsevier, vol. 72(C).
  28. Visser, T.R. & Spliet, R., 2017. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Econometric Institute Research Papers EI2017-23, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  29. Verbeeck, C. & Sörensen, K. & Aghezzaf, E.-H. & Vansteenwegen, P., 2014. "A fast solution method for the time-dependent orienteering problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 419-432.
  30. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
  31. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
  32. Jie Zhang & Yifan Zhu & Xiaobo Li & Mengjun Ming & Weiping Wang & Tao Wang, 2022. "Multi-Trip Time-Dependent Vehicle Routing Problem with Split Delivery," Mathematics, MDPI, vol. 10(19), pages 1-24, September.
  33. Hamza Ben Ticha & Nabil Absi & Dominique Feillet & Alain Quilliot & Tom Woensel, 2021. "The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information," SN Operations Research Forum, Springer, vol. 2(1), pages 1-25, March.
  34. Gmira, Maha & Gendreau, Michel & Lodi, Andrea & Potvin, Jean-Yves, 2021. "Tabu search for the time-dependent vehicle routing problem with time windows on a road network," European Journal of Operational Research, Elsevier, vol. 288(1), pages 129-140.
  35. Xia, Yang & Zeng, Wenjia & Zhang, Canrong & Yang, Hai, 2023. "A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 80-110.
  36. Özarık, Sami Serkan & Veelenturf, Lucas P. & Woensel, Tom Van & Laporte, Gilbert, 2021. "Optimizing e-commerce last-mile vehicle routing and scheduling under uncertain customer presence," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).
  37. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
  38. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.
  39. Guo, Feng & Wei, Qu & Wang, Miao & Guo, Zhaoxia & Wallace, Stein W., 2023. "Deep attention models with dimension-reduction and gate mechanisms for solving practical time-dependent vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
  40. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
  41. Ines Mathlouthi & Michel Gendreau & Jean-Yves Potvin, 2021. "Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem," SN Operations Research Forum, Springer, vol. 2(1), pages 1-35, March.
  42. Remy Spliet & Said Dabia & Tom Van Woensel, 2018. "The Time Window Assignment Vehicle Routing Problem with Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 52(2), pages 261-276, March.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.