三维装载约束的车辆路径问题的模拟退火算法  

Simulated Annealing Algorithm for Vehicle Routing Problem with Three-Dimensional Loading Constraints

作　　者：彭碧涛[1,2] 周永务[1] 

机构地区：[1]华南理工大学工商管理学院,广东广州510641 [2]广东外语外贸大学思科信息学院,广东广州510006

出　　处：《工业工程》2011年第5期71-74,共4页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(70971041);教育部人文社科一般项目(青年项目)(10YJC790339);2010年度广东外语外贸大学青年项目;广东省高校人文社科基地项目(08JDXM63003)

摘　　要：传统的车辆路径问题只考虑物品装载的质量属性约束,而忽略其他装载属性约束。针对这种情况,研究了三维装载约束的车辆路径问题,提出了三维装载的处理算法,基于模拟退火算法设计了一种两阶段启发式算法进行求解:第1阶段通过启发式算法得到初始解;第2阶段通过模拟退火算法对初始解进行改进,构造了测试集对结果进行验证。实验结果显示该算法是能够有效的求解该问题。In the classical vehicle routing problem, it considers the goods weight constraint only, but ignores other loading constraints, such as the loading space constraint. In this paper, the vehicle routing problem with three-dimensional loading constraint taken into account is addressed. A heuristic is proposed for goods loading such that the three-dimensional loading constraint is satisfied and optimized. Then, based on the heuristic, a simulated annealing algorithm is presented to solve the problem. A number of benchmark problems are used to test the proposed method. Results show the algorithm is effective.

关 键 词：三维装载 车辆路径问题 模拟退火 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]