A two-stage algorithm based on greedy ant colony optimization for travelling thief problem

Abstract The travelling thief problem (TTP) combines two NP-hard problems, traveling salesman problem (TSP) and knapsack problem (KP), which is more complicated for solving. In TTP, the salesman needs to choose the travel route and select the items at the same time to maximize the profit. Consequent...

全面介绍

书目详细资料
发表在:Complex & Intelligent Systems
Main Authors: Zheng Zhang, Xiao-Yun Xia, Zi-Jia Wang, You-Zhen Jin, Wei-Zhi Liao, Jun Zhang
格式: 文件
语言:英语
出版: Springer 2025-04-01
主题:
在线阅读:https://doi.org/10.1007/s40747-025-01865-1