首页> 外文会议>International Symposium on Neural Networks >A Sweep-Based TCNN Algorithm for Capacity Vehicle Routing Problem
【24h】

A Sweep-Based TCNN Algorithm for Capacity Vehicle Routing Problem

机译:一种基于扫描的电力路径问题TCNN算法

获取原文

摘要

A novel sweep-based transiently chaotic neural network (STCNN) algorithm for Capacity Vehicle Routing Problem (CVRP) is proposed. CVRP can be partitioned into two kinds of decisions: the selection of vehicles among the available vehicles and the routing of the selected fleet. The proposed algorithm first generates a number of routes that are served by vehicles and then solves the routes to optimality. Simulations show that the proposed algorithm produces excellent solutions in short computing times.
机译:提出了一种用于容量车辆路由问题(CVRP)的新型扫描的瞬态混沌神经网络(STCNN)算法。 CVRP可以分为两种决策:可用车辆中的车辆选择以及所选车队的路由。所提出的算法首先生成车辆服务的多个路由,然后解决了最优性的路由。模拟表明,该算法在短的计算时间内产生了出色的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号