Solving the Traveling Salesman Problem Using the IDINFO Algorithm

The Traveling Salesman Problem (TSP) is a classical discrete combinatorial optimization problem that is widely applied in various domains, including robotics, transportation, networking, etc. Although existing studies have provided extensive discussions of the TSP, the issues of improving convergenc...

Full description

Bibliographic Details

Published in:	ISPRS International Journal of Geo-Information
Main Authors:	Yichun Su, Yunbo Ran, Zhao Yan, Yunfei Zhang, Xue Yang
Format:	Article
Language:	English
Published:	MDPI AG 2025-03-01
Subjects:	combinatorial optimization problems weighted mean of vectors algorithm traveling salesman problem short-distance delivery
Online Access:	https://www.mdpi.com/2220-9964/14/3/111