A new mathematical model and meta-heuristic algorithm for order batching, depot selection, and assignment problem with multiple depots and pickers

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Selma Gülyeşil , Zeynep Didem Unutmaz Durmuşoğlu
{"title":"A new mathematical model and meta-heuristic algorithm for order batching, depot selection, and assignment problem with multiple depots and pickers","authors":"Selma Gülyeşil ,&nbsp;Zeynep Didem Unutmaz Durmuşoğlu","doi":"10.1016/j.cie.2024.110585","DOIUrl":null,"url":null,"abstract":"<div><div>The ‘order picking problem’ involves the efficient and organized retrieval of items from shelves to fulfill customer orders. In this study, we consider a new configuration of warehouse system with multiple pickers and depots (m-pickers &amp; n-depots) for manually operated ‘picker-to-parts’ warehouses. The efficiency of the process is measured based on two metrics: i- total order picking distance of each picker ii- total number of pickers assigned to each of depots. The handled problem is called as <strong><em>‘Order Batching, Depot Selection and Assignment Problem with Multiple Depots and Multiple Pickers (OBDSAPMDMP)</em></strong><span><span><sup>1</sup></span></span><strong><em>’.</em></strong> To solve this complex problem, a new bi-objective Mixed-Integer Linear Programming (MILP) formulation for small-sized problems and a <em>meta</em>-heuristic called ‘Dependent Harmony Search (DHS)<span><span><sup>2</sup></span></span>’ for large-sized problems are proposed. The performance of DHS algorithm is evaluated by comparing the optimal results attained by MILP model. For the problem size of 10 orders, the average gap (%) in distance between the solution of DHS and MILP is 4.22%, although in some experiments DHS can find the optimal solution in a very short time. Also, in related analysis, it is seen that constructing multiple depots instead of one left-most located depot decreases total order picking distance by 7.11% on average.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":null,"pages":null},"PeriodicalIF":6.7000,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S036083522400706X","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The ‘order picking problem’ involves the efficient and organized retrieval of items from shelves to fulfill customer orders. In this study, we consider a new configuration of warehouse system with multiple pickers and depots (m-pickers & n-depots) for manually operated ‘picker-to-parts’ warehouses. The efficiency of the process is measured based on two metrics: i- total order picking distance of each picker ii- total number of pickers assigned to each of depots. The handled problem is called as ‘Order Batching, Depot Selection and Assignment Problem with Multiple Depots and Multiple Pickers (OBDSAPMDMP)1’. To solve this complex problem, a new bi-objective Mixed-Integer Linear Programming (MILP) formulation for small-sized problems and a meta-heuristic called ‘Dependent Harmony Search (DHS)2’ for large-sized problems are proposed. The performance of DHS algorithm is evaluated by comparing the optimal results attained by MILP model. For the problem size of 10 orders, the average gap (%) in distance between the solution of DHS and MILP is 4.22%, although in some experiments DHS can find the optimal solution in a very short time. Also, in related analysis, it is seen that constructing multiple depots instead of one left-most located depot decreases total order picking distance by 7.11% on average.
针对具有多个仓库和拣货员的订单分批、仓库选择和分配问题的新数学模型和元启发式算法
订单分拣问题 "涉及从货架上高效、有序地检索物品,以完成客户订单。在本研究中,我们考虑了一种新的仓库系统配置,即手动操作的 "拣货员到零件 "仓库,该系统具有多个拣货员和仓库(m-pickers & n-depots)。该流程的效率根据两个指标来衡量:i- 每个拣货员的总订单拣货距离 ii- 分配给每个仓库的拣货员总数。所处理的问题被称为 "具有多个仓库和多个拣选工的订单分批、仓库选择和分配问题(OBDSAPMDMP)1"。为解决这一复杂问题,我们提出了一种新的双目标混合整数线性规划(MILP)公式来解决小型问题,并提出了一种名为 "依赖和谐搜索(DHS)2 "的元启发式来解决大型问题。通过比较 MILP 模型获得的最优结果,评估了 DHS 算法的性能。在问题规模为 10 阶时,DHS 的解与 MILP 的解之间的平均距离差距(%)为 4.22%,尽管在某些实验中 DHS 可以在很短的时间内找到最优解。此外,在相关分析中还发现,建造多个仓库而不是一个位于最左侧的仓库可使订单分拣总距离平均减少 7.11%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术官方微信