CAJ | 학술논문

研究了由一个分销中心、多个零售商组成的分销网络中运输单产品考虑货物权重的车辆路径问题(weighted vehicle routing problem, WVRP). 问题的目标是设计合理的路线最小化由于行驶距离,运输载重量及使用车辆而产生的总费用. 针对问题的特点,设计了求解WVRP问题的分散搜索算法(scatter search algorithm, SS),该算法基于客户进行编码,以基于最优划分过程的随机初始化作为多样性产生方法,通过对不同解包括的弧组合来生成新解,并用最近邻法对解进行改进. 分别采用了随机数据与标准数据对算法进行测试,并与其他求解该问题的算法进行了比较,说明了算法的有效性.
연구료유일개분소중심、다개령수상조성적분소망락중운수단산품고필화물권중적차량로경문제(weighted vehicle routing problem, WVRP). 문제적목표시설계합리적로선최소화유우행사거리,운수재중량급사용차량이산생적총비용. 침대문제적특점,설계료구해WVRP문제적분산수색산법(scatter search algorithm, SS),해산법기우객호진행편마,이기우최우화분과정적수궤초시화작위다양성산생방법,통과대불동해포괄적호조합래생성신해,병용최근린법대해진행개진. 분별채용료수궤수거여표준수거대산법진행측시,병여기타구해해문제적산법진행료비교,설명료산법적유효성.
In a distribution network with one warehouse and multiple retailers, a weighted vehicle routing problem ( WVRP) for transporting one kind of production is considered. The objective of the WVRP is to arrange a reasonable route so as to minimize the total cost of traveling cost, cost relating to cargo weight and dispatching cost. In the light of the characteristic of the problem, a scatter search (SS) algorithm is designed. The code of the algorithm is based on customers. The random initialization based on optimal splitting procedure is used as diversity generation method and a new solution is produced through the arc combination of different solutions. The solution is improved by using the nearest neighbor method. Through testing the data produced stochastically and the benchmark data, the results of the SS and other algorithms are contrasted. The results show the validity of the proposed SS algorithm