供应链服务组合招标采购获胜者确定的优化算法研究  

Research on winning decision's optimizing algorithm for combinatorial bidding purchase of service in the supply chain

作　　者：马金麟[1] 钱丽娟[2] 刘志强[1] 

机构地区：[1]江苏大学汽车与交通工程学院,江苏镇江212013 [2]江苏大学理学院,江苏镇江212013

出　　处：《华中师范大学学报（自然科学版）》2011年第4期680-684,共5页Journal of Central China Normal University：Natural Sciences

基　　金：国家科技支撑计划课题(2007BAK35B02);江苏省研究生创新计划项目(CXZZ11_0577)

摘　　要：针对供应链中的核心企业需要对多项服务或产品进行组合招标采购的实际问题,进行了数学描述,提出了组合招标采购的优化思路.通过建立多个分散目标规划数学模型,并利用混合集合规划理论将数学模型中的约束条件巧妙地描述出来,继而引入欧几里得距离的概念对获胜者确定的问题进行优化算法设计与探讨,最终通过算例证明了研究方法的有效性及实用性.For the actual requirements of combinatorial purchase of service in the supply chain, the process of fuzzy Euclidean distance is presented in this paper, to solve the winning decision problem. The method uses mixed set programming to ingeniously describe all the relations and constraints in the decentralized object programming models which are different in orientation and dimension. The algorithm is designed and iterated for minimum distance to determine the last optimized solution. And the numerical exam- ple could perfectly prove the effectiveness and practicability of the algorithm study.

关 键 词：供应链 服务 组合招标采购 获胜者确定 优化算法 

分 类 号：F253.2[经济管理—国民经济] N945.2[自然科学总论—系统科学]