Skill-Based Joint Order Batching and Picker Routing Problem

J. Jamal, Dominic Loske, M. Klumpp, Xiaochen Chou, Andrea Di Florio Di Renzo, M. dell’Amico, R. Montemanni
{"title":"Skill-Based Joint Order Batching and Picker Routing Problem","authors":"J. Jamal, Dominic Loske, M. Klumpp, Xiaochen Chou, Andrea Di Florio Di Renzo, M. dell’Amico, R. Montemanni","doi":"10.1145/3523132.3523143","DOIUrl":null,"url":null,"abstract":"The problem of batching orders and routing orders in picker-to-parts warehouses is intensively studied in the research literature, but the impact of individual differences among pickers or forklift operators and their skills are rarely taken into consideration. Therefore, we propose a model that simultaneously does order batching and routing while taking advantage of the skills of each worker. This approach optimizes the total batch execution time, and reduces the physical and mental effort of workers, since they are likely to perform easy tasks according to their capabilities. Based on empirical data on workers’ skills and tasks characteristics, we present an integer linear programming model based on the classic joint order batching and picker routing problem, with the novelty that individual workers’ skills are taken into account while assigning tasks to workers. Using real-world instances, the computational experiments show that it is possible to solve instances with up to 20 orders to proven optimality within a time limit of 1 hour, without considerably increasing the total distance traveled compared to the classic approach which only focuses on minimizing this criterion.","PeriodicalId":109028,"journal":{"name":"Proceedings of the 2022 9th International Conference on Industrial Engineering and Applications (Europe)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 9th International Conference on Industrial Engineering and Applications (Europe)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3523132.3523143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The problem of batching orders and routing orders in picker-to-parts warehouses is intensively studied in the research literature, but the impact of individual differences among pickers or forklift operators and their skills are rarely taken into consideration. Therefore, we propose a model that simultaneously does order batching and routing while taking advantage of the skills of each worker. This approach optimizes the total batch execution time, and reduces the physical and mental effort of workers, since they are likely to perform easy tasks according to their capabilities. Based on empirical data on workers’ skills and tasks characteristics, we present an integer linear programming model based on the classic joint order batching and picker routing problem, with the novelty that individual workers’ skills are taken into account while assigning tasks to workers. Using real-world instances, the computational experiments show that it is possible to solve instances with up to 20 orders to proven optimality within a time limit of 1 hour, without considerably increasing the total distance traveled compared to the classic approach which only focuses on minimizing this criterion.
基于技能的联合订单批处理和拣选者路径问题
在研究文献中,对拣货到零件仓库中的批订单和路由订单问题进行了深入的研究,但很少考虑拣货员或叉车操作员及其技能之间的个体差异的影响。因此,我们提出了一个同时进行订单批处理和路由的模型,同时利用每个工人的技能。这种方法优化了批处理的总执行时间,减少了工作人员的体力和脑力劳动,因为他们可能会根据自己的能力执行简单的任务。基于工人技能和任务特征的经验数据,提出了一个基于经典联合订单批处理和拣选机路由问题的整数线性规划模型,该模型在分配任务时考虑了工人个体的技能。使用现实世界的实例,计算实验表明,有可能在1小时的时间限制内解决多达20阶的实例,以证明最优性,而与只关注最小化该标准的经典方法相比,没有显着增加行进的总距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信