期刊文献+

基于改进蚁群算法的立体停车库路径优化研究 被引量:1

Research on Path Optimization of Three-dimensional Parking Garage Based on Improved ant Colony Algorithm
下载PDF
导出
摘要 针对顾客在立体停车库进行停取车过程中,顾客等待时间过长、停车库堆垛机运行效率低下的问题,提出一种改进后的蚁群算法对停车库堆垛机的运行路径进行优化,以减少顾客在停取车过程中的等待时间和堆垛机的运行距离,提高立体停车库的整体运行效率。通过调研和考察,收集立体停车库的相关数据,建立立体停车库堆垛机运行路径的数学模型,并且使用MATLAB软件进行仿真实验,同时对比使用传统蚁群算法和改进后的蚁群算法的实验仿真数据,实验结果表明,改进后的蚁群算法相比传统蚁群算法能更好的缩短顾客停取车的等待时间和堆垛机的运行距离,并且具有更好的收敛性。 Aiming at the problems that customers wait too long and the operation efficiency of the stacker in the parking garage is low in the process of parking and picking up the car in the three-dimensional parking garage,an improved ant colony algorithm is proposed to analyze the running path of the stacker in the parking garage.Optimization to reduce the waiting time of customers and the running distance of the stacker in the process of parking and picking up the car,and improve the overall operation efficiency of the three-dimensional parking garage.Through investigation and investigation,the relevant data of the three-dimensional parking garage is collected,the mathematical model of the stacker's running path is established,and MATLAB is used to conduct simulation experiments.At the same time,the experimental simulation data using the traditional ant colony algorithm and the improved ant colony algorithm are compared.Compared with the traditional ant colony algorithm,the improved ant colony algorithm can better shorten the waiting time for customers to park and pick up the car and the running distance of the stacker,and has better convergence.
作者 葛能鹏 陈金兰 Ge Neng-peng;Chen Jin-lan(Hunan Industry Polytechnic,changsha Hunan 410082)
出处 《内燃机与配件》 2022年第18期19-21,共3页 Internal Combustion Engine & Parts
基金 2020年湖南省教育厅科学研究项目一般项目--基于AGV技术的智能停车库路径规划及布局优化研究(编号:20C0659)。
关键词 立体停车库 堆垛机 数学模型 改进蚁群算法 仿真实验 Three-dimensional parking garage Stacker Mathematical model Improved ant colony algorithm Simulation experiment
  • 相关文献

参考文献6

二级参考文献51

共引文献45

同被引文献2

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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