Solving the shortest route cut and fill problem using simulated annealing (Q1869428): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:39, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the shortest route cut and fill problem using simulated annealing |
scientific article |
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
