This paper aims to prove the efficiency of an adapted computationally intelligence-based
behavior of cats called the cat swarm optimization algorithm, that solves the open shop …

The Job shop scheduling problem is known as a combinatorial optimization problem that
aims to find best sequence of operations with optimal execution time called makespan …

The quadratic assignment problem (QAP) is one of the most studied combinatorial
optimization problems with various practical applications. In This paper, we present an Elite …

In this paper, an improved hybrid genetic-hierarchical algorithm for the solution of the
quadratic assignment problem (QAP) is presented. The algorithm is based on the genetic …

The traveling salesman problem (TSP), and the quadratic assignment problem (QAP) are
two combinatorial optimization problems with a diverse set of applications. This research …

In recent years, there is a growing interest in swarm intelligent algorithms inspired by the
observation of the natural behavior of swarm to define a computational method, which may …

Abstract The Travelling Salesman Problem (TSP) is a known optimization problem by the
important number of its applications and its complexity (classified as NP-hard combinatorial …

The Shop scheduling problem is a class of scheduling problem used in different area
application as industry, characterized by a set of jobs that should be executed in determined …

Symbiotic organisms search algorithm (SOS) is a new meta-heuristic algorithm based on the
symbiotic relationship between the biological, which was proposed in recent years. In this …