首页> 外国专利> METHOD AND SYSTEM FOR FAST LOCAL SEARCH AND INSERTION HEURISTICS FOR VEHICLE ROUTING

METHOD AND SYSTEM FOR FAST LOCAL SEARCH AND INSERTION HEURISTICS FOR VEHICLE ROUTING

机译:车辆选路的快速本地搜索和插入启发式方法和系统

摘要

Methods and systems reduce vehicle travel time in a vehicle routing plan having vehicle routes which include vehicles and customers serviced by the vehicles, including executing cross-exchanges of the customers for combinations of vehicle routes in the vehicle routing plan. Executing cross-changes includes determining a travel time or time savings of executed cross-exchanges, saving a cross-exchange resulting in a minimal travel time or maximum travel time savings for vehicle route combinations, and modifying the vehicle routing plan by performing the saved cross-exchange resulting in the minimal travel time or maximum travel time savings until all vehicle route combinations are exhausted. The methods and systems may further reduce a number of vehicles in the vehicle routing plan including, eliminating one of the vehicles in the vehicle routing plan, and performing insertions of unrouted customers and exchanges of unrouted customers with routed customers. Performing insertions and exchanges of unrouted customers includes determining a minimum time delay or travel time savings for feasible insertions of an unrouted customer into a vehicle route, saving a feasible insertion of the unrouted customer into the vehicle route resulting in a minimum time delay or maximum travel time savings, determining the minimum time delay or maximum travel time savings for feasible exchanges of an unrouted customer into a vehicle route, saving a feasible exchange of the unrouted customer into the vehicle route resulting in a minimum time delay or maximum travel time savings, modifying the vehicle routing plan by performing the saved feasible insertion resulting in the minimum time delay or maximum travel time savings until all the unrouted customer to vehicle route combinations are exhausted, and modifying the vehicle routing plan by performing the saved feasible exchange resulting in the minimum time delay or maximum travel time savings until all the unrouted customer to vehicle route combinations are exhausted.
机译:方法和系统减少了具有车辆路线的车辆路线计划中的车辆行驶时间,该车辆路线包括车辆和由车辆服务的客户,包括执行客户的交叉交换以针对车辆路线计划中的车辆路线的组合。执行交叉路口包括确定行驶时间或已执行交叉路口节省的时间,保存交叉路口以节省车辆路线组合的最小行驶时间或最大行驶时间,以及通过执行保存的交叉路口来修改车辆路线计划-换乘会导致最少的旅行时间或最多的旅行时间节省,直到所有车辆路线组合都用尽为止。该方法和系统可以进一步减少车辆路线选择计划中的车辆的数量,包括,消除车辆路线选择计划中的车辆之一,并且执行未选择路线的顾客的插入以及未选择路线的顾客与被选择路线的顾客的交换。进行未路线客户的插入和交换包括确定最小时间延迟或节省旅行时间,以实现将未路线客户切实插入到车辆路线中,节省未路线客户到车辆路线中的可行插入,从而导致最小时间延迟或最大行程节省时间,确定将未路由客户转换为车辆路线的最小时间延迟或最大行驶时间,将未路由客户转换为车辆路线的可行转换,从而将时间延迟或最大行驶时间节省为最小,通过执行已保存的可行插入来实现车辆路线计划,从而节省最少的时间延迟或最大的旅行时间,直到所有未选择路线的客户到车辆路线组合用尽为止,并通过执行已保存的可行交换来修改车辆路线计划,从而使时间最短延迟或最大程度地节省旅行时间,直到一切放松客户到车辆的路线组合已用尽。

著录项

  • 公开/公告号US2010106539A1

    专利类型

  • 公开/公告日2010-04-29

    原文格式PDF

  • 申请/专利权人 RICHARD J. KENEFIC;

    申请/专利号US20080257152

  • 发明设计人 RICHARD J. KENEFIC;

    申请日2008-10-23

  • 分类号G06Q10/00;

  • 国家 US

  • 入库时间 2022-08-21 18:53:17

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号