Solving unconstrained binary quadratic programming problem by global equilibrium search

被引：4

作者：

Shylo V.P. ^{[1
]}

Shylo O.V. ^{[2
]}

机构：

[1] V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv

[2] University of Pittsburgh, Pittsburgh

来源：

Cybernetics and Systems Analysis | 2011年 / 47卷 / 6期

关键词：

Approximate methods; Binary quadratic programming; Comparative analysis of algorithms; Computational experiment; Global equilibrium search;

D O I：

10.1007/s10559-011-9368-5

中图分类号：

学科分类号：

摘要：

A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in speed and solution quality. © 2011 Springer Science+Business Media, Inc.

引用

页码：889 / 897

页数：8

共 23 条

[11]

Glover F., Kochenberger G.A., Alidaee B., Adaptive memory tabu search for binary quadratic programs, Management Science, 44, 3, pp. 336-345, (1998)

[12]

Palubeckis G., Iterated tabu search for the unconstrained binary quadratic optimization problem, Informatica, 17, 2, pp. 279-296, (2006)

[13]

Alkhamis T.M., Hasan M., Ahmed M.A., Simulated annealing for the unconstrained quadratic pseudo-Boolean function, European Journal of Operational Research, 108, 3, pp. 641-652, (1998)

[14]

Katayama K., Narihisa H., Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, European Journal of Operational Research, 134, 1, pp. 103-119, (2001)

[15]

Lodi A., Allemand K., Liebling T.M., Evolutionary heuristic for quadratic 0-1 programming, European Journal of Operational Research, 119, 3, pp. 662-670, (1999)

[16]

Borgulya I., An evolutionary algorithm for the binary quadratic problems, Advances in Soft Computing, 2, pp. 3-16, (2005)

[17]

Katayama K., Tani M., Narihisa H., Solving large binary quadratic programming problems by an effective genetic local search algorithm, Proc. Genetic and Evolutionary Computation Conference (GECCO99), pp. 643-650, (2000)

[18]

Merz P., Freisleben B., Genetic algorithms for binary quadratic programming, Proc. Genetic and Evolutionary Computation Conference (GECCO99), pp. 417-424, (1999)

[19]

Merz P., Katayama K., Memetic algorithms for the unconstrained binary quadratic programming problem, BioSystems, 78, 1-3, pp. 99-118, (2004)

[20]

Amini M., Alidaee B., Kochenberger G.A., A scatter search approach to unconstrained quadratic binary programs, New Methods in Optimization, pp. 317-330, (1999)

← 1 2 3 →