Travelling salesman problem. Best route finder

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.

Example body params:

[
[13.474126,52.519758, "Berlin"],
[13.052888,52.388879,"Potsdam"],
[11.640848,52.144362,"Mag...

搜集汇总

背景与挑战

背景概述

该数据集聚焦于旅行商问题（TSP），这是一个组合优化中的NP难问题，旨在寻找访问所有城市并返回起点的最短可能路径。它在理论计算机科学和运筹学领域具有重要研究价值。