Path-relinking is a major enhancement to the basic greedy randomized adaptive search
procedure (GRASP), leading to significant improvements in solution time and quality. Path …

Scatter search (SS) is a population-based method that has recently been shown to yield
promising outcomes for solving combinatorial and nonlinear optimization problems. Based …

The importance of high performance algorithms for tackling difficult optimization problems
cannot be understated, and in many cases the only available methods are metaheuristics …

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global
optimization problems whose basic idea is a systematic change of neighborhood both within …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …

GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each
iteration consists basically of two phases: construction and local search. The construction …

The evolutionary approach called Scatter Search, and its generalized form called Path
Relinking, have proved unusually effective for solving a diverse array of optimization …

This chapter discusses the principles and foundations behind scatter search and its
application to the problem of training neural networks. Scatter search is an evolutionary …

Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …