带有时间窗的虚拟场站接驳补货车辆路径问题  

The Linehaul-Feeder Vehicle Routing Problem with Time Windows and Virtual Depots

作　　者：谢桂芩[1,2] 杨玉华[3] 涂井先[4] 

机构地区：[1]广东工业大学应用数学学院,广东广州510520 [2]罗定中学,广东云浮527200 [3]广西工学院鹿山学院,广西柳州545616 [4]福州大学数学与计算机科学学院,福建福州350108

出　　处：《广东工业大学学报》2013年第1期61-67,72,共8页Journal of Guangdong University of Technology

基　　金：广东省自然科学基金资助项目(10251009001000002)

摘　　要：针对大区域多需求点的物流配送系统,在原有的车辆配送总费用为目标的基础上,兼顾顾客的满意度目标,建立了带有时间窗车辆路径问题的多目标最优化模型,该模型基于大小车沿途在虚拟场站接驳补货策略,节省了货车往返配送中心补货次数、距离与时间.根据该模型需要部分顾客作补货点的特点,利用K均值聚类的方法将顾客分类,采用基于分区域和极大极小策略的多目标进化算法思想进行求解,以测试题库The VRP Web中的算例进行测试分析.经由测试结果比较,相较于非接驳补货的传统VRPTW,该模型效益明显.On the basis that in original literature minimum vehicle scheduling cost was set as the only ob- jective, it sets the maximum customer satisfaction index as another objective, and proposes a mathemati- cal model for the linehaul-feeder multi-objective vehicle routing problem with time windows and virtual depots . The new model economizes the replenishment number of round trips, distance and time. K- means clustering method was applied to select some customers as the replenishment points, the problem was solved through the multi-objective evolutionary algorithm, based on sub-regions and the max-min strategy, and some instances were tested in the VRP web question bank. The experimental results show that the proposed model is more effective than the traditional non linehaul-feeder VRPTW.

关 键 词：虚拟场站 接驳补货 车辆路径问题 多目标优化 多目标进化算法 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]