A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (Q1637720)
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: A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain |
scientific article; zbMATH DE number 6882717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain |
scientific article; zbMATH DE number 6882717 |
Statements
A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (English)
0 references
11 June 2018
0 references
vehicle routing problem with hard time windows
0 references
\(K\)-means clustering algorithm
0 references
\(K\)-medoids clustering algorithm
0 references
DBSCAN clustering algorithm
0 references
cluster first route second approach
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7819328308105469
0 references
0.7618841528892517
0 references
0.761349618434906
0 references
0.7508852481842041
0 references
