期刊文献+

基于复合相似度的订单分批优化方法 被引量:1

Batch Optimization Method of Order Based on Compound Similarity
下载PDF
导出
摘要 笔者针对配送中心的订单分批优化问题,建立以订单总延迟时间最小为目的的订单分批优化模型,综合考虑了订单的品类相似度、交货期相似度以及配送地相似度,提出一种订单复合相似度衡量方法,设计了基于复合相似度的订单分批启发式种子算法。仿真结果表明,该方法与模型可以有效地缩短订单延迟时间,提高订单拣选和配送效率。 This paper in view of the distribution center order partial optimization problem,established the total delay time to order the minimum orders for the purpose of partial optimization model,considering the order of appearance similarity,delivery time and flow similarity,similarity of an order composite similarity measure method is proposed,and design the seeds order batching heuristic algorithm based on composite similarity.The simulation results show that the model and method can effectively reduce delay time of orders and improve the customer service.
作者 和欣 毕濯玺 侯东含 HE Xin;BI Zhuoxi;HOU Donghan(School of Mechanical Engineering,Dalian University of Technology,Dalian Liaoning 116000,China;Faculty of Humanities and Social Sciences,Dalian University of Technology,Dalian Liaoning 116000,China)
出处 《信息与电脑》 2021年第8期81-83,共3页 Information & Computer
基金 国家级大学生创新创业训练计划支持项目(项目编号:2020101410601011333)。
关键词 配送中心 订单分批 种子算法 order batching seed algorithm distribution center
  • 相关文献

参考文献4

二级参考文献46

  • 1马士华,文坚.基于时间延迟的订单分批策略研究[J].工业工程与管理,2004,9(6):1-4. 被引量:21
  • 2Lee M K, Kim S Y. Scheduling of storage/retrieval orders under a just-in-time environment[J].International Journal of Production Research, 1995,33 (12) : 3331-3348. 被引量:1
  • 3Won J, Olafsson S. Joint order batching and order picking in warehouse operations [J]. International Journal of Production Research, 2005,43(7): 1427- 1442. 被引量:1
  • 4Lageweg B J, Lenstra J K, Rinnooy Kan A H G. Minimizing maximum lateness on one machine: Computational experience and some applications [J]. Statist. Neerlandica, 1976, (30) : 25-41. 被引量:1
  • 5Jeroen P Van Den Berg. Multiple order pick sequencing in a carousel system: A solvable case of the rural postman problem [J].The Journal of the Operational Research Society, 1996,47(12) : 1504-1515. 被引量:1
  • 6Bozer Y A, Schorn E C, Sharp G P. Geometric approaches to solve the Chebyshev traveling salesman problem [J]. IIE Transactions, 1990,22 (3):238-254. 被引量:1
  • 7Michael R Garey, David S Johnson. Computers and intractahility:A guide to the theory of NP-Completeness [R]. W. H. Freeman and Company,1979. 被引量:1
  • 8Ranan B Banerii. Artificial intelligence: a theoretical approach[M]. New York : North Holland, 1980. 被引量:1
  • 9Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling[J]. Naval Research Logistics, 1998,45 : 733-750. 被引量:1
  • 10Gibson D R, Sharp G P. Order batching procedures[J]. European Journal of Operational Research, 1992, 58(1) :57-67. 被引量:1

共引文献43

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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