IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v211y2011i3p427-441.html
   My bibliography  Save this item

Traveling salesman problem heuristics: Leading methods, implementations and latest advances

Citations

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


Cited by:

  1. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "An effective two phase heuristic for synchronized seru production scheduling and 3PL transportation problems," International Journal of Production Economics, Elsevier, vol. 268(C).
  2. Luca Cicala & Francesco Gargiulo & Sara Parrilli & Donato Amitrano & Gianpaolo Pigliasco, 2024. "Progressive Monitoring of Micro-Dumps Using Remote Sensing: An Applicative Framework for Illegal Waste Management," Sustainability, MDPI, vol. 16(13), pages 1-24, July.
  3. Thomas Weise & Yuezhong Wu & Raymond Chiong & Ke Tang & Jörg Lässig, 2016. "Global versus local search: the impact of population sizes on evolutionary algorithm performance," Journal of Global Optimization, Springer, vol. 66(3), pages 511-534, November.
  4. Xu, Liang & Xu, Zhou & Xu, Dongsheng, 2013. "Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree," European Journal of Operational Research, Elsevier, vol. 227(2), pages 284-292.
  5. Sleegers, Joeri & Olij, Richard & van Horn, Gijs & van den Berg, Daan, 2020. "Where the really hard problems aren’t," Operations Research Perspectives, Elsevier, vol. 7(C).
  6. Dongyun Wang & Qiwei Yu & Yu Zhang, 2015. "Research on Laser Marking Speed Optimization by Using Genetic Algorithm," PLOS ONE, Public Library of Science, vol. 10(5), pages 1-10, May.
  7. Heber F. Amaral & Sebastián Urrutia & Lars M. Hvattum, 2021. "Delayed improvement local search," Journal of Heuristics, Springer, vol. 27(5), pages 923-950, October.
  8. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
  9. Taillard, Éric D., 2022. "A linearithmic heuristic for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 442-450.
  10. Bock, Stefan & Bomsdorf, Stefan & Boysen, Nils & Schneider, Michael, 2025. "A survey on the Traveling Salesman Problem and its variants in a warehousing context," European Journal of Operational Research, Elsevier, vol. 322(1), pages 1-14.
  11. Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
  12. Shengbin Wang & Weizhen Rao & Yuan Hong, 2020. "A distance matrix based algorithm for solving the traveling salesman problem," Operational Research, Springer, vol. 20(3), pages 1505-1542, September.
  13. Jana, R.K. & Mitra, Subrata K. & Sharma, Dinesh K., 2018. "Software vendors travel management decisions using an elitist nonhomogeneous genetic algorithm," International Journal of Production Economics, Elsevier, vol. 202(C), pages 123-131.
  14. 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.
  15. Scholz, André & Henn, Sebastian & Stuhlmann, Meike & Wäscher, Gerhard, 2016. "A new mathematical programming formulation for the Single-Picker Routing Problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 68-84.
  16. Pawel Sitek & Jarosław Wikarek, 2019. "Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach," Annals of Operations Research, Springer, vol. 273(1), pages 257-277, February.
  17. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
  18. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
  19. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
  20. Aliyev, Denis A. & Zirbel, Craig L., 2023. "Seriation using tree-penalized path length," European Journal of Operational Research, Elsevier, vol. 305(2), pages 617-629.
  21. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
  22. Lancia, Giuseppe & Vidoni, Paolo, 2020. "Finding the largest triangle in a graph in expected quadratic time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 458-467.
  23. Kalliopi Kastampolidou & Christos Papalitsas & Theodore Andronikos, 2022. "The Distributed Kolkata Paise Restaurant Game," Games, MDPI, vol. 13(3), pages 1-21, April.
  24. Kalliopi Kastampolidou & Christos Papalitsas & Theodore Andronikos, 2021. "DKPRG or how to succeed in the Kolkata Paise Restaurant gamevia TSP," Papers 2101.07760, arXiv.org.
  25. Martin Bichler, 2020. "Comments on: Shared resources in collaborative vehicle routing," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 21-24, April.
  26. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.