上海交通大学学报(自然版) ›› 2012, Vol. 46 ›› Issue (02): 269-275.

• 自动化技术、计算机技术 • 上一篇    下一篇

基于贪婪启发式的多期多目标动态网络选址

朱伟a,徐克林a,周炳海a,许金超b   

  1. (同济大学a. 机械工程学院; b. 电子与信息工程学院, 上海 201804 )  
  • 收稿日期:2011-01-10 出版日期:2012-02-28 发布日期:2012-02-28

Study on Multistage Multiobjective Network Location Problem Based on Greedy Heuristic Algorithm

 ZHU  Wei-a, XU  Ke-Lin-a, ZHOU  Bing-Hai-a, XU  Jin-Chao-b   

  1. (a. College of Mechanical Engineering; b. College of Electronics and Information, Tongji University, Shanghai 201804, China)
  • Received:2011-01-10 Online:2012-02-28 Published:2012-02-28

摘要: 为弥补现有选址模型考虑需求变化及客户满意度的不足,研究了随机需求环境下的配送中心选址并设计了衡量客户满意度的函数. 运用随机机会约束规划为基本建模工具,将模型设计拓展到多期规划决策领域并构建了动态多期多目标选址模型,模型不仅考虑了最小化配送中心运作成本,而且考虑了客户最大满意度;运用主要目标法将多目标选址模型转化为单目标选址模型,采用满意度高优先的客户指派原则设计了贪婪启发式求解算法. 算例结果表明,模型的非劣解包含了传统的以最小化物流成本为目标的选址模型的最优解,从而为配送中心选址提供更加灵活全面的决策依据.    

关键词: 贪婪启发式算法, 满意度高优先, 多期动态选址, 随机需求

Abstract: To remedy the defects for lack of consideration of the demand change and customer satisfaction in many existing location models, this paper studied the problem under demand uncertainty and established a function which can measure customer’s satisfaction. With stochastic chance constrained programming approach, the study was extended to multiperiod decision area and a dynamic multistage multiobjective location model for distribution center (DC) was proposed. The problem objective was assessed by considering not only minimizing the cost during planning period, but also maximizing the customer satisfaction. To solve the model, this paper introduced a greedy heuristic algorithm based on assignment priority with high customer satisfaction. The computation results show that the noninferior solutions include the optimal solution of conventional location model which only seeks for minimization logistics cost, this model offers a more flexible and comprehensive decision support to distribution center location problem.

Key words: greedy heuristic algorithm, priority with high satisfaction, dynamic multistage location, stochastic demand

中图分类号: