A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.

The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to class of problems known as NP-hard, which an exceptional case travelling salesman (TSP), determines set routes enabling multiple salesmen start at and return home cities (depots). penguins search algorithm (PeSOA) new metaheuristic algorithm. In this paper, we present discrete for solving th...

Traveling Salesman Problem (TSP) is about finding a Hamiltonian path with minimum cost. Travelling salesman problem (TSP) finds its application in many real world industrial applications including the areas such as logistics, transportation, and semiconductor industries. few potential applications of TSP includes finding an optimized scan chains route in integrated chip testing, parcels collect...

Solving NP hard problem like Travelling Salesman Problem (TSP) is a major challenge faced by analysts even though many techniques are available. Many versions of Genetic Algorithms are introduced by researchers to improve its performance in solving TSP. Clustering Genetic Algorithm (CGA) was recently introduced and this paper analyzes the results obtained by implementing it for TSP. It is obser...

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

We introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's clients speciies a neighborhood in which they are willing to meet the salesman. Identifying a tour of minimum length that visits all neighborhoods is an NP-hard problem, since it is a generalization of the Traveling Salesman Problem. We present simple heuristic procedures for constructing tours, for a va...

The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization. Solutions of the Metric TSP are generally used for costs minimization tasks in logistics, manufacturing and genetics. Since this problem is NP-hard, heuristic algorithms providing near optimal solutions in polynomia...

The Travelling Salesman Problem is a well known problem which has becomea comparison benchmark test for different computational methods. Its solution is computationally difficult, although the problem is easily expressed. TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background. The aim of our work is to compare existing algorithms that ar...

This paper presents a Multi-MetaHeuristic combined Ant Colony System (ACS)-Travelling Salesman Problem(TSP) algorithm for solving the TSP. We introduce genetic algorithm in ACS-TSP to search solutions space for dealing with the early stagnation problem of the traveling salesman problem. Moreover, we present a new strategy of Minimum Spanning Tree (MST) coupled with Nearest Neighbor(NN) to const...