期刊文献+

基于遗传算法的配送中心订单拣选优化问题研究 被引量:8

Research on Distance Optimazation of Batch-order Picking Based on GA
下载PDF
导出
摘要 以拣选所有订单的行走距离最短为目标,研究了配送中心内订单分批拣选的优化问题.文中采用了遗传算法来优化订单的分批组合,不同于先前的分批优化方法,本文在订单分批时,考虑了种子订单的选择方法,通过种子订单的有效选取,使拣选总距离得到了明显的优化. We address the problem ofbatching orders in a parallel-aisle warehouse, with the objective to minimize the travel distance of picking all of the batches. This study develops an order batching approach based on genetic algorithms (GAs). Unlike to previous batching methods, in this paper it pays attention on the selection of seed orders. And it does reduce the distance of picking obvipusly, comparing with other's approach.
出处 《河北工业大学学报》 CAS 北大核心 2009年第5期10-14,共5页 Journal of Hebei University of Technology
基金 河北省自然科学基金(G200800122)
关键词 订单拣选 订单分批 遗传算法 优化 order batching genetic algorithms seed order
  • 相关文献

参考文献12

  • 1Koster, Le-Duc, Roodbergen. Design and control of warehouse order picking A literature review [J]. European Journal of Operational Research, 2007 (182): 481-501.
  • 2Van den Berg J P. A literature survey on planning and control of warehousing systems [J]. IIE Transactions, 1999 (31 ): 751-762.
  • 3Clarke, Wright. Scheduling of vehicles from a central depot to a number of delivery points [J]. Operations Research, 1964 (12): 568-581.
  • 4De Koster R, Van der Poort E S, Wolters M. Efficient order batching methods in warehouses [J]. International Journal of Production Research, 1999, 37 (7): 1479-1504.
  • 5李诗珍.配送中心订单分批拣货问题的数学模型及算法[J].铁道运输与经济,2007,29(11):65-67. 被引量:6
  • 6李诗珍,杜文宏.基于聚类分析的订单分批拣货模型及启发式算法[J].统计与决策,2008,24(12):53-56. 被引量:34
  • 7Gademann, Velde. Batching to minimize total travel time in a parallel-aisle warehouse [J]. IIE Transactions 2005, 37 (1) : 63-75.
  • 8Chen Wu. An association-based clustering approach to order batching considering customer demand patterns [J]. Omega Intemational Journal of Management Science, 2005, 33 (4): 333-343.
  • 9Hsu C M, Chen K Y, Chen M C. Batching orders in warehouses by minimizing travel distance with genetic algorithms [J]. Computers in Industry, 2005, 56 (2): 169-178.
  • 10Elsayed E A. Algorithms for optimal material handling in automatic warehousing systems [J]. Intemational Journal of Production Research, 1981 (19): 525-535.

二级参考文献9

  • 1Noud Gademann, Steef Van De Velde. Order batching to minimize total travel time in a parallel-aisle warehouse [J]. IIE Transactions, 2005, (37) : 63-75.
  • 2Charles G.Petersen Ⅱ .An evaluation of order picking routing policies [J]. International Journal of Operations & Production Management. 1997, 17 ( 11 ) : 1098-1111.
  • 3M. B. M. de Koster, E. S. van der Poort, M. Wolters. Efficient Order-hatching Methods in Warehouse [J]. INT. J. PROD. RES., 1999, 37(7).
  • 4Gademan, N., Van den Berg, J. and Van der Hoff, H., An order-hatching Algorithm for Wave Picking in a Parallel-aisle Warehouse [J]. IIE Transactions, 2001, (33).
  • 5Rosenwein, M.B., An Application of Cluster Analysis to the Problem of Locating Items within a Warehouse [J]. IIE Transactions, 1994, (26).
  • 6Mu-Chen Chen, Cheng-Lung Huang, Kai-Ying Chen, Hsiao-Pin Wu. Aggregation of Orders in Distribution Centers Using Date Mining [J]. Expert Systems with Applications, 2005, (28).
  • 7H. HWANG and D. G. KIM, Order-batching Heuristics Based on Cluster Analysis in A Low-level Picker-to-part Warehousing System [J]. International Journal of Production Research, 2005,43 (17).
  • 8Hark Hwang, Wonjang Baek, Moon-Kyu Lee. Clustering Algriothm for Order Picking in an Automated Storage and Retrieval System [J]. INT. J. PROD. RES., 1998, 26(2).
  • 9Charles G. Petersen Ⅱ. An Evaluation of order Picking Routing policies [J]. International Journal of Operations & Production Management. 1997, 17(11).

共引文献36

同被引文献102

引证文献8

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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