Parallel Savings Based Heuristics for the Delivery Problem (Q3978843)
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 12965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel Savings Based Heuristics for the Delivery Problem |
scientific article; zbMATH DE number 12965 |
Statements
Parallel Savings Based Heuristics for the Delivery Problem (English)
0 references
25 June 1992
0 references
delivery problem
0 references
vehicle routing
0 references
fleet of capacitated vehicles
0 references
parallel savings algorithms
0 references
heuristics
0 references
0.8163295984268188
0 references
0.8076706528663635
0 references
0.7894200682640076
0 references
0.7862638235092163
0 references
0.7847721576690674
0 references
The authors regard the problem of finding a set of routes for a fleet of capacitated vehicles to satisfy the cargo requirements of customers. The vehicles are located in a depot, and have to fulfill the delivery requirements in a sequence that minimizes total delivery costs. All vehicles have the same capacity. The authors present parallel savings algorithms for generating feasible solutions to this problem. The new algorithm combines the savings approach with matching based procedures. The authors compare the algorithm computationally with other heuristics.
0 references