An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits (Q1628066)
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 6988108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits |
scientific article; zbMATH DE number 6988108 |
Statements
An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits (English)
0 references
3 December 2018
0 references
vehicle routing
0 references
synchronized-services
0 references
time windows
0 references
adaptive large neighborhood search
0 references
0 references
0 references
0 references
0 references
0.8754369020462036
0 references
0.8525658845901489
0 references
0.8495575785636902
0 references
0.8123719692230225
0 references
0.8032709360122681
0 references
