Mixed Differential Evolution Algorithm for the Multi-Objective 0–1 Programming Problem

Obtaining more non-dominated solution is very important for the multi-objective problem. This paper developed a new hybrid differential evolution algorithm for solving the multi-objective 0-1 programming problem, which is based on using the good point set method to generate the initial population, the traction method to deal with the constraint conditions, the analytic hierarchy process to design the weights between the objective functions. The proposed algorithm is not only improves the diversity of the population, but also overcomes the difficulty of choosing the penalty factor by the penalty function method. A number of typical multi-objective 0-1 programming problems are tested, and the test results are compared with other algorithms. The results show that the proposed algorithm can find more non-dominated solution for multi-objective 0-1 programming problems. It is an effective method to solve the multi-objective 0-1 programming problem.