The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (Q1027598)
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 5571501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches |
scientific article; zbMATH DE number 5571501 |
Statements
The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches (English)
0 references
30 June 2009
0 references
routing
0 references
packing
0 references
metaheuristics
0 references
TSP variants
0 references
0 references
0 references
0 references
0 references
0.90424245595932
0 references
0.9017504453659058
0 references
0.8947449922561646
0 references
0.893815279006958
0 references
0.8801127076148987
0 references
