Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic (Q2673293)
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: Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic |
scientific article; zbMATH DE number 7538888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic |
scientific article; zbMATH DE number 7538888 |
Statements
Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic (English)
0 references
9 June 2022
0 references
vehicle routing problem
0 references
integer programming
0 references
insert heuristic
0 references
non-split delivery model
0 references
0 references
0.91696554
0 references
0.90971345
0 references
0.8970156
0 references
0.89557827
0 references
0.8922989
0 references
0.8884794
0 references
0.88563764
0 references
0.8843119
0 references
0.8820088
0 references
