工业工程 ›› 2014, Vol. 17 ›› Issue (4): 29-34.

• 专题论述 • 上一篇    下一篇

考虑时间可靠度约束的4PL路径优化问题研究

  

  1. (沈阳工业大学 1.管理学院; 2.理学院,辽宁 沈阳 110870)
  • 出版日期:2014-08-30 发布日期:2014-10-17
  • 作者简介:李佳(1983-),女,辽宁省人,博士研究生,主要研究方向为物流系统管理与工程.
  • 基金资助:

     国家自然科学基金资助项目(70431003);辽宁省科学技术计划资助项目(2013216015);沈阳市科学技术计划资助项目(F13-051-2-00),(F14-231-1-24)

A Research on Routing Optimization of Fourth Party Logistics with Time Reliability Constraint Considered


  1. (1. School of Management, Shenyang University of Technology, Shenyang 110870, China; 2. School of Science, Shenyang University of Technology, Shenyang 110870, China)
  • Online:2014-08-30 Published:2014-10-17

摘要: 运输时间的不确定性是影响第四方物流路径选择的重要因素。本文 将可靠性理论应用到路径优化问题中,把客户对时间可靠度的要求作为约束条件,以运输总费用最小为目标,基于多重图建立考虑时间可靠度约束的第四方物流路径优化问题的机会约束规划模型,设计双列变长编码机制的遗传算法求解模型。通过仿真实例验证模型和算法的有效性,结果表明针对客户对时间可靠度要求的不同,该算法可以快速并有效地帮助决策者做出最优的路径选择。

关键词: 第四方物流(4PL), 时间可靠度, 路径优化, 变长染色体遗传算法

Abstract:  Uncertainty on transportation time is an important aspect of the fourth party logistics (4PL) routing problem. Reliability theory is applied to routing optimization for this problem. Based on multi-graph, a chance constrained programming model for routing optimization problem of 4PL is set up. In this model, it takes the minimum cost as objective and the time reliability as constraint. By analyzing the characteristics of the problem, a messy genetic algorithm with double arrays encoding is developed. The performance of the algorithm is tested by examples. Experimental results demonstrate the significance of the model as well as the effectiveness of the proposed algorithm. According to the time reliability requirements of the customers, the algorithm can quickly and effectively provide the optimal solution to decision-makers.

Key words: fourth party logistics, time reliability, routing optimization, messy genetic algorithm