Improved differential evolution algorithms for solving generalized assignment problem

作者：

Highlights：

• DE is first designed to solve generalized assignment problem (GAP).

• The possibility of using new local search in DE for GAP is designed in order to get better solution.

• The computational results revealed that the proposed heuristic lies among the best algorithms found in the literature.

摘要

•DE is first designed to solve generalized assignment problem (GAP).•The possibility of using new local search in DE for GAP is designed in order to get better solution.•The computational results revealed that the proposed heuristic lies among the best algorithms found in the literature.

论文关键词：Generalized assignment problem,Differential evolution algorithm,Shifting procedure,Exchange procedure

论文评审过程：Received 2 April 2015, Revised 8 October 2015, Accepted 9 October 2015, Available online 23 October 2015, Version of Record 10 November 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.10.009