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

Authors:
N. Lesh;M. Mitzenmacher
Affiliations:
Mitsubishi Electric Research Laboratories, Cambridge, MA;Harvard University, Computer Science Department, Cambridge, MA and Mitsubishi Electric Research Laboratories
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 3

(Incremental) priority algorithms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the Power of Priority Algorithms for Facility Location and Set Cover

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Human-guided tabu search

Eighteenth national conference on Artificial intelligence
Exhaustive approaches to 2D rectangular perfect packings

Information Processing Letters
Heuristic-biased stochastic sampling

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
Brief paper: A revision of recent approaches for two-dimensional strip-packing problems

Engineering Applications of Artificial Intelligence
Evaluating the effectiveness of FDM in identifying important factors in a dynamic flowshop

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority algorithms, which sequentially assign values to elements in some fixed or adaptively determined order. BubbleSearch extends priority algorithms by selectively considering additional orders near an initial good ordering. While many notions of nearness are possible, we explore algorithms based on the Kendall-tau distance (also known as the BubbleSort distance) between permutations. Our contribution is to elucidate the BubbleSearch paradigm and experimentally demonstrate its effectiveness.