Heuristics for a bidding problem

Heuristics for a bidding problem

0.00 Avg rating0 Votes
Article ID: iaor20071539
Country: United Kingdom
Volume: 33
Issue: 8
Start Page Number: 2179
End Page Number: 2188
Publication Date: Aug 2006
Journal: Computers and Operations Research
Authors: , , ,
Keywords: optimization: simulated annealing, heuristics, artificial intelligence, sets
Abstract:

In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results show that the heuristic outperforms CPLEX and Casanova.

Reviews

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