Traveling Salesperson Problem

The Traveling Salesperson Problem (TSP) is one of the most important combinatorial optimization tasks, one of the classical tasks from the field of Operations Research. Here, the goal is to find the shortest round-trip tour through n cities and back to the origin. A TSP instance is defined by the number of cities and their distances. In a symmetric instance, the distance from A to B is the same as the distance from B to A, in an asymmetric instance, this is not necessarily true.

Publications

• Tianyu LIANG (梁天宇), Zhize WU (吴志泽), Matthias Thürer, Markus Wagner, and Thomas Weise (汤卫思): Generating Small Instances with Interesting Features for the Traveling Salesperson Problem. International Conference on Evolutionary Computation Theory and Applications (ECTA'2024), part of 16th International Joint Conference on Computational Intelligence (IJCCI'2024), November 20-22, 2024, Porto, Portugal, pages 173-180. Setúbal, Portugal: SciTePress.
  TSP, logistics, FFA, moptipy, python, more infos.
• Tianyu LIANG (梁天宇), Zhize WU (吴志泽), Jörg Lässig, Daan van den Berg, Sarah Louise Thomson, and Thomas Weise (汤卫思): Addressing the Traveling Salesperson Problem with Frequency Fitness Assignment and Hybrid Algorithms. Soft Computing 28(17-18):9495-9508. September 2024.
  TSP, logistics, FFA, moptipy, python, more infos.
• Tianyu LIANG (梁天宇), Zhize WU (吴志泽), Jörg Lässig, Daan van den Berg, and Thomas Weise (汤卫思): Solving the Traveling Salesperson Problem using Frequency Fitness Assignment. IEEE Symposium on Foundations of Computational Intelligence (IEEE FOCI'2022), part of the IEEE Symposium Series on Computational Intelligence (SSCI'2022), December 4-7, 2022, Singapore. IEEE.
  TSP, logistics, FFA, moptipy, python, more infos.
• Thomas Weise (汤卫思), Yan JIANG (江炎), Qi QI (齐琪), and Weichen LIU (刘伟臣): A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 13(3):1-18. Autumn 2019.
  TSP, logistics, TSPSuite, more infos.
• Thomas Weise (汤卫思), Yuezhong WU (吴越钟), Weichen LIU (刘伟臣), and Raymond Chiong: Implementation Issues in Optimization Algorithms: Do they matter? Journal of Experimental & Theoretical Artificial Intelligence (JETAI) 31(4):533-554. 2019.
  TSP, logistics, TSPSuite, benchmarking, more infos.
