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.
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1995
|
| Sorozat: | Acta cybernetica
12 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12556 |