检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李应[1]
出 处:《运筹与管理》2012年第4期52-58,共7页Operations Research and Management Science
基 金:国家社会科学青年基金资助项目"关系契约理论在我国企业管理中的应用与发展研究"(10CGL024);合肥工业大学博士学位专项基金资助项目(2010HGBZ0547)
摘 要:针对由制造商、分销中心和零售商组成的多级分布式供应链协同计划问题,建立了三层规划生产-分销计划谈判模型,设计了基于合作对策的两步协商方法。首先,基于模糊隶属度原理,将三层规划问题转化为单层规划问题。接着,设计了基于合作对策的两步协商过程,描述了两步协商模型和交互协商算法步骤,并对算法进行了性能分析。最后,给出了基于多层规划的协同生产-分销计划模型,并得到了基于合作对策的协商算法的解决方案。并通过与其它优化策略的对比,验证该解决方案的优越性。For a multi-echelon distributed supply chain consisting of a manufacturer, a distribution center and a retailer, we propose the two-step interactive negotiation method on the principle of cooperative game theory. The existing mathematical models built for distributed supply chain, have the deficiencies of bad-quality solution or requiring much information. The paper applies cooperative game theory to collaborative plan problem. For 3-ech-elon supply chain collaborative plan, the two-step interactive negotiation algorithm is designed. The negotiation models are described in detail, and the negotiation processes as well. Firstly, the tri-level programming model is transformed into single level programming problem. Emphatically, the second step negotiation model is built on Nash bargaining approach, with the stack restrictions by relaxing the trade-off satisfying degree obtained in the first step. The designed method is applied to solve a 3-echelon supply chain production-distribution problem. The experimental results show that the algorithm has better performance than other optimization algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.128.190.174