混合运输需求的车队车辆路线规划模型及算法  

Model for Vehicle Routing Plan with Mixed-Demand and Its Lasso Solution

作　　者：叶志坚[1] 杜文[1] 周荷芳[1] 

机构地区：[1]西南交通大学交通运输学院,四川成都610031

出　　处：《西南交通大学学报》2003年第3期341-344,共4页Journal of Southwest Jiaotong University

摘　　要：研究在物流中心车队投递货物到客户,且有货物回投物流中心、每一客户可被访问2次的车队路线规划问题 建立了车队车辆分配客户子集模型和车辆在分配后的客户子集中路线成本优化的索套启发式的解法.算例表明,该算法求出的路线计划方案的成本。When customers have a mixed demand for delivering and fetching goods, the solution can not be obtained using the traditional TSP (travelling salesman problem) algorithms because of the restraint of the demand for delivery and fetching and the capacity of vehicles. To solve this problem, a model of customer subset distribution is set up. Based on the customer subset distribution, the lasso solution is proposed to select the route with the minimum distribution cost.

关 键 词：车队运输 车辆路线规划 混合运输需求 客户子集分配模型 索套启发式解法 路线优化 

分 类 号：U116.2[交通运输工程] O221[理学—运筹学与控制论]