Abdelhamid Bouzidi

Learn More
This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu and Tsai for optimization problems in the continuous case. To solve TSP, which is a discrete problem, we will describe the various operators and operations performed in two(More)
Flow shop problem is a NP-hard combinatorial optimization problem. Its application appears in logistic, industrial and other fields. It aims to find the minimal total time execution called makespan. This research paper propose a novel adaptation never used before to solve this problem, by using computational intelligence based on cats behavior, called Cat(More)
  • 1