计算机工程与应用 ›› 2016, Vol. 52 ›› Issue (6): 242-247.

• 工程与应用 • 上一篇    下一篇

同时取送货的三维装载约束下车辆路径问题

彭碧涛1,周世平2   

  1. 1.广东外语外贸大学 思科信息学院,广州 510006
    2.华南理工大学 工商管理学院,广州 510641
  • 出版日期:2016-03-15 发布日期:2016-03-17

Simultaneous delivery and pickup vehicle routing problem with three-dimension loading constraints

PENG Bitao1, ZHOU Shiping2   

  1. 1.Cisco School of Informatics, Guangdong University of Foreign Studies, Guangzhou 510006, China
    2.School of Business Administration, South China University of Technology, Guangzhou 510641, China
  • Online:2016-03-15 Published:2016-03-17

摘要: 同时取货和送货的三维装载约束下车辆路径问题(3L-VRPSDP)是经典车辆路径问题(VRP)的一个扩展,在3L-VRPSDP中,顾客可能要求同时取货和送货,而且货物装载要考虑其三维大小、先进后出、底面支撑等装载特性。针对这类问题,提出了基于左底优先和最大接触面优先的装载算法,在装载时要考虑其配送特征;在此基础上,设计了对应的禁忌搜索算法对初始结果进行优化,通过实验验证了算法的有效性。

关键词: 三维装载, 车辆路径问题, 禁忌搜索, 先进后出

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)