期刊文献+

基于JIT装配模式的网上超市订单分拣优化模型 被引量:6

JIT Assembly Line-based Order Picking Process Optimization Method for Online Supermarkets
原文传递
导出
摘要 订单分拣是大型网上超市生存和发展的关键环节,如何在数百万种商品中将订单要求的商品高效、准确地进行拣选并包装,是亟待解决的难题。本文以提高大型网上超市订单分拣方法的科学性为目标,针对订单拣选、集货复核、包装这一作业流程,基于JIT装配流水线思想,建立大型网上超市订单成组分拣的优化模型与求解方法。在构建订单分拣流程中各工序作业时间计算模型的基础上,建立了订单分批与排序的联合优化模型。围绕缩减求解空间的思想提出两阶段启发式优化方法。通过应用实例分析和灵敏度分析证明了算法的有效性。结果表明,本文提出的网上超市订单成组分拣方法相较于传统方法可较大幅度提高订单分拣的效率,为网上零售企业的订单拣选和包装作业流程的优化提供了理论指导。 The online supermarket has become one of the most powerful engines that drive the online retailing market in China.It always sells huge number of fast-moving consumer goods(FMCG)and normally has to store enormous stock-keeping units(SKUs)at multiple zones.How to efficiently and accurately pick up the ordered items from tens of thousands of commodities and package them?From the perspective of JIT assembly line,a new optimization method is proposed to streamline the processing of order fulfillment operations in warehouses,including order picking,order sorting(item collecting and checking)and order packing.Three working time calculation formulations are present first and then a joint optimization model of order batching and sequencing is formulated.The model is solved by a two-stage heuristic solution procedure,which decomposes the original model into a batching model with the consideration of the workload balance of multiple storage zones,and a Permutation Flow Shop Problem(PFSP)to sequence the order batches.The batching model is solved by improved relocate and exchange operations in Local Search algorithm while the PFSP is solved by the NEH algorithm.Finally numerical analysis is conducted to verify the effective of the proposed method.The results indicate that compared with the traditional wave picking method,the proposed method can substantially increase the efficiency of order picking for online supermarkets.The principle of JIT assembly line is introduced to order picking.A new problem solution idea is present for order picking and a theoretical guide for optimizing the whole process of order picking in online retailing is provided.
作者 黄敏芳 张源凯 王颜新 胡祥培 HUANG Min-fang;ZHANG Yuan-kai;WANG Yan-xin;HU Xiang-pei(School of Economics and Management,North China Electric Power University,Beijing 102206,China;Faculty of Management,Dalian University of Technology,Dalian 116024,China;Business College,Beijing Union University,Beijing 100025,China;Bejing Key Laboratory of New Energy and Low-Carbon Development,North China Electric Power University,Beiing 102206,China)
出处 《中国管理科学》 CSSCI CSCD 北大核心 2020年第5期159-166,共8页 Chinese Journal of Management Science
基金 国家自然科学基金资助项目(71571067) 国家自然科学基金创新研究群体项目(71421001)。
关键词 网上超市 订单分拣 装配流水线 订单分批 排序 online supermarket order picking assembly line order batching sequencing
  • 相关文献

参考文献4

二级参考文献61

  • 1冯大光,唐立新.具有最大总加权满意度的单机调度问题的dynasearch算法[J].管理科学学报,2006,9(4):40-50. 被引量:3
  • 2鞠全勇,朱剑英.基于混合遗传算法的动态车间调度系统的研究[J].中国机械工程,2007,18(1):40-43. 被引量:24
  • 3HYUN C J,KIM Y,KIM Y K.A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines[J].Computers & Operations Research,1998,25(7/8):675-690. 被引量:1
  • 4KARABOGA B D.An idea based on honey bee swarm for numerical optimization[EB/OL].(2010-10-11)[2012-09-13].http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf. 被引量:1
  • 5KARABOGA D,BASTURK B.A powerful and efficient algorithm for numerical function optimization:artificial bee colony (ABC) algorithm[J].Journal of Global Optimization,2007,39(3):459-471. 被引量:1
  • 6AKAY B,KARABOGA D.Solving integer programming problems by using artificial bee colony algorithm[J].Lecture Notes in Computer Science,2009,5883:355-364. 被引量:1
  • 7KARABOGA D,AKAY B,OZTURK C.Artificial bee colony (ABC) optimization algorithm for training feed-forward neural networks[J].Lecture Notes in Computer Science,2007,4617:318-329. 被引量:1
  • 8PANSUWAN P,RUKWONG N,PONGCHAROEN P.Identifying optimum artificial bee colony (ABC) algorithm's parameters for scheduling the manufacture and assembly of complex products[C] //Proceedings of Computer and Network Technology(ICCNT).Washington,D.C.,USA: IEEE,2010:339-343. 被引量:1
  • 9LEU Y,MATHESON L A,REES L P.Sequencing mixedm odel assembly lines with genetic algorithms[J].Computers & Industrial Engineering,1996,30(4):1027-1036. 被引量:1
  • 10Yang D L,Chern M S. A two-machine flowshop sequencing problem with limited waiting time constraints[J].Computers & Industrial Engineering,1995,(01):63-70. 被引量:1

共引文献66

同被引文献39

引证文献6

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部