Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
1-2004
Abstract
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.
Discipline
Operations and Supply Chain Management
Research Areas
Operations Management
Publication
Eighth International Symposium on Artificial Intelligence and Mathematics: January 4-6, 2004, Fort Lauderdale, Florida: Proceedings
First Page
1
Last Page
8
Publisher
AI&M
City or Country
Fort Lauderdale, FL
Citation
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.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/2385
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://rutcor.rutgers.edu/~amai/aimath04/AcceptedPapers/Guo-aimath04.pdf