【摘要】 组合拍卖能够提高拍卖的效率,还能降低竞标人的风险.但竞胜标确定问题是一个NP难题.在分析该问题特性的基础上,设计了一种嵌入优先适合启发式规则的混沌搜索算法.与传统算法相比,该算法具有实现方便,寻优效果好的优点.实例计算结果表明了算法在解决该问题的有效性和广阔的应用前景.更多还原

【Abstract】 Combinatorial auctions,i.e. , auction where bidders can bid on combination of items, is a very important application area in the electronic commerce nowadays. It tends to lead to more efficient allocations than traditional auctions in multi_item auctions, while keeping risks for bidders low. However, the winner determination problem in combinatorial auctions is NPhard. By the description of the problem and analysis of its characteristics, this paper proposes a FittingFirst heuristic embedded chaotic search algorithm. Comparing to the traditional algorithms, it is easy to operate and can get better results. The outcome indicates the efficiency and the wide application promise of the heuristic algorithm for solving this problem.更多还原