Research Article
A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem
Table 3
The alphabet table (
is a node and
is its value).
| | Node | N (V) | N (V) | N (V) | N (V) | N (V) | N (V) | N (V) |
| | 1 | 4(0) | 7 (0) | 5 (27) | 6 (46) | 2 (67) | 3 (91) | 1 (982) | | 2 | 6 (0) | 7 (0) | 1 (22) | 4 (25) | 3 (66) | 5 (68) | 2 (979) | | 3 | 2 (0) | 4 (10) | 6 (21) | 5 (23) | 7 (23) | 1 (86) | 3 (994) | | 4 | 1 (0) | 3 (0) | 6 (33) | 2 (34) | 7 (38) | 5 (48) | 4 (987) | | 5 | 3 (0) | 2 (30) | 4 (31) | 6 (34) | 7 (39) | 1 (44) | 5 (966) | | 6 | 5 (0) | 1 (6) | 4 (9) | 7 (31) | 2 (32) | 3 (68) | 6 (969) | | 7 | 2 (0) | 3 (12) | 1 (18) | 5 (21) | 6 (29) | 4 (35) | 7 (968) |
|
|
