The field of metaheuristics for the application to combinatorial optimization problems is a
rapidly growing field of research. This is due to the importance of combinatorial optimization …

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 …

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 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 …

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

Scatter search is an evolutionary method that has been successfully applied to hard
optimization problems. The fundamental concepts and principles of the method were first …

Abstract We propose hybrid Artificial Bee Colony (ABC) optimization algorithms for the well-
known Quadratic Assignment Problem (QAP). Large problem instances of the QAP are still …

Given a weighted graph with a capacity associated to each node (element), the capacitated
dispersion problem (CDP) consists in selecting a subset of elements satisfying a capacity …

This paper studies an NP-hard multi-period production–distribution problem to minimize the
sum of three costs: production setups, inventories and distribution. This problem is solved by …