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

基于MIP和AHP的服装批发供应链多目标规划
引用本文:祝勇,王正肖. 基于MIP和AHP的服装批发供应链多目标规划[J]. 纺织学报, 2010, 31(10): 146-150
作者姓名:祝勇  王正肖
作者单位:1.浙江大学现代制造工程研究所2. 浙江大学浙江省先进制造技术重点研究实验室
基金项目:国家高技术研究发展计划资助项目,浙江省科技计划重点项目 
摘    要:在多级服装批发供应链中,存在系统总成本、送货时间、平均服务率等多个效益背反目标需要优化。为此,提出一种通过将混合整数规划(MIP)和层次分析法(AHP)有机结合起来解多目标规划的新方法。首先用MIP将多个目标按照重要性排序且要确定各个目标的最低可接受水平,将其作为限制条件,求出最高目标的最优值;然后以高级目标最优值作为限制,求出较低层次目标的最优值,逐步降低高级目标的限制,求出一系列的解,再将这一系列解用AHP进行评价排序,从而得到综合绩效最好的方案;最后将该方法应用于某服装批发供应链的多目标规划中,验证了其可行性。

关 键 词:服装批发供应链;多目标规划;混合整数规划;层次分析法
收稿时间:2009-10-19;

Multi-objective programming in clothing wholesale supply chain based on MIP and AHP
ZHU Yong,WANG Zhengxiao. Multi-objective programming in clothing wholesale supply chain based on MIP and AHP[J]. Journal of Textile Research, 2010, 31(10): 146-150
Authors:ZHU Yong  WANG Zhengxiao
Affiliation:1.Institute of Manufacturing Engineering, Zhejiang University2.Zhejiang Province Key Laboratory of Advanced Manufacturing Technology, Zhejiang University
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.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《纺织学报》浏览原始摘要信息
点击此处可从《纺织学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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