【摘要】 从电子商务中的组合拍卖机理出发,以第一价格密封拍卖方式为背景,通过分析组合拍卖标的集和竞胜标确定的复杂性,给出了组合拍卖竞胜标确定问题的一般模型,并指出了该问题为离散组合优化问题·然后通过引入智能算法的思想,在遗传算法中采用单亲遗传算子和嵌入优先适合启发式规则,设计了求解该模型的优先适合启发式单亲遗传算法·计算实例表明,利用该算法求解竞胜标确定问题的最优解,算法实现简单,计算效果良好,且不需要复杂的交叉和变异等操作·更多还原

【Abstract】 Beginning with combinatorial auctions mechanisms in the electronic commerce,the complexity of the set of target and winner determination was analyzed on the background of the firstprice sealed auction. The general model of winner determination in combinatorial auctions was formulated. The model indicated that it was a problem on combinatorial optimization. By adopting parthenogenetic operators and embedding the FittingFirst heuristic rules,a parthenogenetic algorithm was presented on the basis of the ideas of heuristic algorithms. The algorithm is simple to apply and can achieve fine outcome to solve this problem without requiring complex operators of crossover and mutation.更多还原