求解物流运输网络SUM-MIN双目标路径问题的扩展标号法.pdfVIP

2016年9月 运筹学学报 第 20卷第3期 Sep., 2016 Operations Research ’Transactions Vol.20 No.3 DOI: 10.15960/ki.issn.1007-6093 却 16.03.013 求解物流运输网络SUM-MIN双目标路径问题的 扩展标号法＊ 韩世莲叫 摘要研究了物流运输网络SUM-MIN双目标路径问题．基于模糊规划方法提出了一种求 解SUM-MIN双目标路径问题的目标函数集成方法，以及集成后目标函数的扩展标号法．在 将双目标转化为单目标时，综合考虑了每个目标的边缘评价和两个目标的整体评价因素，通 过对每个目标分配的权重将决策者的偏好充分体现到决策过程中，采用广义的模糊目标集成 算子形成了相应的折衷规划模型．最后，通过实例对所提方法进行了说明． 关键词物流管理，模糊折衷模型，扩展标号法， SUM-MIN双目标路径问题 中图分类号 F224.3, C931.1 2010 数学分类号 05C76 An extended label correcting method for the SUM-MIN bi-criterion path problem in logistics transportation network* HAN Shilian1·t Abstract The paper concentrates on the SUM-MIN bi-criterion path problem in the logistics transportation network. An objective aggregation method based on the fuzzy compromise programming technique and an extended label correcting method to solve the aggregated objective are proposed. In the process of aggregating multiple objectives to a single one, the edge evaluation for each objective 创1d the overall evaluation for all the objectives are considered. By assigning the weights to each objective, the decision maker’s preference information can be integrated in this aggregation process, and the fuzzy compromise solution can be obtained with the generic aggregation method. Finally, a numerical example shows the solution process of the proposed approach. Keywords logistics management, fuzzy compromise programmi吨， extended label corr四ting method, SUM-MIN bi-criterion path problem Chinese Library Classification F224.3, C931.1