One-pass heuristics for large-scale unconstrained binary quadratic problems

Glover, Fred; Alidaee, Bahram; Rego, César; Kochenberger, Gary A.

doi:10.1016/s0377-2217(01)00209-0

Cited by 54 publications

(43 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Cai, Wang, Yin, and Zhou (2011) combined with a one-pass mechanism. One obvious difference between the DDT alternatives proposed here and those proposed by Boros et al (1989) and Glover et al (2002) lies in the use of an r-flip local search procedure to improve solutions obtained by DDT constructions.…”

Section: Palubeckis and Tomkeviciusmentioning

confidence: 93%

“…Computational comparisons disclose the superiority of the multistart kflip local search combined with randomized greedy initial solutions. Glover, Alidaee, Rego, and Kochenberger (2002) propose several one-pass heuristics to advance the Devour Digest Tidy-up (DDT) method of Boros, Hammer and Sun (1989). Based on the hypothesis that setting multiple variables with value 1 or 0 in a pass may lead to worse performance, the idea is to guarantee only one variable gets the implied assignment in each pass.…”

Section: Heuristic and Metaheuristic Methodsmentioning

confidence: 99%

See 1 more Smart Citation

The unconstrained binary quadratic programming problem: a survey

Kochenberger¹,

Hao²,

Glover³

et al. 2014

J Comb Optim

Self Cite

357

182

View full text Add to dashboard Cite

Abstract:In recent years the unconstrained binary quadratic program (UBQP) has grown in importance in the field of combinatorial optimization due to its application potential and its computational challenge. Research on UBQP has generated a wide range of solution techniques for this basic model that encompasses a rich collection of problem types. In this paper we survey the literature on this important model, providing an overview of the applications and solution methods.

show abstract

Section: Palubeckis and Tomkeviciusmentioning

confidence: 93%

Section: Heuristic and Metaheuristic Methodsmentioning

confidence: 99%

The unconstrained binary quadratic programming problem: a survey

Kochenberger¹,

Hao²,

Glover³

et al. 2014

J Comb Optim

Self Cite

357

182

View full text Add to dashboard Cite

show abstract

“…By contrast, variants of metaheuristic algorithms have been extensively used to solve UBQP and shown to be effective to find high-quality solutions in an acceptable time. Some representative metaheuristic methods include local search based approaches, both direct [9] and using Simulated Annealing [3,6,24]; adaptive memory approaches based on Tabu Search [6,16,40,41]; population-based approaches such as Evolutionary Algorithms [7,25,32,35], Scatter Search [4] and Memetic Algorithms [37]; and specially designed one pass heuristics [17].…”

Section: Introductionmentioning

confidence: 99%

“…It is reasonable to think that a variable x i associated with large values of |q ii | and | n j=1 q ij | is more important than another variable associated with small values of these quantities. This idea is also in accordance with the spirit of the basic one-pass heuristic of [17]. In order to make things clearer, we make use of the following definitions: Definition 1.…”

mentioning

confidence: 99%

A hybrid metaheuristic approach to solving the UBQP problem

Glover

Hao

2010

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into the framework of evolutionary algorithms, the proposed approach exhibits several distinguishing features, including a diversification-based combination operator and a distance-and-quality based replacement criterion for pool updating. The proposed algorithm is able to easily obtain the best-known solutions for 31 large random instances up to 7000 variables (which no previous algorithm has done) and find new best solutions for 3 of 9 instances derived from the set partitioning problem, demonstrating the efficacy of our proposed algorithm in terms of both solution quality and computational efficiency. Furthermore, some key elements and properties of the HMA algorithm are also analyzed.

show abstract

“…The 0-1 Unconstrained Quadratic Optimization (UQO) is a relevant optimization problem which has been extensively dealt with in the literature (Glover et al 2002). However, to the best of our knowledge, this problem has not been analyzed before from the point of view of landscapes' theory.…”

mentioning

confidence: 99%

Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization

Chicano

Alba

2011

J Heuristics

View full text Add to dashboard Cite

Landscapes' theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a especial kind of landscape called elementary landscape. The elementary landscape decomposition of a combinatorial optimization problem is a useful tool for understanding the problem. Such decomposition provides an additional knowledge on the problem that can be exploited to explain the behavior of some existing algorithms when they are applied to the problem or to create new search methods for the problem. In this paper we analyze the 0-1 Unconstrained Quadratic Optimization from the point of view of landscapes' theory. We prove that the problem can be written as the sum of two elementary components and we give the exact expressions for these components. We use the landscape decomposition to compute autocorrelation measures of the problem, and show some practical applications of the decomposition.

show abstract

One-pass heuristics for large-scale unconstrained binary quadratic problems

Cited by 54 publications

References 13 publications

The unconstrained binary quadratic programming problem: a survey

The unconstrained binary quadratic programming problem: a survey

A hybrid metaheuristic approach to solving the UBQP problem

Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization

Contact Info

Product

Resources

About