Solving the shortest route cut and fill problem using simulated annealing (Q1869428)
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: Solving the shortest route cut and fill problem using simulated annealing |
scientific article; zbMATH DE number 1896761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the shortest route cut and fill problem using simulated annealing |
scientific article; zbMATH DE number 1896761 |
Statements
Solving the shortest route cut and fill problem using simulated annealing (English)
0 references
10 April 2003
0 references
heuristics
0 references
simulated annealing
0 references
traveling salesman problem
0 references
local search algorithms
0 references
shortest route problem
0 references
0 references
0.9397897
0 references
0.91179395
0 references
0.8940575
0 references
0.88815546
0 references
0.8799789
0 references
0.87916785
0 references
0.8786141
0 references
