An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671)
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: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics |
scientific article; zbMATH DE number 6651781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics |
scientific article; zbMATH DE number 6651781 |
Statements
An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (English)
0 references
11 November 2016
0 references
two-echelon vehicle routing problem
0 references
location routing problem
0 references
adaptive large neighborhood search heuristic
0 references
city logistics
0 references
0 references
0 references
0.8998916745185852
0 references
0.8827582597732544
0 references
0.8672647476196289
0 references
0.8527014851570129
0 references
0.8325307965278625
0 references
