CAJ | 학술논문

为了深入研究车辆路径问题中节约算法的应用，通过具体数据比较与分析了传统CW算法和改进后的分割节约算法得出的配送方案．发现针对C－W算法下运输车辆数目已经最优的情况，允许分割配送的节约算法反而增加了配送里程，路径交叉的情况却没有得到改善，因此此方法不再适用．因此，基于传统Clarke－Wright节约算法，对连接点进行选择来解决这一问题．通过matlab7．0对具体的实例进行了对比计算，用专业的制图和数据分析软件OriginPro 8．0画出配送路径图．结果表明，对连接点选择进行优化的节约算法不仅避免了路线交叉，且计算结果优于传统节约法．
위료심입연구차량로경문제중절약산법적응용，통과구체수거비교여분석료전통CW산법화개진후적분할절약산법득출적배송방안．발현침대C－W산법하운수차량수목이경최우적정황，윤허분할배송적절약산법반이증가료배송리정，로경교차적정황각몰유득도개선，인차차방법불재괄용．인차，기우전통Clarke－Wright절약산법，대련접점진행선택래해결저일문제．통과matlab7．0대구체적실례진행료대비계산，용전업적제도화수거분석연건OriginPro 8．0화출배송로경도．결과표명，대련접점선택진행우화적절약산법불부피면료로선교차，차계산결과우우전통절약법．
In order to study the saving algorithm in the application of vehicle routing problem , the paper analyzed the instance data of traditional savings algorithm and improved saving segmentation algorithm .Under the CW algorithm for the case , saving segmentation algorithm actually increases the distribution mileage and route crossed is not improved when the number of transport vehicles have been optimized to allow the distribution , so saving segmentation algorithm is no longer applicable .In this paper , the connection point selection saving algo-rithm approach to solving this problem .The calculation of specific examples was compared by matlab 7.0 and the distribution route map was drawn by a professional graphics and data analysis software OriginPro 8.0.The results show that the connection point selection saving algorithm can not only avoid the route cross , but also optimize the calculation results .