东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2006, Vol. 27 ›› Issue (5): 575-578.DOI: -

• 论著 • 上一篇    下一篇

带时窗回程取货的车辆路径问题的算法

郭伏;隆颖;   

  1. 东北大学工商管理学院;东北大学工商管理学院 辽宁沈阳110004;辽宁沈阳110004
  • 收稿日期:2013-06-23 修回日期:2013-06-23 出版日期:2006-05-15 发布日期:2013-06-23
  • 通讯作者: Guo, F.
  • 作者简介:-
  • 基金资助:
    国家“十五”科技攻关项目(2001BA206A-4-1)

On the algorithm for VRPBTW (vehicle routing problem with backhauls and time windows)

Guo, Fu (1); Long, Ying (1)   

  1. (1) School of Business Administration, Northeastern University, Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2006-05-15 Published:2013-06-23
  • Contact: Guo, F.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

2100

摘要： 车辆路径问题如果考虑回程取货过程就可以在送货的过程中先后完成取货任务,比传统不考虑回程过程的问题更有实用性,基于此对传统问题进行了改进,不限制车辆的取送货顺序,而是设计了相应参数,避免了货物的重新排列·在确定目标时,综合考虑车辆运行成本、人员等待成本及服务成本等因素,实现目标解的真正可行·最后,根据此问题的特点,设计了先通过分枝定界法及遗传算法确定可行路线,再运用整数规划方法求解的算法,并以实例说明了算法的有效性·

关键词: 车辆路径问题, 时窗, 分枝定界法, 遗传算法, 整数规划, 可回程取货的车辆路径问题

Abstract: Taking backhaul into consideration in the haul process, the vehicle routing problem with time windows (VRPTW) becomes the vehicle routing problem with backhaul and time windows (VRPBTW), which is more practical than normal VRPTW. The new problem VRPBTW is therefore proposed to improve the VRPTW so as to get rid of the limitation of haul/backhaul sequence by designing some parameters corresponding to the sequence and available to avoid its rescheduling. Furthermore, the costs of vehicle running, handling/waiting time and other services are all taken into account in defining the objectives, thus providing a definite solution to those objectives. According to the features of the problem, an algorithm is proposed for VRPBTW, of which the routing is feasibly determined via the branch and bound and genetic algorithm and then a solution is given by use of integral programming. An instance is given to prove its validity.

中图分类号: