An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360)
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 6654168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines |
scientific article; zbMATH DE number 6654168 |
Statements
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (English)
0 references
17 November 2016
0 references
freight transportation
0 references
pickup and delivery problem
0 references
heuristic algorithm
0 references
scheduled lines
0 references
0 references
0.8535560965538025
0 references
0.8121232986450195
0 references
0.7752249240875244
0 references
0.7738990783691406
0 references
