期刊文献+

旋转货架配货作业的改进临近域算法 被引量:3

An Improved Nearest Items Heuristics for the Order Picking Optimization of Multiple Carousels System in Distribution Center
原文传递
导出
摘要 旋转货架系统配置配货作业是现代配送中心中一项非常重要的作业活动,文章研究具有多个水平旋转货架系统的配货作业问题,建立对应的模型,在分析该类型作业中整个货架系统配货顺序最优单个货架物品拣选顺序必然最优的特点基础上,设计改进临近域算法,并通过模拟测试,效果良好。 The order picking optimization of a multi-carousel system is one important problem in modern distribution center. This paper analyzes such a system and establishes its mathematical model. According to the character that the optimal picking order of the materials in the single carousel will come forth of the optimal sequence of the whole assignment, a new improved nearest items heuristics (INIH) is presented. Finally, experimental results verify that the optimum solutions are quickly and steadily achieved and show its better performance.
出处 《工业工程与管理》 2008年第4期68-71,92,共5页 Industrial Engineering and Management
关键词 运筹学 配货作业 路径优化 配送中心 operations research order picking sequencing carousel system
  • 相关文献

参考文献14

  • 1王雄志,王国庆.配送中心定向补货作业问题[J].系统工程,2006,24(1):48-52. 被引量:8
  • 2Liu C L. Introduction to combinatorial mathematics [M]. McGrawHill, New York, 1968.
  • 3Michael R. Garey, David S J. Computers and intractability: A guide to the theory of NP-Completeness[M]. W H Freeman and Company, 1979.
  • 4Rene'de Koster, Tho L D, Kees J R. Design and control of warehouse order picking: A literature review[J]. European Journal of Operational Research, 2006.
  • 5Bartholdi J J,Platzman L K. Retrieval strategies for a carousel conveyor[J]. IIE Transactions, 1986,18(2) : 166-173.
  • 6Cheng T S. Performance evaluation of carousel operation[J]. Production Planning and Control, 1998,9 (5) : 477-488.
  • 7Ghosh J B,Wells C E. Optimal retrieval strategies for carousel conveyors [J]. Mathematical Computer Modeling, 1992, 16 (10):59-70.
  • 8Stern H I. Parts location and optimal picking rules for a carousel conveyer automatic storage and retrieval system [C]. In 7^th International Conference on Automation in Warehousing, 1986: 185-193.
  • 9Han M H, McGinnis L F, Carousel applicatian for work iw process: Modeling and analysis[C]. Technical Report, Material Handling Research Center, Georgia Institute of Technology, Atlanta, Georgia, 1986.
  • 10Hwang H, Ha J W. Cycle time models for single/double carousel system [ J ]. International Journal of Production Economics, 1991,25 : 129-140.

二级参考文献11

  • 1钱颂迪等.运筹学[M].北京:清华大学出版社,1998.
  • 2Ratli H D,Rosenthal A S.Order picking in a rectangular warehouse:a solvable case of the traveling salesman problem[J].Operations Research,1983,31:507~521.
  • 3Gibson D R,Sharp G P.Order batching procedures[J].European Journal of Operational Research,1992,58:57~67.
  • 4Roodbergen K J,De Koster R.Routing order pickers in a warehouse with multiple cross aisles[A].Proceedings of the 1998 International Material Handling Research[C].1998.
  • 5Petersen C G.An evaluation of order picking routing policies[J].International Journal of Operations & Production Management,1997,17(11):1098~1111.
  • 6Gademann A J R M,Van Den Berg J P,Van Der Hoff H H.An order batching algorithm for wave picking in a parallel-aisle warehouse[J].IIE Transactions,2001,33:385~398.
  • 7Hackman S T,Rosenblatt M J.Allocating items to automated storage and retrieval systems[J].IIE Transactions,1990,22(1):7~14.
  • 8Frazelle E H,Hackman S T,Passy U,Platzman L K.The forward-reverse problem[A].Ciriani T A,Leachman R C.Optimization industry 2[C].Wiley,1994:3~61.
  • 9Bozer Y A.Optimizing throughput performance in designing order picking systems[D].Atlanta,GA:Gorgia Institute of Technology,1985.
  • 10Bellmoer M,Nemhauser G L.The traveling salesman problem:a survey[J].Operations Research,16,1968,538~558.

共引文献7

同被引文献48

  • 1张攀,田国会,贾磊,李晓磊,路飞.旋转货架拣选作业优化问题的新型混合遗传算法求解[J].机械工程学报,2004,40(6):34-38. 被引量:11
  • 2Van den Berg J P. Multiple order pick sequencing in a carousel system: A solvable case of the rural post- man problem[J]. Journal of the Operational Research Society. 1996, 47 (12): 1504-1515.
  • 3Litvak N, Adan I. The travel time in carousel systems under the nearest item heuristic[J]. Journal of Ap- plied Probability, 2001, 38 (1): 45-54.
  • 4Litvak N, Adan I J B F, Wessels J. Order picking in carousel systems under the nearest item heuristic[J]. Probability in the Engineering and Informational Sci- ences, 2001, 15 (2): 135-164.
  • 5Litvak N, Zwet W R V. On the minimal travel time needed to collect n items on a circle[J]. The Annals of Applied Probability, 2004, 14 (2) :881-902.
  • 6Hassini E, Vickson R G. A two-carousel storage lo- cation problem[J]. Computers and Operations Re- search, 2003, 30 (4): 527-539.
  • 7Park B C, Park J Y, Foley R D. Carousel system performance [J]. Journal of Applied Probability, 2003, 40 (3): 602-612.
  • 8Colorni A, Dorigo M, Maniezzo V. An investigation of some properties of an ant algorithm [A]. Proc of the Parallel Problem Solving from Nature Conference (PPSN'92) [C]// Belgium: Elsevier Publishing, 1992.
  • 9Wang G. Optimal order picking in a double carousel storage system[R], working paper, 2007.
  • 10Han M H, McGinnis W J A. Analysis of rotary rack operation[J]. Material Flow, 1988, 4 (1): 283-293.

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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