Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing (Q1379745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1121405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing |
scientific article; zbMATH DE number 1121405 |
Statements
Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing (English)
0 references
20 September 1998
0 references
simulated annealing
0 references
near-optimal solutions
0 references
vehicle routing
0 references
time windows
0 references
0.7920379042625427
0 references
0.7911520004272461
0 references
0.7684319615364075
0 references
