Semi-greedy heuristics: An empirical study (Q1821033): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(87)90021-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2110376540 / rank | |||
Normal rank | |||
Revision as of 00:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-greedy heuristics: An empirical study |
scientific article |
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
