计算机工程与应用2016，Vol.52Issue(6)：242-247,6.DOI:10.3778/j.issn.1002-8331.1403-0350
同时取送货的三维装载约束下车辆路径问题
Simultaneous delivery and pickup vehicle routing problem with three-dimension ;loading constraints
摘要
Abstract
The Simultaneous Delivery and Pickup Vehicle Routing Problem with Three-Dimension Loading Constraints (3L-VRPSDP)is a variant of the classical Vehicle Routing Problem(VRP)where clients may require simultaneous pickups and deliveries, at the same time, cargo must consider its three dimensional size, first in last out, bottom support constraints. Considering the distribution characteristics, the loading algorithms based on Left Bottom(LB)and Maximum Contact Area (MCA)are proposed, and the corresponding tabu search algorithms are designed. Experiments are given to prove the validity of the algorithms.关键词
三维装载/车辆路径问题/禁忌搜索/先进后出Key words
three-dimension loading/vehicle routing problem/tabu search/First In Last Out(FILO)分类
信息技术与安全科学引用本文复制引用
彭碧涛,周世平..同时取送货的三维装载约束下车辆路径问题[J].计算机工程与应用,2016,52(6):242-247,6.基金项目
国家自然科学基金（No.71131003）；国家教育部人文社科基金（No.12YJC630148）；广州市科技计划基金（No.7421159402737）；广东外语外贸大学校级重点项目（No.15T26）。 （）
