Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and
self-organized swarms. The well known examples for these swarms are bird flocks, fish …

Over past few decades, families of algorithms based on the intelligent group behaviors of
social creatures like ants, birds, fishes, and bacteria have been extensively studied and …

Most of the optimization problems encountered in the real world are discrete type which
involves decision variables defined in the discrete search space. Binary optimization …

The multiple traveling salesperson problem (MTSP) is similar to famous traveling
salesperson problem (TSP) except for the fact that there are more than one salesperson to …

This paper studies a hybrid artificial bee colony (ABC) algorithm for finding high quality
solutions of the job-shop scheduling problem with no-wait constraint (JSPNW) with the …

The quadratic multiple knapsack problem (QMKP) is a variant of the classical knapsack
problem where multiple knapsacks are considered and the objective is to maximize a …

Abstract The Artificial Bee Colony (ABC) algorithm is widely used to achieve optimum
solution in a short time in integer-based optimization problems. However, the complexity of …

Iterated greedy search is a simple and effective metaheuristic for combinatorial problems. Its
flexibility enables the incorporation of components from other metaheuristics with the aim of …

This paper addresses the recently introduced colored traveling salesman problem (CTSP),
which is a variant of the multiple traveling salesman problem (MTSP). In the MTSP, given a …

The quadratic multiple knapsack problem (QMKP) is a challenging combinatorial
optimization problem with numerous applications. In this paper, we propose the first …