The paper deals with a comparison between two different methods in generating sub-optimal solutions to the Hopfield-Tank TSP (traveling salesman problem) neural algorithm. Namely, the Hopfield-Tank TSP neural algorithm has been applied in the paper to the linear ship’s route, that is cycle voyage modeling, which means here finding the optimal visiting order of a given set of ports in such way a...

We improve the lower bound on the integrality ratio of the Held-Karp bound for asymmetric TSP with triangle inequality from 4/3 to 2. 1. Introduction. The traveling salesman problem (TSP)—the problem of finding a minimum cost tour through a set of cities—is the most celebrated combinatorial optimization problem. It is often used as a testbed for novel ideas, as was the case for Adleman's molecu...

A new genetic algorithm (GA) for the Traveling Salesman Problem (TSP) is given. Two novel features of this algorithm are: (i) a new locus-based encoding/crossover pair, and (ii) a static preprocessing step which changes the e"g order of the vertices. It is believed that this algorithm is also applicable to other ordering problems, not just TSP. Experimental results on the standard benchmarks fo...

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...

Traveling salesman problem is of the known and classical problems at Research in Operations. Many scientific activities can be solved as traveling salesman problem. Existing methods for solving hard problems (such as the traveling salesman problem) consists of a large number of variables and constraints which reduces their practical efficiency in solving problems with the original size. In rece...

this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...

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...

Abstract Traveling Salesman Problem (TSP) is a typical combinatorial optimization problem, and it NP-hard problem. The total number of routes increases exponentially with the cities, so great significance to design an effective algorithm find optimal solution accurately. Chicken Swarm Optimization (CSO) new intelligent algorithm, which mainly proposed for continuous problems. It has advantages ...

Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP) expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fin...

This paper deals with some new operators of genetic algorithms for solving the traveling salesman problem (TSP). These include a new operator called, ”nearest fragment operator” based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. Superiority of these operators has been established on different benchmark data sets for symmetric TSP. Finally, th...