IEEJ Transactions on Electronics, Information and Systems
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<Softcomputing, Learning>
An Iterated Greedy Algorithm for the Binary Quadratic Programming Problem
Takenori MurakamiFubito ToyamaKenji ShojiJyuichi Miyamichi
Author information
JOURNALS RESTRICTED ACCESS

2010 Volume 130 Issue 6 Pages 1089-1090

Details
Abstract

In this paper, Iterated Greedy algorithm with K-opt Local Search (IGKLS) is proposed for the binary quadratic programming problem (BQP). The proposed iterated greedy algorithm consists of two central phases, construction and destruction phases. As a local search algorithm, k-opt local search is applied after the construction phase. The computational results showed that the proposed iterated greedy algorithm outperformed state-of-the-art methods for huge size BQP instances.

Information related to the author
© 2010 by the Institute of Electrical Engineers of Japan
Previous article Next article
feedback
Top