Heuristics for a Brokering Set Packing Problem
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2004
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/2385 https://ink.library.smu.edu.sg/context/lkcsb_research/article/3384/viewcontent/GuoRodriguesAimath04.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |
| id |
sg-smu-ink.lkcsb_research-3384 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.lkcsb_research-33842018-07-09T07:55:22Z Heuristics for a Brokering Set Packing Problem GUO, Yunso LIM, Andrew Rodrigues, Brian ZHU, Yi 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. 2004-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/2385 https://ink.library.smu.edu.sg/context/lkcsb_research/article/3384/viewcontent/GuoRodriguesAimath04.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ 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, Yunso LIM, Andrew Rodrigues, Brian ZHU, Yi Heuristics for a Brokering Set Packing Problem |
| description |
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. |
| format |
text |
| author |
GUO, Yunso LIM, Andrew Rodrigues, Brian ZHU, Yi |
| author_facet |
GUO, Yunso LIM, Andrew Rodrigues, Brian ZHU, Yi |
| author_sort |
GUO, Yunso |
| title |
Heuristics for a Brokering Set Packing Problem |
| title_short |
Heuristics for a Brokering Set Packing Problem |
| title_full |
Heuristics for a Brokering Set Packing Problem |
| title_fullStr |
Heuristics for a Brokering Set Packing Problem |
| title_full_unstemmed |
Heuristics for a Brokering Set Packing Problem |
| title_sort |
heuristics for a brokering set packing problem |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
2004 |
| url |
https://ink.library.smu.edu.sg/lkcsb_research/2385 https://ink.library.smu.edu.sg/context/lkcsb_research/article/3384/viewcontent/GuoRodriguesAimath04.pdf |
| _version_ |
1770570231454892032 |