计算机应用 ›› 2005, Vol. 25 ›› Issue (03): 682-684.DOI: 10.3724/SP.J.1087.2005/0682

• 典型应用 • 上一篇    下一篇

基于制造资源约束的供应链优化算法

李少波,谢庆生   

  1. 贵州大学CAD/CIMS工程技术中心
  • 发布日期:2005-03-01 出版日期:2005-03-01
  • 基金资助:

    国家 863计划项目(2003AA414013);;贵州工业大学博士基金资助项目(2003-002)

Supply chain optimal algorithm based on manufacturing resource limits

LI Shao-bo, XIE Qing-sheng   

  • Online:2005-03-01 Published:2005-03-01

摘要:

在基于ASP的网络化制造中,制造资源管理的目的是为了供应链的集成与优化,供应商的评价和选择是非常重要的。在研究基于制造资源约束的供应链关系的基础上,建立了基于制造资源约束的供应链优化数学模型。根据模型最优点应满足Karush Kuhn Tucker(KKT)一阶必要条件,考虑Lagrangian定理,提出了该问题在不同条件下的迭代求解算法。通过应用证明该方法算法效率高,在较少迭代次数时具有较好的收敛性。

关键词: 网络化制造, 制造资源约束, 供应链管理, KKT, 优化算法

Abstract:

This paper studied the supply chain optimal algorithm based on manufacturing resource limits, defined the mathematical model, established the first-order necessary conditions of Karush-Kuhn-Tucker (KKT) optimality for it. Considering the Lagrangian theorem, the iterative solution approaches in difference conditions were presented. Our computational testing indicates that both algorithms converge in a few iterations and are very efficient.

Key words: network manufacturing, manufacturing resource limits, supply chain management, Karush-Kuhn-Tucker(KKT), optimal algorithm

中图分类号: