首页 | 本学科首页   官方微博 | 高级检索  
     

多品种供应的多供应商选择模型及分解算法
引用本文:姚建明,蒲云,周国华,赵正佳. 多品种供应的多供应商选择模型及分解算法[J]. 西南交通大学学报, 2005, 40(4): 519-524
作者姓名:姚建明  蒲云  周国华  赵正佳
作者单位:西南交通大学经济管理学院,四川,成都,610031
基金项目:四川省重点科研计划项目(01GY051-26);本文的工作得到西南交通大学博士创新基金资助.
摘    要:
为解决供应链中多品种供应的多供应商选择问题,建立了以供应综合成本最低为目标函数、满足多个约束条件的组合优化模型.为解决求解的困难,采用变换分解算法,将原模型转换为整数规划问题.根据不同迭代方式,给出了2种基本运算步骤.在算例中运用模型和算法,得到了多物资供应环境下多供应商的最优任务分派.新方法克服了常规供应商的选择评价方法只针对单一物资供应过程和面向单一供应商选择过程的局限性.

关 键 词:多品种 供应 多供应商 选择 分解算法 供应链
文章编号:0258-2724(2005)04-0519-06
收稿时间:2004-06-16
修稿时间:2004-06-16

Multi-vendor Selection Model for Multi-product and Its Decomposing Algorithms
YAO Jian-ming,PU Yun,ZHOU Guo-hua,ZHAO Zheng-jia. Multi-vendor Selection Model for Multi-product and Its Decomposing Algorithms[J]. Journal of Southwest Jiaotong University, 2005, 40(4): 519-524
Authors:YAO Jian-ming  PU Yun  ZHOU Guo-hua  ZHAO Zheng-jia
Affiliation:School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China
Abstract:
To solve the multi-vendor selection problem in a muki-product supply chain, an optimization mode was constructed with the lowest composite cost taken as the objective function and with necessary constraints. A decomposing algorithm was used to overcome the difficulty in solving the model. The original model was transformed into an integer programming model. Based on different iteration procedure, two algorithms were presented. The model and algorithms were applied in a numeral example, and an optimized assignment of the products was obtained. The proposed method overcomes the limitation in the conventional vendor evaluation models where only single product or single vendor is considered.
Keywords:multi-product   supply   multi-vendor   selection   decomposing algorithm   supply chain
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号