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...

全面介紹

書目詳細資料

發表在:	ISPRS International Journal of Geo-Information
Main Authors:	Yichun Su, Yunbo Ran, Zhao Yan, Yunfei Zhang, Xue Yang
格式:	Article
語言:	英语
出版:	MDPI AG 2025-03-01
主題:	combinatorial optimization problems weighted mean of vectors algorithm traveling salesman problem short-distance delivery
在線閱讀:	https://www.mdpi.com/2220-9964/14/3/111