Variable neighborhood search for the travelling deliveryman problem (Q1942008)
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 6148639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variable neighborhood search for the travelling deliveryman problem |
scientific article; zbMATH DE number 6148639 |
Statements
Variable neighborhood search for the travelling deliveryman problem (English)
0 references
25 March 2013
0 references
combinatorial optimization
0 references
routing
0 references
travelling deliveryman problem
0 references
metaheuristics
0 references
variable neighborhood search
0 references
0 references
0 references
0.8166823387145996
0 references
0.7967746257781982
0 references
0.7946593761444092
0 references
0.7930130958557129
0 references
0.7827513813972473
0 references
