Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4031434
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized travelling salesman problem through n sets of nodes: The asymmetrical case |
scientific article; zbMATH DE number 4031434 |
Statements
Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (English)
0 references
1987
0 references
This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters of nodes, in the case where the distance matrix is asymmetrical. The problem is formulated as an integer linear program. The program is then relaxed and solved by a branch and bound algorithm. Computational results are reported for problems involving up to 100 nodes and 8 clusters.
0 references
asymmetrical case
0 references
exact algorithm
0 references
generalized version
0 references
Travelling Salesman
0 references
shortest Hamiltonian circuit
0 references
branch and bound
0 references
Computational results
0 references
0 references
0 references
0.8463484048843384
0 references
0.8463108539581299
0 references
0.8300920724868774
0 references
0.8251705765724182
0 references
