In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...