Design of Cooperative Algorithms for Multi-objective Optimization: Application to the Flow-shop Scheduling Problem


Many methods have been established to solve optimization problems exactly or approximately. Nowadays, we can observe a growing interest about cooperative approaches between these methods. We present different cooperation schemes in order to classify the cooperatives approaches found in the literature. Then, we propose different cooperation mechanisms to solve a bi-objective Flow-shop problem. To solve approximatively this optimization problem, we propose an adaptive genetic algorithm in a first time. This algorithm is specialized to explore the search space, and to optimize automatically the parameters. Then, we propose cooperation scheme between this algorithm and other methods specialized in the intensification of the search. We propose cooperations with a memetic algorithm, a path relinking algorithm, and a bi-objective exact method.