考虑循环取货装车堆码的一种车辆路径问题研究

摘要

研究了某制造企业循环取货物流路径优化问题,根据弱异性小尺寸货物装车堆码特点,在装箱约束处理中通过"砌墙法"的有效简化处理,得到车辆容积和装车长度双容量约束的新型车辆路径问题模型,区别于已有带装箱约束的车辆路径问题.将不同货物作为单独的节点来处理,解决了通常需要需求可拆分路径问题才能解决的、节点需求量大于车辆容量的难题.运用遗传算法求解,松弛双容量的难约束,对该问题实际数据算例求得最终路径-装车结果.从结果解析、"砌墙"误差分析、相关问题比较和应用条件等方面验证了问题模型物流应用的可靠性和可行性.%A special vehicle routing problem with easy-to-implement loading scheme for route optimizing of a manufacturer's milk-run operations is proposed with focus on the loading and stacking of weak-heterogeneous small-sized cargos.A new model is formulated with dual capacity constraints on both volume and loading length by applying a wall-building method for cargo stacking inside the vehicle.It is a new variant of the Capacitated Vehicle Routing Problem with Loading Constraints.Besides, the node set is extended temporarily by treating each cargo as a different node, thus an affordable increase in solving time by the node extension is traded with way out the difficulty of node demand surplus vehicle capacity, rather by the method of Split Delivery Vehicle Routing Problem.With slack of the dual-capacity constraints, the fitness value is evaluated using the genetic algorithm, and comprehensive routing and loading results for two instances from real data are achieved.The results are examined with discussions on result analysis, error study of wall-building approximation, model comparison, application conditions, which suggest a sound reliability and feasibility of the model's application in logistics practice.