Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Katayama, Kengo; Narihisa, Hiroyuki

doi:10.1016/s0377-2217(00)00242-3

Cited by 79 publications

(49 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Table 2 discloses that our D 2 TS algorithm can stably reach all the previous best known results within 40 seconds on our computer, demonstrating the high efficiency of our method. Table 3 shows the average results of our D 2 TS algorithm compared with the five leading algorithms in the literature, respectively named ITS (Palubeckis (2006)), MST1 (Palubeckis (2004)), MST2 (Palubeckis (2004)), SA (Katayama and Narihisa (2001)) and MA (Merz and Katayama (2004)). The results of these five algorithms are extracted from (Palubeckis (2006)) and have been obtained by Palubeckis by applying each under the same experimental conditions, which we likewise employ for evaluating our algorithm.…”

Section: Computational Results On Orlib Instancesmentioning

confidence: 99%

“…Some representative examples include local search based approaches such as Simulated Annealing (Alkhamis et al (1998); Beasley (1998); Katayama and Narihisa (2001)) and Tabu Search (Glover et al (1998); Beasley (1998); Palubeckis (2004Palubeckis ( , 2006), populationbased approaches such as Evolutionary Algorithms (Lodi et al (1999); Merz and Freisleben (1999); Katayama et al (2000); Borgulya (2005)), Scatter Search (Amini et al (1999)) and Memetic Algorithms (Merz and Katayama (2004)). …”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Diversification-driven tabu search for unconstrained binary quadratic problems

Glover

Hao

2010

4OR-Q J Oper Res

View full text Add to dashboard Cite

This paper describes a Diversification-Driven Tabu Search (D 2 TS) algorithm for solving unconstrained binary quadratic problems. D 2 TS is distinguished by the introduction of a perturbation-based diversification strategy guided by long-term memory. The performance of the proposed algorithm is assessed on the largest instances from the ORLIB library (up to 2500 variables) as well as still larger instances from the literature (up to 7000 variables). The computational results show that D 2 TS is highly competitive in terms of both solution quality and computational efficiency relative to some of the best performing heuristics in the literature.

show abstract

Section: Computational Results On Orlib Instancesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Diversification-driven tabu search for unconstrained binary quadratic problems

Glover

Hao

2010

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

“….,b2500.10. These instances are frequently used in the literature by many authors, see for instance [6,24,36,37,40,41]. Note that the small test instances from the ORLIB whose sizes range from n=50 to 1000 and the similarly small instances from [16] are not considered here, since they present no challenge for the HMA algorithm.…”

Section: Test Instancesmentioning

confidence: 99%

“…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%

A hybrid metaheuristic approach to solving the UBQP problem

Glover

Hao

2010

European Journal of Operational Research

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

“…Hence, after each It iterations, k = k + 1. Equation (15) is not the only way to describe the cooling process, but one of the usual methods found in literature [6,17]. Besides the initial set of received bits b cMFB and the number of iterations G, the SA-MuD must be initialized with three more parameters: T 0 , δ, and It, which were empirically adjusted through a non-exhaustive attempt procedure [29].…”

Section: Simulated Annealing Mud For S/mimo Mc-cdmamentioning

confidence: 99%

S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

Abrão

Oliveira

Ciriaco

et al. 2009

Wireless Pers Commun

View full text Add to dashboard Cite

This paper analyzes the complexity-performance trade-off of several heuristic near-optimum multiuser detection (MuD) approaches applied to the uplink of synchronous single/multiple-input multiple-output multicarrier code division multiple access (S/MIMO MC-CDMA) systems. Genetic algorithm (GA), short term tabu search (STTS) and reactive tabu search (RTS), simulated annealing (SA), particle swarm optimization (PSO), and 1-opt local search (1-LS) heuristic multiuser detection algorithms (Heur-MuDs) are analyzed in details, using a single-objective antenna-diversity-aided optimization approach. MonteCarlo simulations show that, after convergence, the performances reached by all nearoptimum Heur-MuDs are similar. However, the computational complexities may differ substantially, depending on the system operation conditions. Their complexities are carefully analyzed in order to obtain a general complexity-performance framework comparison and to show that unitary Hamming distance search MuD (uH-ds) approaches (1-LS, SA, RTS and STTS) reach the best convergence rates, and among them, the 1-LS-MuD provides the best trade-off between implementation complexity and bit error rate (BER) performance.

show abstract

Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Cited by 79 publications

References 19 publications

Diversification-driven tabu search for unconstrained binary quadratic problems

Diversification-driven tabu search for unconstrained binary quadratic problems

A hybrid metaheuristic approach to solving the UBQP problem

S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization

Contact Info

Product

Resources

About