CAJ | 학술논문

二维载重量限制的VRP（2L-CVRP）问题是一种新的组合优化问题,是VRP问题的一个现实延伸。2L-CVRP问题中包含了物流配送中的两个子问题：装载问题和路由选择问题。很多VRP的研究,往往只致力于在路由选择方面进行优化,而忽略装载问题。针对这个问题,本文阐述了三种常用的装载算法,通过提高车辆装载率,减少车辆数目,从而降低成本。最后给出了三种算法的实验对比。
이유재중량한제적VRP（2L-CVRP）문제시일충신적조합우화문제,시VRP문제적일개현실연신。2L-CVRP문제중포함료물류배송중적량개자문제：장재문제화로유선택문제。흔다VRP적연구,왕왕지치력우재로유선택방면진행우화,이홀략장재문제。침대저개문제,본문천술료삼충상용적장재산법,통과제고차량장재솔,감소차량수목,종이강저성본。최후급출료삼충산법적실험대비。
The two-dimensional loading problem for capacitated vehicle routing problem is a new combinatorial optimization problem,and it is a realistic extension of the well known vehicle routing problem.The two-dimensional loading problem for capacitated vehicle routing problem contains loading problem and routing problem.Researches for VRP often concentrate on the routing optimum and ignore the loading problem.In response to this problem,this paper introduces three popular loading algorithms,which improved vehicle loading rate,reduced the number of vehicles,and finally reduced the total cost.Lastly,this paper shows the results of the three algorithms.