An adaptive large neighborhood search for an E-grocery delivery routing problem (Q342326)
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 6654152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive large neighborhood search for an E-grocery delivery routing problem |
scientific article; zbMATH DE number 6654152 |
Statements
An adaptive large neighborhood search for an E-grocery delivery routing problem (English)
0 references
17 November 2016
0 references
E-grocery delivery routing problem
0 references
home delivery services
0 references
vehicle routing problem with time windows
0 references
premium good
0 references
premium customer
0 references
adaptive large neighborhood search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8013397455215454
0 references
0.7663871049880981
0 references
0.7393137812614441
0 references
0.7268147468566895
0 references
0.7184739708900452
0 references
