基于文化基因算法的组合拍卖竞胜标决定问题研究

摘要

Combinatorial auctions winner determination problem is NP-hard. In order to solve this problem, a new algorithm named memetic algorithm (MA) was proposed. The results show that memetic algorithm in solving the problem with good stability, high quality solution, fast convergence and high computing efficiency, can improve efficiency of combinatorial auctions compare to genetic algorithm and simulated annealing algorithm.%针对组合拍卖竞胜标决定问题（WDP）这一NP难题，提出利用文化基因算法（Memetic Algorithm）对其进行求解。结果表明其在求解该问题上相比遗传算法、模拟退火算法具有稳定性好，求解质量高，收敛速度快，运算效率高的特点，能够提高组合拍卖的效率。