Restart strategies in optimization: parallel and serial cases

Authors:
Oleg V. Shylo;Timothy Middelkoop;Panos M. Pardalos
Affiliations:
Dept. of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA;Dept. of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA;Dept. of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA
Venue:
Parallel Computing
Year:
2011

Citing 8
Cited 4

Optimal speedup of Las Vegas algorithms

Information Processing Letters
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
RESTART Technology for Solving Discrete Optimization Problems

Cybernetics and Systems Analysis
Optimal Parallelization of Las Vegas Algorithms

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Formal Models of Heavy-Tailed Behavior in Combinatorial Search

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Optimization Parallelizing for Discrete Programming Problems

Cybernetics and Systems Analysis
Analysis and Algorithms for Restart

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
An Advanced Tabu Search Algorithm for the Job Shop Problem

Journal of Scheduling

On algorithm portfolios and restart strategies

Operations Research Letters
Global equilibrium search algorithms for combinatorial optimization problems

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
From sequential to parallel local search for SAT

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
On Maximum Speedup Ratio of Restart Algorithm Portfolios

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the existence of an effective restart strategy are presented. We clarify the counter-intuitive empirical observations of super linear speedup and relate parallel speedup with the restart properties of serial algorithms. The general property of restart distributions is derived. The computational experiments involving the state-of-the-art optimization algorithm are provided.