首页> 外文期刊>Journal of Engineering & Applied Sciences >Impact of Meta-Heuristic Methods to Solve Multi-Depot Vehicle Routing Problems with Time Windows
【24h】

Impact of Meta-Heuristic Methods to Solve Multi-Depot Vehicle Routing Problems with Time Windows

机译:元启发式方法对带时间窗的多点车辆路径问题的影响

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Multi-Depot Vehicle Routing Problem with Time Windows (MDVRPTW) is a kind of NP-hard optimization problem which is described, as the problem of creating routes with optimum cost from one depot to a set of customer sites. Each customer has been visited just one time by only one vehicle within a proposed time interval, all routes start and finish at the same depot and the routes cannot violate the capacity constraints on the vehicles. This study addresses, the problem of multi depot vehicle routing in order to minimize the number of vehicles and the total travel cost. The proposed is a mixed integer programming model for the problem and provides a computable MDVRPTW in order to solve the problem; the genetic algorithm is the approach to this model.
机译:带时间窗的多站点车辆路径问题(MDVRPTW)是一种NP难的优化问题,它描述为创建从一个站点到一组客户站点的最优成本路线的问题。在建议的时间间隔内,只有一名车辆仅拜访过每个客户一次,所有路线都在同一仓库开始和结束,并且路线不会违反车辆的容量限制。这项研究解决了多仓库车辆路线选择的问题,以最大程度地减少车辆数量和总旅行成本。所提出的是用于该问题的混合整数规划模型,并且提供了可计算的MDVRPTW以解决该问题。遗传算法是该模型的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号