摘要
同时取货和送货的三维装载约束下车辆路径问题(3L-VRPSDP)是经典车辆路径问题(VRP)的一个扩展,在3L-VRPSDP中,顾客可能要求同时取货和送货,而且货物装载要考虑其三维大小、先进后出、底面支撑等装载特性。针对这类问题,提出了基于左底优先和最大接触面优先的装载算法,在装载时要考虑其配送特征;在此基础上,设计了对应的禁忌搜索算法对初始结果进行优化,通过实验验证了算法的有效性。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2016年第6期242-247,共6页
Computer Engineering and Applications
基金
国家自然科学基金(No.71131003)
国家教育部人文社科基金(No.12YJC630148)
广州市科技计划基金(No.7421159402737)
广东外语外贸大学校级重点项目(No.15T26)
关键词
三维装载
车辆路径问题
禁忌搜索
先进后出
three-dimension loading
vehicle routing problem
tabu search
First In Last Out（FILO）
