A large neighbourhood based heuristic for two-echelon routing problems (Q342576)
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: A large neighbourhood based heuristic for two-echelon routing problems |
scientific article; zbMATH DE number 6654253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A large neighbourhood based heuristic for two-echelon routing problems |
scientific article; zbMATH DE number 6654253 |
Statements
A large neighbourhood based heuristic for two-echelon routing problems (English)
0 references
17 November 2016
0 references
two-echelon vehicle routing problem
0 references
wo-echelon location routing problem
0 references
two-echelon location routing problem with single depot
0 references
adaptive large neighbourhood search
0 references
covariance matrix adaptation evolution strategy
0 references
capacitated vehicle routing problem
0 references
large neighbourhood search
0 references
multi-depot vehicle routing problem
0 references
split delivery vehicle routing problem
0 references
variable neighbourhood search
0 references
heuristic
0 references
city logistics
0 references
0 references
0 references
0.8827582597732544
0 references
0.8626874089241028
0 references
0.8354063630104065
0 references
0.8261904716491699
0 references
0.8250964283943176
0 references
