Solving the Traveling Thief Problem Based on Item Selection Weight and Reverse-Order Allocation
The traveling thief problem (TTP) is a challenging combinatorial optimization problem that has attracted many scholars, the problem interconnects two well-known NP-hard problems: the traveling salesman problem and the 0-1 knapsack problem. Various approaches have increasingly been proposed to solve...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IEEE
2021-01-01
|
| Colecção: | IEEE Access |
| Assuntos: | |
| Acesso em linha: | https://ieeexplore.ieee.org/document/9391994/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|