Evolution strategies form a class of evolutionary optimization procedures the behavior of
which is comparatively well understood theoretically, at least for simple cases. An approach …

The component layout or packaging problem requires efficient search of large,
discontinuous spaces. This survey paper reviews the state-of-the-art in product layout …

Motivated by emerging battery-operated applications that demand intensive computation in
portable environments, techniques are investigated which reduce power consumption in …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We analyze relationships among local minima for the traveling salesman and graph
bisection problems under standard neighborhood structures. Our work reveals surprising …

This paper introduces and analyzes a parallel method of simulated annealing. Borrowing
from genetic algorithms, an effective combination of simulated annealing and genetic …

The increasing demand for portable computing has elevated power consumption to be one
of the most critical design parameters. A high-level synthesis system, HYPER-LP, is …

Local search has been applied successfully to a diverse collection of optimization problems.
It's appreciated for its basic conceptual foundation, its general applicability, and its power to …

Parameter control is aimed at realizing performance gains through a dynamic choice of the
parameters which determine the behavior of the underlying optimization algorithm. In the …