The Covering Salesman Problem (CSP) is a generalization of the Traveling in which tour not required to visit all vertices, as long vertices are covered by tour. objective CSP find minimum length Hamiltonian cycle over subset that covers an undirected graph. In this paper, valid inequalities from generalized traveling salesman problem applied addition new explore distinct aspects problem. A bran...

It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using existing solvers for TSP. This paper evaluates the performance of the state-of-the art TSP solver Lin...

We study the version of the prize collecting traveling salesman problem, where the objective is to find a tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. We present an approximation algorithm with constant bound. The algorithm is based on Christofides' algorithm for the traveling s...

There are two major criticisms about simulated annealing as a general method for solving combinatorial optimization problems: its effectiveness when compared with other welldesigned heuristics and its excessive computation time. In this paper, we show that simulated annealing, with properly des~gned annealing schedule and move generation strategy, achieves significant speerlups for high quality...

This paper presents a comparative study of five different coarse-grained parallel genetic algorithms (PGAs) using the traveling salesman problem as the case application. All of these PGAs are based on the same baseline serial genetic algorithm, implemented on the same parallel machine (IBM SP2), tested on the same problem instances, and started from the same set of initial populations. Based on...

We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: [D. Cvetković, M. Cangalović and V. Kovačević-Vujčić. Semidefinite Programming Methods for the Symmetric Traveling Salesman...

proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A larg...

This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition ,we make a mapping among the three parts discrete particle swarm optimization (DPSO)、 evolutionary game the...