首页 | 本学科首页   官方微博 | 高级检索  
     

CVRP中二维装载问题的研究
引用本文:刘阿宁,闭应洲,王仁民,胡卉颖. CVRP中二维装载问题的研究[J]. 广西师范学院学报(自然科学版), 2012, 29(1): 72-76
作者姓名:刘阿宁  闭应洲  王仁民  胡卉颖
作者单位:广西师范学院计算机与信息工程学院,广西南宁,530023
摘    要:二维载重量限制的VRP(2L-CVRP)问题是一种新的组合优化问题,是VRP问题的一个现实延伸。2L-CVRP问题中包含了物流配送中的两个子问题:装载问题和路由选择问题。很多VRP的研究,往往只致力于在路由选择方面进行优化,而忽略装载问题。针对这个问题,本文阐述了三种常用的装载算法,通过提高车辆装载率,减少车辆数目,从而降低成本。最后给出了三种算法的实验对比。

关 键 词:2L-CVRP  货物装载问题  路由选择问题  装载算法

The Two-dimensional Loading Problem for CVRP
LIU A-ning,BI Ying-zhou,WANG Ren-min,HU Hui-ying. The Two-dimensional Loading Problem for CVRP[J]. Journal of Guangxi Teachers Education University:Natural Science Edition, 2012, 29(1): 72-76
Authors:LIU A-ning  BI Ying-zhou  WANG Ren-min  HU Hui-ying
Affiliation:(College of Computer and Information Engineering,GuangxiTeachers Education University,Nanning,530023,China)
Abstract: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.
Keywords:Ttwo-dimensional loading capacitated vehicle routing problem  goods loading problem  routing problem  loading algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号