Solving the traveling delivery person problem with limited computational time (Q2103948)
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 7630661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the traveling delivery person problem with limited computational time |
scientific article; zbMATH DE number 7630661 |
Statements
Solving the traveling delivery person problem with limited computational time (English)
0 references
9 December 2022
0 references
metaheuristics
0 references
traveling delivery person problem
0 references
minimum latency problem
0 references
run-time distribution
0 references
variable neighborhood search
0 references
0 references
0 references
0 references
0 references
0.90297264
0 references
0.8997611
0 references
0.89961314
0 references
0.8897735
0 references
0.88588005
0 references
0.88036263
0 references
0.8789972
0 references
0 references
0.87365997
0 references
