版权说明 操作指南
首页 > 成果 > 详情

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

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Zhang, Jun*;Zhang, Yanfang;Zhang, Xueyan
通讯作者:
Zhang, Jun
作者机构:
[Zhang, Yanfang; Zhang, Jun; Zhang, Xueyan] Cent China Normal Univ, Sch Informat Management, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Zhang, Jun] C
Cent China Normal Univ, Sch Informat Management, Wuhan 430079, Hubei, Peoples R China.
语种:
英文
关键词:
warehouse management;order picking;batch‐routing problem;category constraint;seed algorithms
期刊:
International Transactions in Operational Research
ISSN:
0969-6016
年:
2021
卷:
28
期:
5
页码:
2440-2463
基金类别:
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [71801105]; China Ministry of Education Social Sciences and Humanities Research Youth Fund Project [18YJC630242]; China Postdoctoral Science FoundationChina Postdoctoral Science Foundation [2017M622488]
机构署名:
本校为第一且通讯机构
院系归属:
信息管理学院
摘要:
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 ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com