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...
Sparad:
| Huvudupphov: | , , , , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Springer
2025-04-01
|
| Serie: | Complex & Intelligent Systems |
| Ämnen: | |
| Länkar: | https://doi.org/10.1007/s40747-025-01865-1 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|