计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2014年
2期
237-241
,共5页
王仁民%闭应洲%刘阿宁%李杰
王仁民%閉應洲%劉阿寧%李傑
왕인민%폐응주%류아저%리걸
动态车辆路径问题%变邻域搜索算法%变异机制%近邻优先原则
動態車輛路徑問題%變鄰域搜索算法%變異機製%近鄰優先原則
동태차량로경문제%변린역수색산법%변이궤제%근린우선원칙
Dynamic Vehicle Routing Problem(DVRP)%variable neighbourhood search heuristics%mutation mecha-nism%neighbor priority principle
针对动态车辆路径问题DVRP(Dynamic Vehicle Routing Problem)的优化问题,提出一种改进算法。该算法在分析路径寻优问题的局部特性的基础上,利用变邻域搜索算法VNS(Variable Neighbourhood Search)对路径空间进行“局部探索”,结合变异机制对路径空间进行“全局开采”,最后根据近邻优先原则将动态路径片段安插到适宜的路径中。实验结果验证了算法的有效性。
針對動態車輛路徑問題DVRP(Dynamic Vehicle Routing Problem)的優化問題,提齣一種改進算法。該算法在分析路徑尋優問題的跼部特性的基礎上,利用變鄰域搜索算法VNS(Variable Neighbourhood Search)對路徑空間進行“跼部探索”,結閤變異機製對路徑空間進行“全跼開採”,最後根據近鄰優先原則將動態路徑片段安插到適宜的路徑中。實驗結果驗證瞭算法的有效性。
침대동태차량로경문제DVRP(Dynamic Vehicle Routing Problem)적우화문제,제출일충개진산법。해산법재분석로경심우문제적국부특성적기출상,이용변린역수색산법VNS(Variable Neighbourhood Search)대로경공간진행“국부탐색”,결합변이궤제대로경공간진행“전국개채”,최후근거근린우선원칙장동태로경편단안삽도괄의적로경중。실험결과험증료산법적유효성。
Due to the optimization problem of dynamic vehicle routing problem, an improved algorithm for DVRP (Dynamic Vehicle Routing Problem)is proposed. Based on analyzing local features of routing optimization problem, the method uses variable neighbourhood search heuristics to explore, and combines mutation mechanism to exploit. The dynamic routing blocks are inserted into vehicles according to neighbor priority principle. Experimental results show that the improved algorithm is effective.