A hybrid heuristic solving the traveling salesman problem

This paper presents a new hybrid heuristic for solving the Traveling Salesman Problem, The algorithm is designed on the frame of a general optimization procedure which acts upon two steps, iteratively. In first step of the global search, a feasible tour is constructed based on insertion approach. In the second step the feasible tour found at the first step, is improved by a local search optimization procedure. The second part of the paper presents the performances of the proposed heuristic algorithm, on several test instances. The statistical analysis shows the effectiveness of the local search optimization procedure, in the graphical representation.peer-reviewe

Path Planning for Cooperative Routing of Air-Ground Vehicles

We consider a cooperative vehicle routing problem for surveillance and reconnaissance missions with communication constraints between the vehicles. We propose a framework which involves a ground vehicle and an aerial vehicle; the vehicles travel cooperatively satisfying the communication limits, and visit a set of targets. We present a mixed integer linear programming (MILP) formulation and develop a branch-and-cut algorithm to solve the path planning problem for the ground and air vehicles. The effectiveness of the proposed approach is corroborated through extensive computational experiments on several randomly generated instances

Accelerated Stochastic Sampling of Discrete Statistical Systems

We propose a method to reduce the relaxation time towards equilibrium in stochastic sampling of complex energy landscapes in statistical systems with discrete degrees of freedom by generalizing the platform previously developed for continuous systems. The method starts from a master equation, in contrast to the Fokker-Planck equation for the continuous case. The master equation is transformed into an imaginary-time Schr\"odinger equation. The Hamiltonian of the Schr\"odinger equation is modified by adding a projector to its known ground state. We show how this transformation decreases the relaxation time and propose a way to use it to accelerate simulated annealing for optimization problems. We implement our method in a simplified kinetic Monte Carlo scheme and show an acceleration by an order of magnitude in simulated annealing of the symmetric traveling salesman problem. Comparisons of simulated annealing are made with the exchange Monte Carlo algorithm for the three-dimensional Ising spin glass. Our implementation can be seen as a step toward accelerating the stochastic sampling of generic systems with complex landscapes and long equilibration times.Comment: 18 pages, 6 figures, to appear in Phys. Rev.