摘要
在应急救援车辆路径优化问题中,为了及时救援,缩短所有受灾点的总等待时间,提出了多车辆车场累积时间车辆路径问题。它是多个车场通过多个运输车队,使所有受灾点等待时间总和最短的运输问题。针对该NP难问题提出了一种Memetic算法求解。先用改进的最优切割算法MDVRP-Split将受灾点分配至各车场,通过选择、交叉及局部搜索得到最优路径。标准算例的测试结果表明,提出的算法注重了求解质量与求解效率的平衡。
In order to solve the path optimization problem of emergency rescue vehicles and the total waiting time of all affected places,this paper proposed multi-depot cumulative capacitated vehicle routing problem(MDCCVRP).It models transportation problems where the objective is to minimize the sum of arrival times at customers,by using multi-vehicles from multi-depots and taking into account capacity limitations.This paper proposes a memetic algorithm to solve this NP-hard problem.After the affected places are assigned to the depots reasonably by an improved optimal splitting algorithm MDVRP-Split,the optimal path is obtained after selection crossover and local search.Computational tests on some benchmark instances show that the proposed algorithm pays attention on the balance between solution quality and efficiency.
出处
《机电一体化》
2014年第A02期9-12,55,共5页
Mechatronics
基金
国家自然科学基金重大项目(71090404
71090400)
