首页> 外文会议>2010 international conference on digital enterprise and digital manufacturing. >Study on Optimization of Vehicle Routing Problem Based on Sierpinski Space Filling Curves
【24h】

Study on Optimization of Vehicle Routing Problem Based on Sierpinski Space Filling Curves

机译:基于Sierpinski空间填充曲线的车辆路径优化问题研究

获取原文
获取原文并翻译 | 示例

摘要

Vehicle Routing Problem (VRP) is one of the key issues on optimization of Modern logistics system. In this paper, a compositive mathematical model is established for VRP. Meanwhile a composite algorithm based on Sierpinski Space filling Curves (SFC) method and Or-opt algorithm is introduced. In this algorithm, Sierpinski SFC method can quickly get an initial and feasible solution, Or-opt algorithm is used to improve the initiatial solution. An experimental program was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the algorithm.
机译:车辆路径问题(VRP)是现代物流系统优化的关键问题之一。本文建立了VRP的综合数学模型。同时介绍了基于Sierpinski空间填充曲线(SFC)方法和Or-opt算法的复合算法。在该算法中,Sierpinski SFC方法可以快速获得初始可行的解,而Or-opt算法则用于改进初始解。开发了一个实验程序,并研究了所罗门基准所进行的大量实验计算。实验结果证明了该算法的可行性和有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号