首页> 外文期刊>Mathematical Problems in Engineering >Algorithms for Pallet Building and Truck Loading in an Interdepot Transportation Problem
【24h】

Algorithms for Pallet Building and Truck Loading in an Interdepot Transportation Problem

机译:仓库间运输问题中的托盘构建和卡车装载算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper deals with the problem of a logistics company that has to serve its customers by first putting the products on pallets and then loading the pallets into trucks. Besides the standard geometric constraints of products not overlapping each other and not exceeding the dimensions of pallets and trucks, in this real problem, there are many other constraints, related to the total weight of the load, the maximum weight supported by each axle, and the distribution of the load inside the truck. Although the problem can be decomposed into two phases, pallet loading and truck loading, we have taken a combined approach, building and placing pallets at the same time. For each position in the truck, a pallet is built and tailored for that position according to the constraints of height and weight. We have developed a GRASP algorithm, in which the constructive algorithmis randomized and an improvement phase is added to obtain high-quality solutions. The algorithm has been tested on two sets of real instances with different characteristics, involving up to 44 trucks. The results show that solutions with an optimal or near optimal number of trucks are obtained in very short computing times.
机译:本文处理的是物流公司必须先将产品放在托盘上,然后再将托盘装到卡车中来为其客户提供服务的问题。除了产品的标准几何约束不相互重叠且不超过托盘和卡车的尺寸外,在这个实际问题中,还有许多其他约束,涉及负载的总重量,每个轴支撑的最大重量以及卡车内部的负载分配。尽管可以将问题分解为两个阶段,即托盘装载和卡车装载,但我们采取了一种组合方法,即同时构建和放置托盘。对于卡车中的每个位置,都会根据高度和重量的限制为该位置构建并定制一个托盘。我们已经开发了GRASP算法,在该算法中,将建设性算法随机化,并添加了一个改进阶段以获得高质量的解决方案。该算法已在两组具有不同特征的真实实例上进行了测试,涉及多达44辆卡车。结果表明,可以在非常短的计算时间内获得具有最佳或接近最佳数量的卡车的解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号