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

Robot scheduling for pod retrieval in a robotic mobile fulfillment system

Gharehgozli, Amir*; Zaerpour, Nima
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW2020-10DOI: 10.1016/j.tre.2020.102087
51被引2阅读
引用收藏
分享

摘要

In order to increase the order picking efficiency, e-commerce retailers have started to implement order picking systems where mobile robots carry inventory pods to pick stations. In pick stations, pickers pick the products from inventory pods and put them in customer bins. In such a robotic mobile fulfillment center, pickers are constantly busy with picking customer orders and avoid non-value adding activities such as walking to reach storage locations. To fulfill customer orders, each robot needs to complete a sequence of missions and each mission includes a set of retrieval requests. We study the operational problem of scheduling a mobile robot fulfilling a set of customer orders from a pick station. The mobile robot needs to bring each pod from a retrieval location to the pick station and return the pod to a storage location. The objective is to minimize the total travel time of the robot which can be considered as a proxy for other objectives such a shorter lead time, higher throughput and less capital investment. We formulate the basic problem as an asymmetric traveling salesman problem. We then extend the model by adding general precedence constraints to give different priorities to customer orders based on their urgency (e.g. same-day, one-day, two-day, and standard orders). We also study a variation of the problem where the pod can be stored in multiple alternative locations. In this case, we model the problem as a generalized asymmetric traveling salesman problem. An adaptive large neighborhood search heuristic is developed to efficiently solve real size instances. The method outperforms the heuristics commonly used in practice.

学科与关键词

关键词
Distributione-commerce fulfillmentRobotic mobile fulfillment systemsTravel timeAsymmetric traveling salesman problem
相关
加载中…
  • Robots? picking efficiency and pickers? energy expenditure: the item storage assignment policy in robotic mobile fulfillment system
    Zhang, Jun*; Zhang, Ning; Tian, Lingkun; Zhou, Zijuan; Wang, PingCOMPUTERS & INDUSTRIAL ENGINEERING, 2023, 176: 108918.被引 7
  • A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems
    Baardman, Lennart*; Roodbergen, Kees Jan; Carlo, Hector J.; Schrotenboer, Albert H.Transportation Science, 2021, 55(5): 1151-1169.被引 8
  • Synchronized Deliveries with a Bike and a Self-Driving Robot
    Zhao, Yanlu; Cattaruzza, Diego; Kang, Ningxuan; Roberti, Roberto*Transportation Science, 2024, 58(1).被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
发表日期
2020-10
卷期
第 142 卷
页码
102087
DOI
10.1016/j.tre.2020.102087
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
1区
成果收录
SCIE

作者

  • G

    Gharehgozli, Amir (通讯) (第一作者)

  • Z

    Zaerpour, Nima

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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