Semi-greedy heuristics: An empirical study (Q1821033)
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: Semi-greedy heuristics: An empirical study |
scientific article; zbMATH DE number 3997560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-greedy heuristics: An empirical study |
scientific article; zbMATH DE number 3997560 |
Statements
Semi-greedy heuristics: An empirical study (English)
0 references
1987
0 references
Given p or c, a semi-greedy heuristic chooses each iteration's decision randomly from among those decisions resulting in objective value improvements either within p\% of the best improvement or among the c best improvements. In the context of vehicle routing, we empirically compare the single use of a greedy heuristic with repeated use of a semi- greedy heuristic.
0 references
heuristic solution
0 references
vehicle routing
0 references
semi-greedy heuristic
0 references
0 references
