Loading...

A Hybrid Simulated Annealing Algorithm For Winner Determination problem In Combinatorial Auction

Arab Momeni, Mojtaba | 2013

596 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 44904 (01)
  4. University: Sharif University of Technology
  5. Department: Indusrial Engineering
  6. Advisor(s): Kianfar, Farhad
  7. Abstract:
  8. One of the most important issues that an organization faced with is resource management. The proper resource management has the great rule in organization cost reduction. One of the most efficient processes in resource allocation is auction and there is different auction with different mechanism and goals. In an auction there is a set of items and a set of bids, and the task of auctioneer is matching items with suitable bids. Each bid consist of desirable items and the bidder value of that items. In an auction process, after mechanism design of auction and auction implementation we must identify the winners of auction and this is a hard problem even in simple auction.
    In this study we study combinatorial auction as one of the most efficient and effective auction and after modeling the problem , we try to solve this problem with different ways and finally we generate a mixed algorithm that considers topologic structure of an auction and then uses a simulated annealing algorithm to extract final solution. Result of implementation of this algorithm shows that this algorithm is a useful way to recognize winner determination problem of an auction, especially in problem with great size that exact algorithm isn’t able to find the solution in acceptable time
  9. Keywords:
  10. Resources Allocation ; Combinatorial Auction ; Heuristic Method ; Metaheuristic Method ; Simulated Annealing Method

 Digital Object List

 Bookmark

No TOC