Heuristics for a Bidding Problem
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.
Artificial intelligence, Bidding, Heuristics
Operations and Supply Chain Management
Computers and Operations Research
GUO, Yunsong; LIM, Andrew; RODRIGUES, Brian; and ZHU, Yejun.
Heuristics for a Bidding Problem. (2006). Computers and Operations Research. 33, (8), 2179-2188. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2564