A modified VNS metaheuristic for max-bisection problems
A modified VNS metaheuristic for max-bisection problems
复制标题
针对最大二分问题的改进的 VNS 元启发式
DOI:
10.1016/j.cam.2007.08.018
复制
发表时间:
2008-10
影响因子:
2.4
通讯作者:
Ling, Ai-fan
中科院分区:
文献类型:
--
作者:
Tang, Le;Xu, Cheng-xian;Ling, Ai-fan
Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033–1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile that VNS metaheuristic is extended to solve max-bisection problems. Unfortunately, comparing with max-cut problems, max-bisection problems have more complicated feasible region via the linear constraint eTx=0. It is hard to directly apply the typical VNS metaheuristic to deal with max-bisection problems. In this paper, we skillfully combine the constraint eTx=0 with the objective function, obtain a new optimization problem which is equivalent to the max-bisection problem, and then adopt a distinct greedy local search technique to the resulted problem. A modified VNS metaheuristic based on the greedy local search technique is applied to solve max-bisection problems. Numerical results indicate that the proposed method is efficient and can obtain high equality solution for max-bisection problems.
登录
查看更多内容
影响因子:
1.1
作者:
Frieze, A;Jerrum, M
通讯作者:
Jerrum, M
影响因子:
1
作者:
E. Halperin;Uri Zwick
通讯作者:
E. Halperin;Uri Zwick
DOI:
10.1007/978-1-4615-1507-4
发表时间:
2002
期刊:
--
影响因子:
--
作者:
C. Ribeiro;P. Hansen
通讯作者:
C. Ribeiro;P. Hansen
DOI:
--
发表时间:
2005
期刊:
--
影响因子:
--
作者:
Feng-min;Xu;Cheng-xian;Hong-gang;Xue
通讯作者:
Feng-min;Xu;Cheng-xian;Hong-gang;Xue
DOI:
--
发表时间:
1997-06
期刊:
--
影响因子:
--
作者:
F. Alizadeh;J. Haeberly;M. V. Nayakkankuppa;M. Overton;S. Schmieta
通讯作者:
F. Alizadeh;J. Haeberly;M. V. Nayakkankuppa;M. Overton;S. Schmieta