Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing (Q3755217)
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 4003887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing |
scientific article; zbMATH DE number 4003887 |
Statements
Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing (English)
0 references
1985
0 references
single vehicle many-to-many pickup and delivery problem
0 references
desired delivery times
0 references
routing
0 references
heuristic algorithm
0 references
computational experiments
0 references
0.9175354838371276
0 references
0.8499791622161865
0 references
0.7989079356193542
0 references
0.7982535362243652
0 references
0.7967058420181274
0 references
