Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiently solving the traveling thief problem using hill climbing and simulated annealing |
scientific article; zbMATH DE number 7222631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently solving the traveling thief problem using hill climbing and simulated annealing |
scientific article; zbMATH DE number 7222631 |
Statements
Efficiently solving the traveling thief problem using hill climbing and simulated annealing (English)
0 references
20 July 2020
0 references
interdependence
0 references
combinatorial optimization
0 references
large-scale optimization
0 references
traveling thief problem
0 references
simulated annealing
0 references
local search
0 references
0 references
0 references
0.7862571477890015
0 references
0.7761958837509155
0 references
0.7754836082458496
0 references
0.7555042505264282
0 references
0.7130867838859558
0 references
