Implementation techniques for the vehicle routing problem (Q1086140): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: VRP / rank | |||
Normal rank | |||
Revision as of 06:49, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementation techniques for the vehicle routing problem |
scientific article |
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
