Name
Title | ||
|---|---|---|
A Hybrid Diploid Genetic Based Algorithm For Solving The Generalized Traveling Salesman Problem |
Abstract | ||
|---|---|---|
In this paper, we are addressing the generalized traveling salesman problem, denoted by GTSP, which is a variant of the classical traveling salesman problem (TSP). The GTSP is characterized by the fact that the vertices of the graph are partitioned into a given number of clusters and we are looking for the minimum cost tour that visits exactly one vertex from each cluster. The goal of this paper is to present a novel method for solving the GTSP, namely a hybrid diploid genetic based algorithm. The preliminary computational results on an often set of benchmark instances show that our proposed approach provides competitive solutions compared to the existing state-of-the-arts methods for solving the GTSP. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-59650-1_13 | HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2017 |
Field | DocType | Volume |
Bottleneck traveling salesman problem,Particle swarm optimization,Graph,Mathematical optimization,Vertex (geometry),Computer science,Algorithm,Greedy algorithm,Travelling salesman problem,2-opt,Genetic algorithm | Conference | 10334 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.41 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petrica C. Pop | 1 | 183 | 27.86 |
| Oliviu Matei | 2 | 43 | 11.15 |
| C. Sabo | 3 | 19 | 2.50 |