首页> 外文会议>International conference on hybrid artificial intelligent systems >A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem
【24h】

A Novel Hybrid Algorithm for Solving the Clustered Vehicle Routing Problem

机译:一种求解车辆路径集束问题的新型混合算法

获取原文

摘要

This paper presents a new hybrid optimization approach based on genetic algorithm and simulated annealing for solving the clustered vehicle routing problem (CluVRP). The problem investigated in this paper is a NP-hard combinatorial optimization problem that generalizes the classical vehicle routing problem (VRP) and it is closely related to the generalized vehicle routing problem (GVRP). Preliminary computational results on two sets of benchmark instances are reported and discussed.
机译:本文提出了一种基于遗传算法和模拟退火算法的混合优化算法,用于解决车辆簇集路径问题。本文研究的问题是一个NP-hard组合优化问题,它概括了经典的车辆路径问题(VRP),并且与广义的车辆路径问题(GVRP)密切相关。报告和讨论了两组基准实例的初步计算结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号