• 论文 •    

不确定需求和能力约束下的多目标多工厂生产计划

苏生, 战德臣, 李海波, , 徐晓飞   

  1. 1.哈尔滨工业大学 计算机科学与技术学院企业智能计算研究中心,黑龙江哈尔滨150001;2.东北农业大学 工程学院,黑龙江哈尔滨150030
  • 出版日期:2007-04-15 发布日期:2007-04-25

Multiobjective production planning in multiplant environment with uncertain demand and capacity

SU Sheng, ZHAN Dechen, LI Haibo, XU Xiaofei   

  1. 1.Research Cent. of Intelligent Computing of Enterprises, Sch. of Computer S&T, Harbin Inst. of Tech., Harbin150001, China; 2.Sch. of Eng., Northeast Agricultural Univ., Harbin150030, China
  • Online:2007-04-15 Published:2007-04-25

摘要: 针对多个具有供需关系的制造工厂和多个地域分散的客户组成的供需网络,研究了不确定需求、生产能力和运输能力条件下的多周期多目标生产计划方法,决策变量为每个周期上工厂的生产计划及工厂间的运输计划,优化目标为最大化总利润与最大化任意客户的平均客户满意度。利用模糊数描述不确定参数,在建立问题的混合整数规划模型后,将此模糊数学模型转化为最大化满意度的加权和模型,并提出了禁忌搜索与后向启发式方法相融合的B-TS算法。计算实例证明,B-TS算法能够有效获得多目标多工厂生产计划。

关键词: 多工厂生产计划, 不确定需求, 不确定能力, 禁忌搜索, 后向启发式

Abstract: To deal with supplydemand network with manufacturing enterprises and distributed customers, a multiperiod, multiobjective production plnning problem with uncertain demand ,production capacity and transportation capacity was studied. The decision variables included the production plan of each enterprise and the transportation plan of each enterprise within each period. The objective function included maximization of the total profit and the average satisfaction level of all products for each customer. Fuzzy numbers were used to describe uncertain demand and capacity. A mixed integer programming model was constructed firstly. Then, the model was transformed into model whose objective function was maximum weighted sum of all objective functions in the original model. BTS search algorithm was developed combining taboo search procedure and backward heuristic to solve the model. Computation experiments demonstrated that BTS search procedure could effectively obtain solutions to multiobjective, multiplant production planning problems.

Key words: multiplant production planning, uncertain demand, uncertain capacity, taboo search, backward heuristic

中图分类号: