An effective iterated tabu search for the maximum bisection problem

详细信息    查看全文

• 作者：Fuda Ma^a ; ^{ma@info.univ-angers.fr} ; Jin-Kao Hao ; ^a ; ^b ; ^{hao@info.univ-angers.fr} ; Yang Wang^c ; ^{yangw@nwpu.edu.cn}
• 关键词：Max-bisection ; Graph partition ; Multiple search strategies ; Tabu search ; Heuristics
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：May 2017
• 年：2017
• 卷：81
• 期：Complete
• 页码：78-89
• 全文大小：937 K
• 卷排序：81

文摘

Max-bisection is a challenging optimization problem with important applications. An iterated tabu search (ITS) is proposed based on two move operators (1-move and swap). Effective data structures using bucket sorting are used to streamline the computations. We report eight improved best solutions (new lower bounds) out of 71 benchmark instances.