...
首页> 外文期刊>Journal of Theoretical and Applied Information Technology >A HYBRID ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND TARGET TIME
【24h】

A HYBRID ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND TARGET TIME

机译:具有时间窗和目标时间的车辆路径问题的混合算法

获取原文
           

摘要

The routing of a fleet of vehicles to service a set of customers is important in the field of goods distribution. Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial problem. This article aims at studying the vehicle routing problem with time windows and target time (VRPTWTT). VRPTWTT involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows as well as a target time. There are penalties associated with servicing either earlier or later than this target servicing time. The goal is to minimize the costs of transport and penalties of delay and ahead of time. Although VRPTWTT is a new variant of the VRP with time windows, the problem is not easy to solve, and it is also NP-hard. To solve the VRPTWTT, we propose a hybrid method combining Neighborhood search with Ant Colony Optimization Algorithm (ACO). Furthermore, when ACO is close to current optimal solution, neighborhood search is used to maintain the diversity of ACO and explore new solutions. First, we present a description of the hybrid method followed by computational results and the conclusion.
机译:在商品分配领域中,为一组客户服务的一组车辆的路线很重要。带时间窗的车辆路径问题(VRPTW)是众所周知的组合问题。本文旨在研究带有时间窗和目标时间(VRPTWTT)的车辆路径问题。 VRPTWTT涉及将容量有限的一组车辆从中央仓库路由到具有已知需求和预定义时间窗以及目标时间的地理位置分散的客户组。在此目标维修时间之前或之后都会有与维修相关的罚款。目标是最大程度地减少运输成本以及延迟和提前的罚款。尽管VRPTWTT是带有时间窗的VRP的新变种,但该问题不容易解决,并且也是NP难题。为了解决VRPTWTT问题,我们提出了一种将邻域搜索与蚁群优化算法(ACO)相结合的混合方法。此外,当ACO接近当前的最佳解决方案时,可以使用邻域搜索来维持ACO的多样性并探索新的解决方案。首先,我们介绍混合方法,然后给出计算结果和结论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号