Effective metaheuristic algorithms for the minimum differential dispersion problem

详细信息    查看全文

• 作者：Yang Wang^a ; ^{sparkle.wy@gmail.com} ; Qinghua Wu ; ^b ; ^{qinghuawu1005@gmail.com} ; Fred Glover^c ; ^{fredwglover@yahoo.com}
• 关键词：Metaheuristics ; Combinatorial optimization ; Dispersion problems ; Tabu search ; Memetic search
• 刊名：European Journal of Operational Research
• 出版年：2017
• 出版时间：1 May 2017
• 年：2017
• 卷：258
• 期：3
• 页码：829-843
• 全文大小：709 K
• 卷排序：258

文摘

Propose tabu search and memetic search for Minimum Differential Dispersion Problem. Tabu search employs a neighborhood decomposition candidate list strategy. Tabu search employs a rarely used solution-based tabu memory. Memetic search uses an innovative quality-distance guided crossover operator. Two algorithms yield better solutions for 181 (72.4%) of test problems.