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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Zheng Zhang, Xiao-Yun Xia, Zi-Jia Wang, You-Zhen Jin, Wei-Zhi Liao, Jun Zhang
Format: Article
Language:English
Published: Springer 2025-04-01
Series:Complex & Intelligent Systems
Subjects:
Ant colony optimization
Genetic algorithm
Travelling thief problem
Combinatorial optimization
Online Access:https://doi.org/10.1007/s40747-025-01865-1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://doi.org/10.1007/s40747-025-01865-1

Similar Items