On the vehicle routing problem (Q4378935)
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 1124931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the vehicle routing problem |
scientific article; zbMATH DE number 1124931 |
Statements
On the vehicle routing problem (English)
0 references
5 March 1998
0 references
vehicle routing
0 references
single depot
0 references
equally capacitated vehicles
0 references
branch-and-cut
0 references
0 references
0.8577401041984558
0 references
0.8459898233413696
0 references
The article presents a practicle approach to a vehicle routing problem. From a single depot several clients are served by equally capacitated vehicles. The total distance per vehicle is limited and the overall distance is minimized. This NP-hard problem is attacked by a branch-and-cut algorithm. A lot of numerical results are given for problems ranging from 15 to 95 customers. In the examples some modifications of the solution methods are compared to give an overview on the effectiveness of the approach.
0 references
