价值工程
價值工程
개치공정
VALUE ENGINEERING
2013年
31期
241-242
,共2页
组合拍卖%WDP文化基因算法%遗传算法%模拟退火
組閤拍賣%WDP文化基因算法%遺傳算法%模擬退火
조합박매%WDP문화기인산법%유전산법%모의퇴화
combinatorial auction WDP%memetic algorithm(MA)%genetic algorithm(GA)%simulated annealing algorithm(SA)
针对组合拍卖竞胜标决定问题（WDP）这一NP难题，提出利用文化基因算法（Memetic Algorithm）对其进行求解。结果表明其在求解该问题上相比遗传算法、模拟退火算法具有稳定性好，求解质量高，收敛速度快，运算效率高的特点，能够提高组合拍卖的效率。
針對組閤拍賣競勝標決定問題（WDP）這一NP難題，提齣利用文化基因算法（Memetic Algorithm）對其進行求解。結果錶明其在求解該問題上相比遺傳算法、模擬退火算法具有穩定性好，求解質量高，收斂速度快，運算效率高的特點，能夠提高組閤拍賣的效率。
침대조합박매경성표결정문제（WDP）저일NP난제，제출이용문화기인산법（Memetic Algorithm）대기진행구해。결과표명기재구해해문제상상비유전산법、모의퇴화산법구유은정성호，구해질량고，수렴속도쾌，운산효솔고적특점，능구제고조합박매적효솔。
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.
