基于连通可靠性的车辆路径问题  

Vehicle Routing Problem based on Connectivity Reliability

作　　者：唐连生[1] 程文明[1] 张则强[1] 梁剑[1] 

机构地区：[1]西南交通大学机械工程研究所,四川成都610031

出　　处：《铁道运输与经济》2007年第11期62-64,共3页Railway Transport and Economy

基　　金：四川省应用基础研究项目(04JY029-058-1);四川省科技攻关计划项目(2006Z08-037)

摘　　要：物流配送车辆路径问题(VRP)是一个NP-hard问题,很多求解方法仅考虑路网连通无穷大的情况,将其看成平均旅行时间问题,对于突发事件下造成路网拥堵情况下的车辆路径问题很少涉及,对此结合蚁群算法,对突发事件下各路段的连通可靠性进行比较后选择合适路段通过,用以提高路网的通行能力。Vehicle Routing Problem (VRP) is an NP-hard problem. Many solution issues only consider the situation of network featured by infinite connectivity and treat VRP as a problem of average travel time. Network connectivity reliability of the vehicle routing problem caused by emergency has been rarely involved. By use of ant colony algorithm, the connectivity reliability of different sections under emergency situations is compared and then a suitable route is suggested to pass over the congested sections and also the passing capacity of network could be increased.

关 键 词：物流配送 可靠性 蚁群算法 车辆路径 

分 类 号：O229[理学—运筹学与控制论] TP183[理学—数学]