A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the problem. We study the existing exact and non-exact approaches to the problem and analyze the performance of those approaches. W...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2005
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/594 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| id |
sg-smu-ink.lkcsb_research-1593 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.lkcsb_research-15932010-09-23T06:24:04Z A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem GUO, Yunsong LIM, Andrew RODRIGUES, Brian ZHU, Y. In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the problem. We study the existing exact and non-exact approaches to the problem and analyze the performance of those approaches. We compared our heuristic with the leading exact method CPLEX 8.0 solver and another non-exact algorithms Casanova using both the CATS test sets and test cases believed more difficult than CATS. Results show that the method is competitive with CPLEX 8.0 and obtains near optimal solutions for the CATS cases and up to 15% and 40% better solutions compared with CPLEX and Casanova, respectively, when the other instances were used. 2005-01-03T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/594 info:doi/10.1109/HICSS.2005.34 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Operations and Supply Chain Management |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Operations and Supply Chain Management |
| spellingShingle |
Operations and Supply Chain Management GUO, Yunsong LIM, Andrew RODRIGUES, Brian ZHU, Y. A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| description |
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the problem. We study the existing exact and non-exact approaches to the problem and analyze the performance of those approaches. We compared our heuristic with the leading exact method CPLEX 8.0 solver and another non-exact algorithms Casanova using both the CATS test sets and test cases believed more difficult than CATS. Results show that the method is competitive with CPLEX 8.0 and obtains near optimal solutions for the CATS cases and up to 15% and 40% better solutions compared with CPLEX and Casanova, respectively, when the other instances were used. |
| format |
text |
| author |
GUO, Yunsong LIM, Andrew RODRIGUES, Brian ZHU, Y. |
| author_facet |
GUO, Yunsong LIM, Andrew RODRIGUES, Brian ZHU, Y. |
| author_sort |
GUO, Yunsong |
| title |
A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| title_short |
A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| title_full |
A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| title_fullStr |
A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| title_full_unstemmed |
A Non-Exact Approach and Experimental Studies on the Combinatorial Auction Problem |
| title_sort |
non-exact approach and experimental studies on the combinatorial auction problem |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
2005 |
| url |
https://ink.library.smu.edu.sg/lkcsb_research/594 |
| _version_ |
1770569621638742016 |