Several different ways exist for approaching hard optimization problems. Mathematical
programming techniques, including (integer) linear programming based methods, and …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

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

The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …

In this paper, a novel binary fruit fly optimization algorithm (bFOA) is proposed to solve the
multidimensional knapsack problem (MKP). In the bFOA, binary string is used to represent …

The combination of components from different algorithms is currently one of the most
successful trends in optimization. The hybridization of metaheuristics such as ant colony …

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

We study the multidimensional knapsack problem, present some theoretical and empirical
results about its structure, and evaluate different integer linear programming (ILP)-based …

The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in
combinatorial optimization. In this paper, we consider their multiobjective extension (MOKP …

Over the years, portfolio optimization remains an important decision-making strategy for
investment. The most familiar and widely used approach in the field of portfolio optimization …