Semi-greedy heuristics: An empirical study

Authors:
J.Pirie Hart;Andrew W. Shogan
Affiliations:
Department of Management Science, University of Washington, Seattle, WA 98195, USA;School of Business Administration, University of California, 350 Barrows Hall, Berkely, CA 94720, USA
Venue:
Operations Research Letters
Year:
1987

Citing 1
Cited 8

Software Tools

Software Tools

BubbleSearch: A simple heuristic for improving priority-based greedy algorithms

Information Processing Letters
A guided reactive GRASP for the capacitated multi-source Weber problem

Computers and Operations Research
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

Computers and Operations Research
Computational aspects of the maximum diversity problem

Operations Research Letters
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters
A survey on optimization metaheuristics

Information Sciences: an International Journal
Quadratic bottleneck knapsack problems

Journal of Heuristics
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.