两阶段反向组合多属性拍卖分包算法  

A two-stage bundle algorithm of reverse combinatorial multi-attribute auction

作　　者：呼大永[1] 冯玉强[1] 

机构地区：[1]哈尔滨工业大学信息管理与信息系统研究所,黑龙江哈尔滨150001

出　　处：《哈尔滨工程大学学报》2010年第12期1649-1654,共6页Journal of Harbin Engineering University

基　　金：黑龙江省自然科学基金重点资助项目(zd200803-01)

摘　　要：针对反向拍卖中根据物品部件分解情况"分包"的方式不能保证包内"高相似性"与供应商之间"高竞争性"的问题,采用"先分包、后拆包"的两阶段反向组合多属性拍卖分包算法以降低胜者确定问题算法复杂度,"分包"阶段保证了包内物品的相似度,"拆包"阶段保证了供应商之间的竞争性.在求解胜者确定问题时,可利用在供应商投标后通过该算法生成的"分包"对投标进行约减以降低算法复杂度,并能有效降低主观性对分包质量的影响,从而降低采购成本.该算法为反向组合多属性拍卖WDP问题的解决提出了新的思路.In order to solve the winner decision problem（WDP） for reverse auction,the former research concerning bundle algorithms builds the bundle hierarchy with the decomposition of the procured goods.However,it cannot guarantee high similarity within every bundle and high competition among the suppliers,and does not effectively reduce the cost.A two-stage approach——bundling first followed by unpacking——was proposed for online combinatorial multi-attribute reverse auction to distinguish the bids among the tenders with bundles and reduce the complexity of WDP algorithms,diminishing the subjectivity.This algorithm ensures the similarity of goods within the bundles,as well as competition among suppliers.This approach provides new ideas for the solution of the combinatorial multi-attribute reverse auction WDP problems.

关 键 词：反向拍卖 胜者确定问题 分包 组合多属性拍卖 

分 类 号：F270.7[经济管理—企业管理]