串列立体仓库存取路径规划问题求解

靳萌; 穆希辉; 杜峰坡; 郭浩亮

引用本文:

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 2219次下载 22次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
串列立体仓库存取路径规划问题求解
靳萌¹, 穆希辉², 杜峰坡², 郭浩亮¹
1.中国人民解放军军械工程学院, 石家庄050003;2.总装备部军械技术研究所, 石家庄050003

摘要:

串列立体仓库是自动化立体仓库的一种特殊形式,其带有穿越巷道,布置方式灵活,适用于许多场地受限的库房情况。串列立体仓库与普通立体仓库相比涉及到许多特殊的理论问题。就串列立体仓库最核心也是最复杂的路径生成问题,提出了一种新的图赋权方法,并给出了适应实际需要的附加目标。针对路径生成数学模型,提出了一种基于免疫遗传的进化算法进行求解。数值仿真实验证明,该方法能有效收敛。通过与简单遗传算法的算例比较,说明了该算法达到可接受的次优解速度快,具有一定的理论研究与工程应用价值。

关键词: 串列立体仓库路径生成免疫遗传算法

DOI：

分类号:TB488

基金项目:国家自然科学基金项目(61271152)

Tandem Stereoscopic Warehouse Access Path Planning Problem Solving

JIN Meng¹, MU Xi-hui², DU Feng-po², GUO Hao-liang¹

1.Ordnance Engineering College, Shijiazhuang 050003, China;2.Ordnance Engineering Institute, Shijiazhuang 050003, China

Abstract:

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 forward 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.

Key words: tandem stereoscopic warehouse path planning problem immune genetic algorithm