On a tour construction heuristic for the asymmetric TSP
In this paper we deal with a new tour construction procedure for the asymmetric traveling salesman problem. This heuristic is based on a new patching operation which joins three subtours together. Regarding the efficiency of this procedure, we present an empirical analysis.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1995
|
| Series: | Acta cybernetica
12 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12556 |
| Summary: | In this paper we deal with a new tour construction procedure for the asymmetric traveling salesman problem. This heuristic is based on a new patching operation which joins three subtours together. Regarding the efficiency of this procedure, we present an empirical analysis. |
|---|---|
| Physical Description: | 209-216 |
| ISSN: | 0324-721X |