首页> 美国卫生研究院文献>Computational Intelligence and Neuroscience >Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem
【2h】

Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem

机译:车辆路径问题的改进分形空间填充曲线混合优化算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software 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 HOA.
机译:车辆路径问题(VRP)是现代物流系统优化中的关键问题之一。建立了带有硬窗的改进VRP模型,并提出了一种基于分形空间填充曲线(SFC)方法和遗传算法(GA)的混合优化算法(HOA)。通过合并提出的算法,SFC方法可以很快找到一个初始且可行的解决方案。 GA用于改善初始解决方案。此后,开发了实验软件,并研究了所罗门基准所进行的大量实验计算。实验结果证明了HOA的可行性和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号