计算机工程2011，Vol.37Issue(11)：190-191,194,3.DOI:10.3969/j.issn.1000.3842.2011.11.065
基于禁忌搜索的三维装载车辆路径问题研究
Research on Vehicle Routing Problem with 3D Loading.Constraints Based on Tabu Search
摘要
Abstract
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.关键词
三维装载/车辆路径问题/禁忌搜索/禁忌表Key words
3D loading/ Vehicle Routing Problem(VRP)/ tabu search/ tabu table分类
交通工程引用本文复制引用
彭碧涛,周永务..基于禁忌搜索的三维装载车辆路径问题研究[J].计算机工程,2011,37(11):190-191,194,3.基金项目
国家自然科学基金资助项目(70971041) （70971041）
广东省软科学基金资助项目(2009B070300116) （2009B070300116）
广东高等院校学科建设专项基金资助项目"育苗工程" （）
2010年度广东外语外贸大学青年基金资助项目 （）
