Real-Life Traveling-Salesman Problem
SU Li-jie
Abstract
SU Li-jie
Abstract
This note proposes a new traveling-salesman problem, which is called Real-Life Traveling-Salesman Problem (RLTSP). RLTSP is quite close to the traveling-salesman problem in real life, and it is between the traditional traveling-salesman problem (TSP) and the graphical traveling-salesman problem (GTSP). An incomplete mathematics modeling of RLTSP is given in the note.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This note proposes a new traveling-salesman problem, which is called Real-Life Traveling-Salesman Problem (RLTSP). RLTSP is quite close to the traveling-salesman problem in real life, and it is between the traditional traveling-salesman problem (TSP) and the graphical traveling-salesman problem (GTSP). An incomplete mathematics modeling of RLTSP is given in the note.
Key concepts: Travelling salesman problem, Bottleneck traveling salesman problem, 2-opt, Traveling purchaser problem, Mathematical optimization, Computer science, Christofides algorithm, Nearest neighbour algorithm