首页> 外文会议>Computer Applications in Industry and Engineering >A New GA Approach for the Vehicle Routing Problem
【24h】

A New GA Approach for the Vehicle Routing Problem

机译:车辆路径问题的一种新的遗传算法

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

摘要

This paper focuses on the study of Genetic Algo-rithm(GA) on Vehicle Routing Problem with Time Win-dows(VRPTW). It involves a fleet of vehicles with to service a set of customers with known demands and service-time windows. The objective is to find a set of feasible routes that minimizes the total costs. GA is capable of searching multiple search areas in a search space. This allows diversification in the process of its search. In this paper, a GA is implemented based on two newly devised operators, namely Alteration and E-Intersection operators.
机译:本文着重研究带有时间窗的车辆路径问题的遗传算法(GA)。它涉及一组车队,可为具有已知需求和服务时间窗口的一组客户提供服务。目的是找到一套使总成本最小化的可行路线。 GA能够在搜索空间中搜索多个搜索区域。这允许其搜索过程中的多样化。在本文中,GA是基于两个新设计的运算符(即变更和E交叉口运算符)实现的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号