Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826)
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 6636195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests |
scientific article; zbMATH DE number 6636195 |
Statements
Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (English)
0 references
7 October 2016
0 references
vehicle routing problem
0 references
pickup and delivery problem
0 references
time window
0 references
profit
0 references
adaptive large neighborhood search
0 references
0 references
0 references
0 references
0 references
0.7856776118278503
0 references
0.7801464200019836
0 references
0.7754724025726318
0 references
0.7752249240875244
0 references
0.7631604671478271
0 references
