Asymmetric travelling salesman problem (ATSP)¶
Definition 1: Asymmetric travelling salesman problem
In the asymmetric travelling salesman problem (ATSP) the distances are not required to be symmetric: \(d_{ij}\) may differ from \(d_{ji}\). The definition of tour and of its length \(L(\sigma)\) is unchanged, but a tour and the same tour travelled backwards are different solutions.
What the course does on this problem¶
| Technique | Where |
|---|---|
| Definition | Ch. 6 «Routing problems» |
| Formulations | Ch. 13 «Formulations of routing problems» |
| Exercises | Exercise 6.5; Exercise 13.6 |