首页> 外文会议>International Conference on Manufacturing Technology and Electronics Applications >Study on vehicle logistics routing path problem with time windows based on particle swarm optimization
【24h】

Study on vehicle logistics routing path problem with time windows based on particle swarm optimization

机译:基于粒子群优化的时间窗口车辆物流路径问题研究

获取原文

摘要

As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.
机译:作为世界经济的发展,如何实现合理的车辆物流路径问题与时间窗限制是促进现代物流业繁荣发展的关键问题。通过车辆物流路径路径的需求,粒子群与新型粒子呈现的优化旨在解决改进,有效和擅长正常车辆物流路由的问题。示例的仿真结果表明该算法具有更多的搜索速度和更强的优化能力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号