首页> 中文期刊>计算机集成制造系统 >基于车辆共享的软时间窗动态需求车辆路径问题

基于车辆共享的软时间窗动态需求车辆路径问题

     

摘要

为解决配送机构的乍辆有时不能满足客户需求的问题,同时降低物流配送成本,节约资源,基于产品服务系统的理念.引入车辆共享机制,结合时间窗、多配送中心和现代物流客户需求动态变化的特点,建立了基于车辆共享的软时间窗多配送中心动态需求车辆路径问题的两阶段数学模型,并设计了混合3-OPT量子进化算法对各阶段模型进行求解.通过算例测试及与其他算法进行比较,表明该算法能快速有效地求解此类动态需求的车辆路径问题.最后对影响算法性能的种群规模参数进行了分析.%The number of vehicles in today's distribution agencies could not always meet customers' demands.To reduce logistics cost and to conserve resources, mechanism of vehicle sharing based on the basic idea of Product Service System (PSS) was introduced to solve this problem.Combined with the classic time windows, multiple distribution centers and dynamically changing customers' demands in modern logistics, a two-phase mathematical model was presented for the dynamic demand Vehicle Routing Problem (VRP) with soft time windows based on vehicle sharing, and a Hybrid 3-OPT Quantum-Inspired Evolutionary Algorithm (HQEA) for these two models was designed.Computation tests and comparison to other algorithms were carried out, the results showed that this method could effectively solve a dynamic VRP.Finally, population size parameter to affect the performance of the algorithm was also analyzed.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号