×

Improved differential evolution algorithm for solving 0-1 programming problems. (Chinese. English summary) Zbl 1438.90240

Summary: A new intelligent optimization method – differential evolution algorithm is proposed to solve 0-1 programming problems. Firstly, the initial population is generated by using the good point set method, which greatly increases the diversity of the population. Then the traction method is used to deal with the constraint conditions. In this way, the evolving infeasible solution is gradually introduced into the feasible solution set. This overcomes the difficulty of selecting penalty factors by penalty function method. Ten 0-1 programming problems are tested, and the test results are compared with other algorithms. The results show that the proposed algorithm has faster searching ability and better global search ability. It is an effective way to solve the 0-1 programming problem.

MSC:

90C09 Boolean programming
90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite