There is a trend in the scientific community to model and solve complex optimization
problems by employing natural metaphors. This is mainly due to inefficiency of classical …

Bees algorithm (BA) is a new member of meta-heuristics. BA tries to model natural behavior
of honey bees in food foraging. Honey bees use several mechanisms like waggle dance to …

The generalized assignment problem is a classical combinatorial optimization problem
known to be NP-hard. It can model a variety of real world applications in location, allocation …

Network-level pavement maintenance programming is characterised by its high
computational complexity. In this article, a novel modelling to solve this problem efficiently is …

I came up with the idea of editing this volume in the summer of 2002 while working on the
book ''Scatter search—methodologies and implementations in C''with Manuel Laguna in the …

Efficient planning and management of the workforce resources is one of the most essential
requirements for the companies operating in the service sector. For banks, a large number of …

The traditional Generalized Assignment Problem (GAP) problem consists of assigning n
different tasks to m different agents, while minimizing a cost function. Additionally, it is …

The resource availability cost problem (RACP)(Möhring, Operations Research, 32: 89–120,
1984) is commonly encountered in project scheduling. RACP aims to minimize the resource …

The importance of tuning a search algorithm for the specific features of the target search
space has been known for quite some time. However, when dealing with multiobjective …

The generalized assignment problem is a classical combinatorial optimization problem
known to be NP-hard. It can model a variety of real world applications in location, allocation …