A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165)
From MaRDI portal
!
WARNING
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 6938895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups |
scientific article; zbMATH DE number 6938895 |
Statements
A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (English)
0 references
18 September 2018
0 references
routing
0 references
pickup and delivery
0 references
discrete split
0 references
tabu search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9108553528785706
0 references
0.8149238228797913
0 references
0.8102563619613647
0 references
0.8005590438842773
0 references
0.7988279461860657
0 references
