期刊文献+

串列立体仓库存取路径规划问题求解 被引量:2

Tandem Stereoscopic Warehouse Access Path Planning Problem Solving
下载PDF
导出
摘要 串列立体仓库是自动化立体仓库的一种特殊形式,其带有穿越巷道,布置方式灵活,适用于许多场地受限的库房情况。串列立体仓库与普通立体仓库相比涉及到许多特殊的理论问题。就串列立体仓库最核心也是最复杂的路径生成问题,提出了一种新的图赋权方法,并给出了适应实际需要的附加目标。针对路径生成数学模型,提出了一种基于免疫遗传的进化算法进行求解。数值仿真实验证明,该方法能有效收敛。通过与简单遗传算法的算例比较,说明了该算法达到可接受的次优解速度快,具有一定的理论研究与工程应用价值。 Tandem stereoscopic warehouse is a special form of stereoscopic warehouse, which is convenient flexible arrangement and suitable for many fields limited condition in the warehouse. Tandem stereoscopic warehouse deals with many special theoretical problems compared to the normal warehouse. A new method of weight endowment was put for- ward and additional target suitable for actual needs was provide to solve the path generation problems which is the most central and most complex problem in tandem storage spaces. An evolutionary algorithm based on immune genetic was proposed to solve the above model. Numerical simulations showed that the method can effectively convergence; by comparison with the example of a simple genetic algorithm, the algorithm to achieve acceptable suboptimal solution speed is fast. The purpose was to provide reference for theoretical research and engineering application.
出处 《包装工程》 CAS CSCD 北大核心 2013年第15期99-103,共5页 Packaging Engineering
基金 国家自然科学基金项目(61271152)
关键词 串列立体仓库 路径生成 免疫遗传算法 tandem stereoscopic warehouse path planning problem immune genetic algorithm
  • 相关文献

参考文献18

  • 1SARKER B R,SOBHAN B P. Travel Time Models in Auto- mated Storage Retrieval Systems A Critical Revies [ J ]. In- ternational Journal of Production Economics, 1995,18 (40) : 173-184.
  • 2ROODBERGEN K J, KOSTER R D. Routing Methods for Warehouses with Multiple Cross Aisles [ J ]. International Journal of Production Research, 2001,39 ( 9 ) : 1865-1883.
  • 3BRYNZI~R H,JOHANSSONA M I. Storage Location Assign- ment Using the Product Structure to Reduce Order Picking Times [ J ]. International Journal of Production Economics, 1996,46-47 (24) :595-603.
  • 4HSIEH S,TSAI K C. A BOM Oriented Class-based Storage Assignment in an Automated Storage/Retrieval System[J]. The International Journal of Advanced Manufacturing Tech- nology, 2001,17 (23) :683-691.
  • 5PAN C H,LIU S Y. A Comparative Study of Order Batching Algorithms [ J ]. Journal of Management Science, 1995,23 (6) :691-699.
  • 6LIN Che-hung,LU Yuan-yuan. The Procedure of Determi- ning the Order Picking Strategies in Distribution Center [ J]. Int J Production Economics, 1999,13 ( 60-61 ) :301 - 307.
  • 7KOSTER R D,THO L D, ROODBERGEN K J. Design and Control of Warehouse Order Picking: A Literature Review [ J ]. European Journal of Operational Research, 2006,S0377 (2217).
  • 8王雄志,文晓巍.配送中心MOB系统配置下配货路径优化问题[J].包装工程,2008,29(8):100-102. 被引量:1
  • 9AHMADI R H, MAMER J W. Routing Heuristics for Auto- mated Pick and Place Machines [ J ]. European Journal of Operational Research, 1999 ( 117 ) :533-552.
  • 10AGRAWAL R. Application of the Modified 2-opt and Jump- ing Gene Operators in Multi-objective Genetic Algorithm to Solve MOTSP[ J]. Artificial Intelligence, 2011,16 ( 6 ) : 226 -241.

二级参考文献39

  • 1雷德明,严新平,吴智铭.多目标混沌进化算法[J].电子学报,2006,34(6):1142-1145. 被引量:20
  • 2Mahfoud S W.Crowding and preselection revisited[C]//Manner R, Manderick B.Proc 2nd Conf Parallel Problem Solving from Nature. Amsterdam: North-Holland, 1992 : 27-36.
  • 3Harik G.Finding multimodal solutions using restricted tournament selection[C]//Eshelman L.Proc 6th Int Conf Genetic Algorithms.San Mateo, CA: Morgan Kaufmann, 1995 : 24-31.
  • 4Cedeno W.The multi-niche crowding genetic algorithm:Analysis and applications[D].Univ California,Davis,1995.
  • 5Gotdberg D E,Richardson J.Genetic algorithms with sharing for multimodal function optimization[C]//Grefenstette J J.Proc 2nd Int Conf Genetic Algorithms and their Applications.Hillsdale,NJ: Lawrence Erlbaum, 1987:41-49.
  • 6Petrosdki A.A clearing procedure as a niching method for genetic algorithms[C]//Proc 3rd IEEE Conf Evolutionary Computation.Piscataway,NJ:IEEE Press, 1996:798-803.
  • 7Yin X,Germay N.A fast genetic algorithm with sharing scheme using cluster analysis methods in muhimodal function optimization[C]//Albrecht R F,Reeves C R,Steele N C.Proc Int Conf Artificial Neural Nets and Genetic Algorithms.New York:Springer- Verlag, 1993 : 450-457.
  • 8Miller B L,Shaw M J.Genetic algorithms with dynamic niche sharing for multimodal function optimization[C]//Proc 3rd IEEE Conf Evolutionary Computation.Piscataway,NJ:IEEE Press,1996:786-791.
  • 9Goldberg D E,Wang L.Adaptive niching via coevolutionary sharing,IlliGAL Report No.97007[R].1997.
  • 10Mahfoud S W.Crossover interactions among niches[C]//Proc 1st IEEE Conf Evolutionary Computation.NJ: IEEE Press, 1994: 188 - 193.

共引文献19

同被引文献9

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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