CAJ | 학술논문

通信行业基站维护车辆的传统调度比较随意，日常维护没有全面的考虑到基站的次序和维护车辆行走路径的最小化问题。针对上述情况，借助遗传算法，提出一种由调度中心统一指挥，使代维公司多个驻点合理派发车辆，以最小路径和最佳次序遍历基站进行维护的方法。首先建立数学模型，然后根据模型的特点，采用整数排列编码，引入遗传算子，最后用MATLAB编程实现模型的求解。仿真结果验证了算法的可行性。
통신행업기참유호차량적전통조도비교수의，일상유호몰유전면적고필도기참적차서화유호차량행주로경적최소화문제。침대상술정황，차조유전산법，제출일충유조도중심통일지휘，사대유공사다개주점합리파발차량，이최소로경화최가차서편력기참진행유호적방법。수선건립수학모형，연후근거모형적특점，채용정수배렬편마，인입유전산자，최후용MATLAB편정실현모형적구해。방진결과험증료산법적가행성。
The traditional vehicle scheduling for base-station maintenance is fairly casual in the communi-cations industry,and not fully takes into account the order of base-station maintenance and the minimiza-tion of vehicle route. For the above,with the help of genetic algorithm, a maintenance method uniformly commanded by the dispatch center is proposed,thus enabling the multiple branches of communications to send vehicles reasonably, the vehicle to take the shortest path with optimal order, to traverse around all the alarm stations and provide service successfully. A mathematical model is firstly established,and based on the characteristics of the model, the genetic operator is introduced by integer arrangement code. Finally, the solution of the model is implemented by MATLAB programming. The simulation result indicates the feasibility of this algorithm.