Simulated annealing for the unconstrained quadratic pseudo-Boolean function

Simulated annealing for the unconstrained quadratic pseudo-Boolean function

0.00 Avg rating0 Votes
Article ID: iaor19993084
Country: Netherlands
Volume: 108
Issue: 3
Start Page Number: 641
End Page Number: 652
Publication Date: Aug 1998
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: quadratic
Abstract:

In this paper, we develop a simulated annealing (SA) based heuristic for the unconstrained quadratic pseudo-Boolean function. An algorithm that solves the problem in O(n2) at each temperature of the cooling schedule is given. The performance of SA based heuristic is compared with existing bounding algorithms for this problem. Computational results and comparisons on several hundred test problems demonstrate the efficiency of our heuristic in terms of solution quality and computational time. A new set of hard test problems with their best solution is provided to facilitate future comparison.

Reviews

Required fields are marked *. Your email address will not be published.