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

The study of joint order batching and picker routing problem with food and nonfood category constraint in online-to-offline grocery store

Zhang, Jun*; Zhang, Yanfang; Zhang, Xueyancent china normal univ
International Transactions in Operational Research2021-9DOI: 10.1111/itor.12926
7被引5阅读
引用收藏
分享

摘要

Order picking is the process of retrieving products from the storage locations to meet customer orders, which accounts for more than 55% of the total warehouse cost. The joint order batching and picker routing problem (JOBPRP) is an effective way to improve picking efficiency. Although many warehouses face the physical constraints of products that have impact on the picking sequence, such as weight, size, shape, and fragility, JOBPRP with such physical constraints has not been widely studied in the literature. This paper is inspired by a practical case observed in an online-to-offline grocery store in China, where food products should not be carried under nonfood products in the picking container to maintain food safety, called category constraint. Therefore, JOBPRP with category constraint is studied. The JOBPRP optimization models with and without category constraint are formulated to minimize the total processing time, and the modified seed algorithms, with new seed addition rules and modified near-optimal routing methods are proposed to solve the models. The performance of the proposed algorithms is evaluated in different seed addition rules, routing methods, sort time scenarios, and storage assignment strategies (SASs) in a case study. We found that considering category constraint in JOBPRP can reduce the total processing time, and the modified seed algorithms perform better than the traditional first-come-first-serve benchmark algorithms and the seed algorithms with traditional seed addition rules and S-shape routing method. The SASs where nonfood and food products are separately in fewer number of zones are recommended.

学科与关键词

关键词
warehouse managementorder pickingbatch&#8208routing problemcategory constraintseed algorithms
相关
加载中…
  • Considering pickers' learning effects in selecting between batch picking and batch-synchronized zone picking for online-to-offline groceries
    Zhang, Jun*; Zhang, Xueyan; Zhang, NingAPPLIED MATHEMATICAL MODELLING, 2023, 113: 358-375.被引 4
  • Order batching and sequencing for minimising the total order completion time in pick-and-sort warehouses
    Jiang, Xiaowei; Sun, Lijun*; Zhang, Yuankai; Hu, XiangpeiEXPERT SYSTEMS WITH APPLICATIONS, 2022, 187: 115943.被引 7
  • A Study on Online Scheduling Problem of Integrated Order Picking and Delivery with Multizone Vehicle Routing Method for Online-to-Offline Supermarket
    Zhang, Jun*; Zhang, Xueyan; Zhang, YanfangMATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021: 6673079.被引 6
查看全部 →

发表信息

论文状态
公开发表
期刊
International Transactions in Operational Research
发表日期
2021-09
卷期
第 28 卷, 第 5 期
页码
2440-2463
DOI
10.1111/itor.12926
语言
ENGLISH
期刊收录
NSL
期刊等级
3区
成果收录
SSCI · SCIE
资助标注
National Natural Science Foundation of China [71801105]; China Ministry of Education Social Sciences and Humanities Research Youth Fund Project [18YJC630242]; China Postdoctoral Science Foundation [2017M622488]

作者

  • Z

    Zhang, Jun (通讯) (第一作者)

    cent china normal univ

  • Z

    Zhang, Yanfang

    cent china normal univ

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

    Zhang, Xueyan

    cent china normal univ

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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