Heuristic and Algorithm for Mixed Multi- Unit Combinatorial Auctions
JianCong Bai1, Zhong Ming
1School of Software
Available Online December 2008.
- 10.2991/jcis.2008.123How to use a DOI?
- multi-unit combinatorial auctions, winner determination problem, partheno-genetic algorithm, OR-bids, XOR-bids
Mixed multi-unit combinatorial auctions provide two types of bids as XOR-bids and OR-bids, which make them popular for resource allocation in marketplace. However, the problem of maximizing the revenue of auctioneers is a NP-complete problem. In this paper, we propose an improved partheno-genetic algorithm for solving this problem. The algorithm repeals crossover operators and implements the functions of crossover and mutation by partheno-genetic operators. New heuristics and a worst-removed operator are designed for improving the profit of the solution. Simulation results show that the algorithm has great searching speed and achieves good performance in large scale problems.
- © 2008, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - JianCong Bai AU - Zhong Ming PY - 2008/12 DA - 2008/12 TI - Heuristic and Algorithm for Mixed Multi- Unit Combinatorial Auctions BT - Proceedings of the 11th Joint Conference on Information Sciences (JCIS 2008) PB - Atlantis Press SP - 739 EP - 744 SN - 1951-6851 UR - https://doi.org/10.2991/jcis.2008.123 DO - 10.2991/jcis.2008.123 ID - Bai2008/12 ER -