We present a survey of some non-standard travelling salesman problems (TSP) with emphasis on authors' contributions. The results include complexity indices and k-best solutions for the ordinary TSP, the TSP on a chained structure, a multi-TSP on a bandwidth-limited digraph as well as the corresponding general case, a generalized TSP as well as the description of some software for TSP.