We present a physics inspired heuristic method for solving combinatorial optimization problems. Our approach is specifically motivated by the desire to avoid trapping in metastable local minima- a common occurrence in hard problems with multiple extrema. Our method involves (i) coupling otherwise independent simulations of a system ("replicas") via geometrical distances as well as (ii) probabilistic inference applied to the solutions found by individual replicas. The {\it ensemble} of replicas evolves as to maximize the inter-replica correlation while simultaneously minimize the local intra-replica cost function (e.g., the total path length in the Traveling Salesman Problem within each replica). We demonstrate how our method improves the performance of rudimentary local optimization schemes long applied to the NP hard Traveling Salesman Problem. In particular, we apply our method to the well-known "$k$-opt" algorithm and examine two particular cases- $k=2$ and $k=3$. With the aid of geometrical coupling alone, we are able to determine for the optimum tour length on systems up to $280$ cities (an order of magnitude larger than the largest systems typically solved by the bare $k=3$ opt). The probabilistic replica-based inference approach improves $k-opt$ even further and determines the optimal solution of a problem with $318$ cities and find tours whose total length is close to that of the optimal solutions for other systems with a larger number of cities.
Solving the clustered traveling salesman problem with d-relaxed priority rule
University of Technology and Engineering, Vietnam National University(越南国立大学工程技术大学);Interuniversitary Research Centre on Entreprise Networks, Logistics and Transportation (CIRRELT)(企业网络、物流与运输校际研究中心(CIRRELT));Polytechnique Montréal(蒙特利尔理工学院)
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
School of Computer Science, Huazhong University of Science and Technology(华中科技大学计算机科学与技术学院);Institute of Artificial Intelligence, Huazhong University of Science and Technology(华中科技大学人工智能研究院);MIS, University of Picardie Jules Verne(皮卡第儒勒-凡尔纳大学MIS实验室)
Fixed set search applied to the traveling salesman problem
Qatar Environment and Energy Research Institute (QEERI), Hamad bin Khalifa University(哈马德·本·哈利法大学卡塔尔环境与能源研究所);State University of Novi Pazar(新帕扎尔州立大学);University of Hamburg(汉堡大学);Pontificia Universidad Católica de Valparaíso(瓦尔帕莱索天主教大学)
Steiner Traveling Salesman Problem with Quantum Annealing
Department of Mechanical, Energy and Management Engineering, University of Calabria(机械、能源与管理工程系,卡塔尔大学);TECNALIA, Basque Research and Technology Alliance (BRTA)(TECNALIA,巴斯克研究与技术联盟(BRTA))