ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A Modified Brain Storm Optimization Algorithm for Solving Scheduling of Double-End Automated Storage and Retrieval Systems

Hu, Liduo; Geng, Sai; Zhang, Wei*; Yan, Chenhang; Hu, Zhi; Cai, Yuhang北京理工大学; 南京航空航天大学
2024-8DOI: 10.3390/sym16081068
2阅读
引用收藏
分享

摘要

As a product of modern development, logistics plays a significant role in economic growth with its advantages of integrated management, unified operations, and speed. With the rapid advancement of technology and economy, traditional manual storage and retrieval methods can no longer meet industry demands. Achieving efficient storage and retrieval of goods on densely packed, symmetrically shaped logistics shelves has become a critical issue that needs urgent resolution. The brain storm optimization (BSO) algorithm, introduced in 2010, has found extensive applications across various fields. This paper presents a modified BSO algorithm (MBSO) aimed at addressing the scheduling challenges of double-end automated storage and retrieval systems (DE-AS/RSs). Traditional AS/RSs suffer from slow scheduling efficiency and the current heuristic algorithms exhibit low accuracy. To overcome these limitations, we propose a new scheduling strategy for the stacker to select I/O stations in DE-AS/RSs. The MBSO incorporates two key enhancements to the basic BSO algorithm. First, it employs an objective space clustering method in place of the standard k-means clustering to achieve more accurate solutions for AS/RS scheduling problems. Second, it utilizes a mutation operation based on a greedy strategy and an improved crossover operation for updating individuals. Extensive comparisons were made between the well-known heuristic algorithms NIGA and BSO in several specific enterprise warehouse scenarios. The experimental results show that the MBSO has significant accuracy, optimization speed, and robustness in solving scheduling of AS/RSs.

学科与关键词

关键词
automated storage and retrieval system (AS/RS)modified brain storm optimization algorithm (MBSO)objective space clusteringgreedy strategy
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
发表日期
2024-08
卷期
第 16 卷, 第 8 期
页码
1068
DOI
10.3390/sym16081068
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China; [62003207]

作者

  • H

    Hu, Liduo (第一作者)

    shanghai univ engn sci

  • G

    Geng, Sai

    nanjing univ aeronaut & astronaut

查看全部 6 位作者收起作者
  • Z

    Zhang, Wei (通讯)

    shanghai univ engn sci

  • Y

    Yan, Chenhang

    beijing inst technol

  • H

    Hu, Zhi

    shanghai univ engn sci

  • C

    Cai, Yuhang

    shanghai univ engn sci

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417