An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An assign-and-route matheuristic for the time-dependent inventory routing problem |
scientific article; zbMATH DE number 7493234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An assign-and-route matheuristic for the time-dependent inventory routing problem |
scientific article; zbMATH DE number 7493234 |
Statements
An assign-and-route matheuristic for the time-dependent inventory routing problem (English)
0 references
18 March 2022
0 references
logistics
0 references
inventory routing problem
0 references
time-dependent travelling time
0 references
realistic benchmark
0 references
matheuristic
0 references
0 references
0 references
0 references
0 references
0 references
0.8038747310638428
0 references
0.7956692576408386
0 references
0.7955859303474426
0 references
0.7697790861129761
0 references
