纺织学报 ›› 2010, Vol. 31 ›› Issue (10): 146-150.

• 管理与信息化 • 上一篇    下一篇

基于MIP和AHP的服装批发供应链多目标规划

祝勇1,2;王正肖1,2   

  1. 1.浙江大学现代制造工程研究所 2. 浙江大学浙江省先进制造技术重点研究实验室
  • 收稿日期:2009-10-19 修回日期:2010-05-12 出版日期:2010-10-15 发布日期:2010-10-15
  • 通讯作者: 祝勇

Multi-objective programming in clothing wholesale supply chain based on MIP and AHP

ZHU Yong1,2 ;WANG Zhengxiao1,2

  

  1. 1.Institute of Manufacturing Engineering, Zhejiang University 2.Zhejiang Province Key Laboratory of Advanced Manufacturing Technology, Zhejiang University
  • Received:2009-10-19 Revised:2010-05-12 Online:2010-10-15 Published:2010-10-15
  • Contact: ZHU Yong

摘要:

在多级服装批发供应链中,存在系统总成本、送货时间、平均服务率等多个效益背反目标需要优化。为此,提出一种通过将混合整数规划(MIP)和层次分析法(AHP)有机结合起来解多目标规划的新方法。首先用MIP将多个目标按照重要性排序且要确定各个目标的最低可接受水平,将其作为限制条件,求出最高目标的最优值;然后以高级目标最优值作为限制,求出较低层次目标的最优值,逐步降低高级目标的限制,求出一系列的解,再将这一系列解用AHP进行评价排序,从而得到综合绩效最好的方案;最后将该方法应用于某服装批发供应链的多目标规划中,验证了其可行性。

Abstract:

To balance total cost, delivery time, and average service in clothing wholesale supply chain is an important decision. A new method to solve multi-objective programming (MOP) is proposed, which combines mixed integer programming (MIP) and analytic hierarchy process (AHP). First sequence multiple objects according to their importance and determine the lowest acceptable standard of each object, which is used as constraint and the optimal solution of the most important object is obtained, which is considered as restriction, then the optimal solution of subordinate object is obtained. By lowering the restriction of higher object step by step, these serial solutions are obtained. Then evaluating and sequencing the serial solutions by AHP, the synthetic optimal plan is got. This method is demonstrated by a multiple object programming in a three-tier clothing wholesale supply chain, verifies the efficiency of the proposed model and algorithm.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!