@article{KATAYAMA-EJOR-2001,
title = {Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem},
author = {Kengo Katayama and Hiroyuki Narihisa},
url = {https://www.sciencedirect.com/science/article/pii/S0377221700002423},
doi = {https://doi.org/10.1016/S0377-2217(00)00242-3},
issn = {0377-2217},
year = {2001},
date = {2001-01-01},
urldate = {2001-01-01},
journal = {European Journal of Operational Research},
volume = {134},
number = {1},
pages = {103-119},
abstract = {The unconstrained binary quadratic programming problem (BQP) is known to be NP-hard and has many practical applications. This paper presents a simulated annealing (SA)-based heuristic for the BQP. The new SA heuristic for the BQP is based on a simple (1-opt) local search heuristic and designed with a simple cooling schedule, but the multiple annealing processes are adopted. To show practical performances of the SA, we test on publicly available benchmark instances of large size ranging from 500 to 2500 variables and compare them with other heuristics such as multi-start local search, the previous SA, tabu search, and genetic algorithm incorporating the 1-opt local search. Computational results indicate that our SA leads to high-quality solutions with short times and is more effective than the competitors particularly for the largest benchmark set. Furthermore, the values of new best-known solutions found by the SA for several large instances are also reported.},
keywords = {Heuristics, Large-size problems, Local search, Simulated annealing, Unconstrained binary quadratic programming problem},
pubstate = {published},
tppubtype = {article}
}
