碩士 / 朝陽科技大學 / 資訊工程系 / 102 / With the advancement of technology, a variety of business models have been developed to improve the efficiency of business. Auction is one of them. There are many kinds of auction models. Combinatorial Double Auction, which will be studied in this thesis, is different from traditional auction models and allows a variety of combinations of goods and services to be included in a bid placed by buyers or sellers. The winners can acquire the desired combinations of goods, and the efficiency is much higher than traditional auction models. The existing researches do not take transportation cost into consideration in combinatorial double auctions. In terms of Winner Determination Problem (WDP), however, the computational complexity grows exponentially as the number of combinations of goods and the numbers of buyers and sellers grow. This paper aims to solve WDP. Due to the computational complexity of WDP, we adopt Lagrangian Relaxation (LR) technique to solve WDP problems. Then we calculate the winning bids and the flow of goods and adopt Subgradient method to update Lagrangian multipliers repeatedly. To deal with the solution that violates any of the constraint(s), we propose a heuristic algorithm to find a feasible solution. The proposed algorithm is then demonstrated by numerical examples to show that the proposed algorithm can find approximate solutions within accepted time.
| Identifer | oai:union.ndltd.org:TW/102CYUT0392027 |
| Date | January 2014 |
| Creators | Ko-Hsuan Wu, 吳克軒 |
| Contributors | Fu-Shiung Hsieh, 謝富雄 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 123 |
Page generated in 0.0014 seconds