基于禁忌搜索的三维装载车辆路径问题研究

Research on Vehicle Routing Problem with 3D Loading Constraints Based on Tabu Search

针对三维装载约束下的车辆路径问题(VRP),在考虑车辆容量、三维装载、物品装卸顺序、最小支持面和物品是否易碎等约束的情况下,提出一种求解该问题的禁忌搜索算法,其中包括2种三维装载算法、2种初始解构建算法、禁忌搜索邻域结构以及导向禁忌搜索机制。实验结果表明,该算法能够有效求解三维装载约束的VRP,且求解精度较高。

Aiming at the Vehicle Routing Problem（VRP） with 3D loading constraints,which contains the vehicle capacity restriction,3D restriction,loading sequence restriction,minimum supporting area and fragility restriction,an improved tabu search algorithm is presented for this problem,including two 3D loading algorithms,two initial solutions constructing algorithms,tabu search neighbor structure and guided tabu search mechanism.Experimental results show the algorithm can solve the problem efficiently.