首页> 中文期刊> 《工业工程》 >考虑时间可靠度约束的4 PL 路径优化问题研究

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

         

摘要

运输时间的不确定性是影响第四方物流路径选择的重要因素。本文将可靠性理论应用到路径优化问题中,把客户对时间可靠度的要求作为约束条件,以运输总费用最小为目标,基于多重图建立考虑时间可靠度约束的第四方物流路径优化问题的机会约束规划模型,设计双列变长编码机制的遗传算法求解模型。通过仿真实例验证模型和算法的有效性,结果表明针对客户对时间可靠度要求的不同,该算法可以快速并有效地帮助决策者做出最优的路径选择。%Uncertainty on transportation time is an important aspect of the fourth party logistics (4PL) rou-ting 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 4 PL is set up .In this model , it takes the minimum cost as objective and the time reliability as constraint .By analyzing the characteris-tics 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.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号