A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm

A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm

0.00 Avg rating0 Votes
Article ID: iaor19971539
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 129
End Page Number: 150
Publication Date: May 1996
Journal: Annals of Operations Research
Authors: , ,
Keywords: optimization: simulated annealing
Abstract:

0-1 problems are often difficult to solve. Although special purpose algorithms (exact as well as heuristic) exist for solving particular problem classes or problem instances, there are few general purpose algorithms for solving practical-sized instances of 0-1 problems. This paper deals with a general purpose heuristic algorithm for 0-1 problems. In this paper, the authors compare two methods based on simulated annealing for solving general 0-1 integer programming problems. The two methods differ in the scheme used for neighbourhood transitions in the simulated annealing framework. The authors compare the performance of the two methods on the set partitioning problem.

Reviews

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