摘要
二维载重量限制的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.
出处
《广西师范学院学报（自然科学版）》
2012年第1期72-76,共5页
Journal of Guangxi Teachers Education University(Natural Science Edition)
关键词
2L-CVRP
货物装载问题
路由选择问题
装载算法
Ttwo-dimensional loading capacitated vehicle routing problem
goods loading problem
routing problem
loading algorithm