• Thomas Weise (汤卫思), Zijun WU (吴自军), and Markus Wagner: An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search. 33rd AAAI Conference on Artificial Intelligence (AAAI'2019), January 27 - February 1, 2019, Honolulu, Hawaii, USA, pages 2395-2402. Palo Alto, CA, USA: AAAI Press.
  TSP, logistics, more infos.
• Thomas Weise (汤卫思), Xiao-Feng WANG (王晓峰), Qi QI (齐琪), Bin LI (李斌), and Ke TANG (唐珂): Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features. Applied Soft Computing Journal (ASOC), 73:366–382, December 2018.
  TSP, logistics, benchmarking, optimizationBenchmarking, more infos.
• Markus Ullrich, Thomas Weise (汤卫思), Abhishek Awasthi, and Jörg Lässig: A Generic Problem Instance Generator for Discrete Optimization Problems. Genetic and Evolutionary Computation Conference (GECCO'2018) Companion, July 15-19, 2018, Kyoto, Japan, pages 1761-1768 New York, NY, USA: ACM.
  benchmarking, TSP, logistics, more infos.
• Qi QI (齐琪), Thomas Weise (汤卫思), and Bin LI (李斌): Optimization Algorithm Behavior Modeling: A Study on the Traveling Salesman Problem. 10th International Conference on Advanced Computational Intelligence (ICACI'2018), March 29-31, 2018, Xiamen, Fujian, China, IEEE, pages 861-866.
  TSP, TSPSuite, logistics, benchmarking, more infos.
• Weichen LIU (刘伟臣), Thomas Weise (汤卫思), Yuezhong WU (吴越钟), and Qi QI (齐琪): Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem. Genetic and Evolutionary Computation Conference (GECCO'2017), July 15-19, 2017, Berlin, Germany, New York, NY, USA: ACM Press, pages 298-305.
  TSP, TSPSuite, logistics, more infos.
• Thomas Weise (汤卫思), Yuezhong WU (吴越钟), Raymond Chiong, Ke TANG (唐珂), and Jörg Lässig: Global versus Local Search: The Impact of Population Sizes on Evolutionary Algorithm Performance. Journal of Global Optimization (JOGO) 66(3):511-534. November 2016.
  TSPSuite, TSP, logistics, benchmarking, more infos.
• Yuezhong WU (吴越钟), Thomas Weise (汤卫思), and Weichen LIU (刘伟臣): Hybridizing Different Local Search Algorithms with Each Other and Evolutionary Computation: Better Performance on the Traveling Salesman Problem. 18th Genetic and Evolutionary Computation Conference (GECCO'2016), Denver, Colorado, USA, July 20-24, 2016, pages 57-58, New York, NY, USA: ACM.
  TSPSuite, TSP, logistics, more infos.
• Weichen LIU (刘伟臣), Thomas Weise (汤卫思), Yuezhong WU (吴越钟), Dan XU (许丹), and Raymond Chiong: An Improved Ejection Chain Method and Its Hybrid Versions for Solving the Traveling Salesman Problem. Journal of Computational and Theoretical Nanoscience 13(6):3601-3610. June 2016.
  TSPSuite, TSP, logistics, more infos.
• Dan XU (许丹), Thomas Weise (汤卫思), Yuezhong WU (吴越钟), Jörg Lässig, and Raymond Chiong: An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem. 10th International Conference on Bio-Inspired Computing — Theories and Applications (BIC-TA'2015), September 25-28, 2015, Hefei, Anhui, China, Communications in Computer and Information Science, volume 562. Berlin/Heidelberg: Springer-Verlag, pages 523-537.
  TSP, TSPSuite, logistics, more infos.
• Weichen LIU (刘伟臣), Thomas Weise (汤卫思), Yuezhong WU (吴越钟), and Raymond Chiong: Hybrid Ejection Chain Methods for the Traveling Salesman Problem. 10th International Conference on Bio-Inspired Computing — Theories and Applications (BIC-TA'2015), September 25-28, 2015, Hefei, Anhui, China, Communications in Computer and Information Science, volume 562. Berlin/Heidelberg: Springer-Verlag, pages 268-282.
  TSP, TSPSuite, logistics, more infos.
• Yuezhong WU (吴越钟), Thomas Weise (汤卫思), and Raymond Chiong: Local Search for the Traveling Salesman Problem: A Comparative Study. 14th IEEE Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC'2015), July 6-8, 2015, Beijing, China, pages 213-220, Los Alamitos, CA, USA: IEEE Computer Society Press.
  TSP, TSPSuite, logistics, benchmarking, more infos.
• Yan JIANG (江炎), Thomas Weise (汤卫思), Jörg Lässig, Raymond Chiong, and Rukshan Athauda: Comparing a Hybrid Branch and Bound Algorithm with Evolutionary Computation Methods, Local Search and their Hybrids on the TSP. IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS'2014), part of the IEEE Symposium Series on Computational Intelligence (SSCI'2014), December 9-12, 2014, Orlando, FL, USA, pages 148-155. Los Alamitos, CA, USA: IEEE Computer Society Press.
  TSP, TSPSuite, logistics, more infos.
• Thomas Weise (汤卫思), Raymond Chiong, Jörg Lässig, Ke TANG (唐珂), Shigeyoshi Tsutsui, Wenxiang CHEN (陈文祥), Zbigniew Michalewicz, and Xin YAO (姚新): Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. IEEE Computational Intelligence Magazine (CIM) 9(3):40-52. August 2014.
  TSP, TSPSuite, logistics, FFA, more infos.
• Jin OUYANG (欧阳晋), Thomas Weise (汤卫思), Alexandre Devert, and Raymond Chiong: SDGP: A Developmental Approach for Traveling Salesman Problems. IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS'2013), part of the IEEE Symposium Series on Computational Intelligence (SSCI'2013), April 15-19, 2013, Singapore, pages 78-85, Los Alamitos, CA, USA: IEEE Computer Society Press.
  TSP, logistics, GP, more infos.