ABSTRACT College of Business, CB 419 University of Colorado Boulder, CO 80309 email:
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …

Meta-heuristics are the most recent development in approximate search methods for solving
complex optimization problems, that arise in business, commerce, engineering, industry …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications 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 …

Heuristic optimization provides a robust and efficient approach for solving complex real-
world problems. The focus of this research is on a hybrid method combining two heuristic …

Over the last 15 years, hundreds of papers presenting applications of tabu search, a
heuristic method originally proposed by (1986), to various combinatorial problems have …

A hybrid method combining two algorithms is proposed for the global optimization of
multiminima functions. To localize a “promising area”, likely to contain a global minimum, it is …

Genetic algorithms are stochastic search approaches based on randomized operators, such
as selection, crossover and mutation, inspired by the natural reproduction and evolution of …

A new algorithm called Enhanced Continuous Tabu Search (ECTS) is proposed for the
global optimization of multiminima functions. It results from an adaptation of combinatorial …