A Line-up Competition Differential Evolution Algorithm for the Generalized Assignment Problem

This paper considers the generalized assignment problem (GAP). It is well-known NP-hard combinatorial optimization problem that is interesting in itself and also appears as a sub problem in other problems of practical importance. Line-up competition Differential Evolution algorithm for the GAP is proposed. The algorithm uses integer-coding structure, and introduces the idea of line-up competition. The experimental results indicates that, compared with other algorithms, this algorithm has the characteristics of quick convergence speed, of falling into local optimization rarely and of powerful optimization-searching ability and this algorithm can solve GAP effectively.