检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080
出 处:《哈尔滨理工大学学报》2015年第2期80-84,共5页Journal of Harbin University of Science and Technology
摘 要:主要研究生产计划下的多级供应链伙伴之间的协调优化问题.在多阶段多项目约束生产批量问题模型的基础上,考虑关联约束及相关需求约束.对整个供应链的生产计划问题利用拉格朗日松弛算法将其分解为多个子问题.并应用自适应分布式算法更新内部价格来协调各成员之间的决策,实现了多级供应链批量生产问题的协调优化,以及较好的保证各成员隐私.实验分析证明了该策略在协调多级供应链生产计划问题具有优越性.This article mainly studied the optimization problem of multi-level supply chain production planning among partners' coordination. It is based on Multi-Level, multi-item Capacitated Lot-Sizing Problem model, and considered the constraints of association and constraints of related demand. Lagrangian relaxation algorithm was used for decomposing the entire supply chain production planning problem into multiple sub-problems. And adap- tive distributed algorithm was used for updating the internal prices to coordinate decision of members. It had coordi- nated and optimized a multi-level supply chain of production problems, also ensured the privacy of all members. The results show that the strategy has superiority in multi-level in supply chain coordination of manufacture planning problem.
分 类 号:TP399[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222