期刊文献+

订单时间具有约束的分批配货作业优化 被引量:5

Batching orders optimization with due date time constraints in warehouse by minimizing travel time and lateness
原文传递
导出
摘要 针对现代配送中心订单时间具有约束的分批配货作业优化问题,通过分析其特点,提出优化目标为配货时间与客户订单延误时间加权和最小的分批配货问题,建立对应的整数规划模型,并设计了相应的JBS启发式算法,以此JBS结果为初始解,运用效率较高的遗传算法求解,最后通过模拟测试,表明效果良好. The batching order optimization with due date time constraints is investigated by minimizing travel time and lateness, which is NP-hard. A mathematical model is presented by analyzing some charac-teristics of operations. A heuristics as well as a genetic algorithm base on it, are proposed. Finally, simu-lation tests are carried out; and the test results verify that the optimum solutions are quickly and steadily achieved and show its better performance.
出处 《武汉大学学报(工学版)》 CAS CSCD 北大核心 2009年第3期400-404,408,共6页 Engineering Journal of Wuhan University
基金 广东省自然科学基金项目(编号:8451064201000819)
关键词 运筹学 分批配货 交货期 配送中心 operations research batching order due date distribution center
  • 相关文献

参考文献9

  • 1Lee 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.
  • 2Won J, Olafsson S. Joint order batching and order picking in warehouse operations [J]. International Journal of Production Research, 2005,43(7): 1427- 1442.
  • 3Lageweg 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.
  • 4Jeroen 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.
  • 5Bozer 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.
  • 6Michael R Garey, David S Johnson. Computers and intractahility:A guide to the theory of NP-Completeness [R]. W. H. Freeman and Company,1979.
  • 7Ranan B Banerii. Artificial intelligence: a theoretical approach[M]. New York : North Holland, 1980.
  • 8Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling[J]. Naval Research Logistics, 1998,45 : 733-750.
  • 9Gibson D R, Sharp G P. Order batching procedures[J]. European Journal of Operational Research, 1992, 58(1) :57-67.

同被引文献78

  • 1马士华,文坚.基于时间延迟的订单分批策略研究[J].工业工程与管理,2004,9(6):1-4. 被引量:21
  • 2伍经纬,蔡临宁.订单分批算法的适用性研究[J].工业工程与管理,2007,12(4):104-107. 被引量:7
  • 3De Koster R. How to assess a warehouse operation in a single tour[M]. Report, RSM Erasmus University, 2004.
  • 4Van den Berg J P.A literature survey on planning and control of ware- housing systems [J]. IIE Transactions, 1999,(31 ):751-762.
  • 5Lin C-H, Lu I-Y. The procedure of determining the order picking strate- gies in distribution center [J]. International Journal of Production Economic, 1999, (46).
  • 6Kenneth B Ackerman. Practical handbook of warehousing [M]. Materials Management, 1990.
  • 7Choe K,Sharp G.Small parts order picking: design and operation [EB/OL].http: //www2 ,isye. gatech.edu/logisticstutorial/order/article.ht m,2009-02-17.
  • 8Koster, Le-Duc, Roodbergen.Design and control of warehouse order picking A literature review [J].European Journal of Operational Research,2007,182 : 481 -501.
  • 9Clarke, Wright.Scheduling of vehicles from a central depot to a number of delivery points [J]. Operations Research, 1964,(12) : 568-581.
  • 10Hwang H, Baek W, Lee M. Cluster algorithms for order picking in an automated storage and retrieval system [J]. International Journal of Pro- duction Research, 1988,26:189-204.

引证文献5

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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