Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (Q537995)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems |
scientific article |
Statements
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (English)
0 references
23 May 2011
0 references
Summary: We provide a method for efficiently evaluating two-flip moves that simultaneously change the values of two 0-1 variables in search methods for binary unconstrained quadratic optimisation problems (UQP). We extend a framework recently proposed by the authors for creating efficient evaluations of one-flip moves to yield a method requiring significantly less computation time than a direct sequential application of one-flips. A tabu search algorithm that combines one-flip and two-flip moves, in a study currently in process, has made use of this extension to produce very competitive results on some UQP benchmark instances.
0 references
zero-one optimisation
0 references
unconstrained quadratic programming
0 references
metaheuristics
0 references
computational efficiency
0 references
two-flip moves
0 references
tabu search
0 references