多车次同时集散货物路线问题研究  

Simultaneous deliveries and pickups

作　　者：李建[1,2] 达庆利[2] 何瑞银[1] 

机构地区：[1]南京农业大学工学院,南京210031 [2]东南大学经济管理学院,南京210096

出　　处：《管理科学学报》2010年第10期1-7,62,共8页Journal of Management Sciences in China

基　　金：国家自然科学基金资助项目(7077205971001053);江苏省农机局基金资助项目(GXZ08002);徐州市科技计划资助项目(OPB028)

摘　　要：研究了配送车辆数和车辆工作时间内有限的多车次同时集散货物路线问题,以车辆数和运输里程最小为目标建立了多目标模型,提出了允许不可行解的禁忌搜索法.该方法能同时解决路线安排和路线分配的问题,其中路线安排采用了4种邻域搜索方法和重起策略,路线分配采用了初次分配和二次调整策略.算例分析表明,该方法能有效地找到满意解,且采用多车次安排路线比单车次安排路线更加经济合理.Multi-trip vehicle routing problem with simultaneous deliveries and pickups is studied,in which the number and working time of the vehicles are limited.Based on the minimum number and travel distance of vehicles,a multiobjective model is formulated.The tabu search algorithm allowing infeasible solutions is proposed,which can simultaneously solve two problems,that is,planning and assigning routes for vehicles.For planning routes,four neighborhood search methods and restart strategy are employed;initial routes and improved routes assignment are adopted for assigning routes.Computational results show that this algorithm is effective to search the satisfactory solutions and the multi-trip arrangement is more economic and reasonable than one-trip arrangement.

关 键 词：车辆路线问题 同时集散 多车次 禁忌搜索算法 

分 类 号：F505[经济管理—产业经济]