A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage an

来源 :Chinese Journal of Mechanical Engineering | 被引量 : 0次 | 上传用户:theonezhaoq
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can’t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center. E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can’t fulfill the storage and picking demands of e-commerce sufficiently. In this The problem is that paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. at the same time, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is The main idea of ​​this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the Transportations of items which can not reach in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by com Puters show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h With the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.
其他文献
以改进的流形距离为相似度测度,结合人工蜂群算法,提出一种二阶段聚类算法.首先根据局部密度、最大最小距离和近邻选择对数据集初步归类并得到簇代表点;然后将聚类归属为优化
Conventional servomotor and stepping motor face challenges in nanometer positioning stages due to the complex structure, motion transformation mechanism, and sl
Most current studies about shield tunneling machine focus on the construction safety and tunnel structure stability during the excavation. Behaviors of the mach
Traditional modular design methods lead to product maintenance problems, because the module form of a system is created according to either the function require
Stenting is a very effective treatment for stenotic vascular diseases, but vascular geometries altered by stent implantation may lead to flow disturbances which
To address the difficulty in testing and calibrating the stress gradient in the depth direction of mechanical components, a new technology of nondestructive tes
The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem(TSP), which has been widely