IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v106y1998i2-3p546-557.html
   My bibliography  Save this item

Separating capacity constraints in the CVRP using tabu search

Citations

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


Cited by:

  1. Gianpaolo Ghiani & Gilbert Laporte & Frédéric Semet, 2006. "The Black and White Traveling Salesman Problem," Operations Research, INFORMS, vol. 54(2), pages 366-378, April.
  2. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
  3. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
  4. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
  5. 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.
  6. Briseida Sarasola & Karl F. Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
  7. Bektaş, Tolga & Gouveia, Luis & Martínez-Sykora, Antonio & Salazar-González, Juan-José, 2019. "Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 273(2), pages 452-463.
  8. Malaguti, Enrico & Martello, Silvano & Santini, Alberto, 2018. "The traveling salesman problem with pickups, deliveries, and draft limits," Omega, Elsevier, vol. 74(C), pages 50-58.
  9. Nur Azriati Mat* & Aida Mauziah Benjamin & Syariza Abdul-Rahman, 2018. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 695-700:6.
  10. Çetinkaya, Cihan & Karaoglan, Ismail & Gökçen, Hadi, 2013. "Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach," European Journal of Operational Research, Elsevier, vol. 230(3), pages 539-550.
  11. Liu, Tian & Luo, Zhixing & Qin, Hu & Lim, Andrew, 2018. "A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints," European Journal of Operational Research, Elsevier, vol. 266(2), pages 487-497.
  12. José Manuel Belenguer & Enrique Benavent & Antonio Martínez & Christian Prins & Caroline Prodhon & Juan G. Villegas, 2016. "A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots," Transportation Science, INFORMS, vol. 50(2), pages 735-749, May.
  13. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
  14. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
  15. Hoogendoorn, Y.N. & Dalmeijer, K., 2021. "Resource-robust valid inequalities for set covering and set partitioning models," Econometric Institute Research Papers EI 2020-08, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  16. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
  17. David Applegate & William Cook & Sanjeeb Dash & André Rohe, 2002. "Solution of a Min-Max Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 132-143, May.
  18. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
  19. Lecluyse, Christophe & Sörensen, Kenneth & Peremans, Herbert, 2013. "A network-consistent time-dependent travel time layer for routing optimization problems," European Journal of Operational Research, Elsevier, vol. 226(3), pages 395-413.
  20. Roberto Baldacci & Paolo Toth & Daniele Vigo, 2010. "Exact algorithms for routing problems under vehicle capacity constraints," Annals of Operations Research, Springer, vol. 175(1), pages 213-245, March.
  21. Luo, Zhixing & Qin, Hu & Che, ChanHou & Lim, Andrew, 2015. "On service consistency in multi-period vehicle routing," European Journal of Operational Research, Elsevier, vol. 243(3), pages 731-744.
  22. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
  23. 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.
  24. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Chris T., 2015. "The load-dependent vehicle routing problem and its pick-up and delivery extension," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 158-181.
  25. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
  26. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  27. 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.
  28. Gerhard Reinelt & Klaus M. Wenger, 2006. "Maximally Violated Mod- p Cuts for the Capacitated Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 466-479, November.
  29. Andie Pramudita & Eiichi Taniguchi, 2014. "Model of debris collection operation after disasters and its application in urban area," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 18(2), pages 218-243, July.
  30. Anastasios D. Vareias & Panagiotis P. Repoussis & Panagiotis P. Repoussi, 2019. "Assessing Customer Service Reliability in Route Planning with Self-Imposed Time Windows and Stochastic Travel Times," Service Science, INFORMS, vol. 53(1), pages 256-281, February.
  31. Tahami, Hesamoddin & Rabadi, Ghaith & Haouari, Mohamed, 2020. "Exact approaches for routing capacitated electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
  32. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.