Implementation techniques for the vehicle routing problem (Q1086140)
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 3984944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementation techniques for the vehicle routing problem |
scientific article; zbMATH DE number 3984944 |
Statements
Implementation techniques for the vehicle routing problem (English)
0 references
1985
0 references
Six methods for implementing the widely used Clarke-Wright algorithm for the vehicle routing problem (VRP) ae presented and compared. Fifty-five large test problems are used to compare the methods. The methods involve alternative ways to access adjacency information in both low and high density problems. The results clearly establish methods of choice for VRP problems with given characteristics.
0 references
Clarke-Wright algorithm
0 references
vehicle routing
0 references
large test problems
0 references
0 references
0.8181294798851013
0 references
0.8121819496154785
0 references
0.8040719628334045
0 references
0.8031007647514343
0 references
0.8030684590339661
0 references
