Conference Proceeding Article
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results are compared with a recent heuristic algorithm and also with the CPLEX Integer Programming solver where we found that the simulated annealing approach outperforms the previous heuristic method and CPLEX obtaining results within smaller timescales.
Operations and Supply Chain Management
Eighth International Symposium on Artificial Intelligence and Mathematics: January 4-6, 2004, Fort Lauderdale, Florida: Proceedings
City or Country
Fort Lauderdale, FL
GUO, Yunso; LIM, Andrew; Rodrigues, Brian; and ZHU, Yi.
Heuristics for a Brokering Set Packing Problem. (2004). Eighth International Symposium on Artificial Intelligence and Mathematics: January 4-6, 2004, Fort Lauderdale, Florida: Proceedings. 1-8. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2385