首页> 外文会议>IEEE Workshop on complexity in engineering >Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm
【24h】

Solving the Capacitated Vehicle Routing Problem Using a Parallel Micro Genetic Algorithm

机译:用并行微观遗传算法求解车辆停行问题

获取原文

摘要

The Capacitated Vehicle Routing Problem (CVRP) is a very extensively studied combinatorial optimization problem that aimes to determine the order in which to visit a set of customers using a homogeneous fleet of vehicles based at a single depot so that the total travel cost is minimized. In this paper, a novel coarse-grained parallel micro genetic algorithm is used for solving CVRP while the conventional migration is replaced by a synchronously seeding the overall best solution to all search processes. The computational experiments examined the behaviour of the proposed approach.
机译:容量限制车辆路线问题(CVRP)是一项经过广泛研究的组合优化问题,旨在确定使用单个车场的同类车辆来拜访一组客户的顺序,从而使总旅行成本降到最低。在本文中,一种新颖的粗粒度并行微遗传算法用于求解CVRP,而常规迁移则由同步播种所有搜索过程的整体最佳解决方案代替。计算实验检查了所提出方法的行为。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号