CAJ | 학술논문

针对物流部门中出现的时间窗和车辆限制的开放性车辆线路问题（open vehicle routing problem with time window and vehicle limits，m-OVRPTW），提出基于禁忌搜索算法的线路规划方案。对问题进行数学建模；通过设计4种邻域变化规则、设定多个禁忌长度来改进局部搜索，快速得到高质量近似解，解决m-OVRPTW问题；通过反复选取车辆数量，解决OVRPTW问题。用56组Solomon基准测试数据（VRPTW benchmark problem）进行测试，测试结果表明，将禁忌搜索算法应用在开放性车辆线路问题中取得了较好成果，其在最小车辆数量、最小车辆行程、平均车辆总行程等方面的表现都优于其它算法。
침대물류부문중출현적시간창화차량한제적개방성차량선로문제（open vehicle routing problem with time window and vehicle limits，m-OVRPTW），제출기우금기수색산법적선로규화방안。대문제진행수학건모；통과설계4충린역변화규칙、설정다개금기장도래개진국부수색，쾌속득도고질량근사해，해결m-OVRPTW문제；통과반복선취차량수량，해결OVRPTW문제。용56조Solomon기준측시수거（VRPTW benchmark problem）진행측시，측시결과표명，장금기수색산법응용재개방성차량선로문제중취득료교호성과，기재최소차량수량、최소차량행정、평균차량총행정등방면적표현도우우기타산법。
Time window for the logistics sector in open vehicles and restrictions on car lines (Open Vehicle Routing Problem With Time Window and Vehicle Limits,referred to as m-OVRPTW),the proposed routing scheme based on tabu search algorithms. Mathematical modeling issues first;then through four neighborhoods changed rules,setting more taboos-length to improve local search,fast access to high quality approximation to solve m-OVRPTW problems;by repeatedly selecting the number of vehicles, solve the OVRPTW problem;finally,the 5 6 Group Solomon benchmarking data (VRPTW Benchmark Problem)for testing,ex-perimental results show that Application of tabu search algorithm in an open vehicle wiring problems for better results compared with similar studies from the minimum number of vehicles,the minimum,average vehicle trips vehicle trips,and so have better than the other algorithms.