期刊文献+

基于群集智能算法的路径规划问题 被引量:8

Path planning based on the swarm intelligence algorithm
原文传递
导出
摘要 在工业及服务系统行业,特别是物流及交通运输系统中经常遇到路径规划问题。该文针对自动化立体仓库单拣选台分层水平旋转货架系统,建立了数学模型,引入基于群集智能的蚁群优化算法解决货物拣选路径规划问题。该方法能够对旋转货架系统存储的货物进行快速拣选,并在全局内找到最优货物拣选路径,求解质量高,计算时间短。在货单条目为40的情况下,该文使用改进的蚁群算法求解最优拣选路径比模拟退火算法减小了1 367.17s,比混合遗传算法节省了533.4 s。实验表明该方法适合求解中小规模货物拣选路径规划问题。 Path planning is encountered in a variety of industrial and service applications,especially in logistics and transportation systems.This paper gives a mathematical model for a single-picking station multi-carousel system in an automated warehouse.An ant colony optimization algorithm was used to solve the goods picking path planning problem.Tests show that the ant colony optimization algorithm can rapidly identity the global optimal goods picking path.For a system with items,the improved ant colony optimization algorithm uses 1 367.17 s less time than the simulated annealing algorithm and 533.4 s less than the hybrid genetic algorithm.Thus,this approach improves the operating efficiency of automated storage/retrieval systems for small-size or medium goods picking path planning problems.
出处 《清华大学学报(自然科学版)》 EI CAS CSCD 北大核心 2007年第z2期1770-1773,共4页 Journal of Tsinghua University(Science and Technology)
基金 国家自然科学基金资助项目(60574010)
关键词 群集智能 蚁群优化算法 旋转货架 路径规划 swarm intelligence ant colony optimization algorithm carousel system path planning
  • 相关文献

参考文献10

  • 1[1]LIU Yang,Kevin M,Polycarpou.Stability analysis of M-dimensional asynchronous swarms with a fixed communication topology[J].IEEE Transactions on Automated Control,2003,48(1):76-95.
  • 2[2]Cicirllo V A,Smith S F.Insect Societies and Manufacturing[R].IJCAI-01.Workshop on Artificial Intelligence and Manufacturing:New AI Paradigms for Manufacturing,August 2001.
  • 3[3]Holldobler B,Wilson E O.The Ants[M].Cambridge:The Belknap Press of Harvard University Press,1990.
  • 4[4]Dorigo M,Maniezzo V,Colorni A.The ant system:Optimization by a colony of cooperating agents[J].IEEE Trans.Systems,Man,and Cybernetics-Part,1996,26(1):29-41.
  • 5[5]Bonabeau E,Dorigo M,Theraulaz G.Inspiration for optimization from social insect behaviour[J].Nature,2000,406(6791):39-42.
  • 6[6]Berg J P Van den,Gademann A J R M.Simulation study of an automated storage/retrieval system[J].International Journal of Production Research,2000,38(6):1339-1356.
  • 7[7]Potrc I,Lerher T,Kramberger J.Simulation of multi-shuttle automated storage and retrieval systems[J].Journal of Materials Technology,2004,157-158:236-244.
  • 8[8]HU Yahong,HUANG Shellying,CHEN Chuanyu.Travel time analysis of a new automated storage and retrieval system[J].Computers & Operations Research,2005,32:1515-1544.
  • 9[10]Heungsoon Felix Lee,Samantha K,Schaefer.Sequencing methods for automated storage and retrieval systems with dedicate storage[J].Computers ind.Engng,1997,32(2):351-362.
  • 10[11]Bengu G.An optimal storage assignment for automated rotating carousels[J].IIE Trans,1995,27(1):105-107.

同被引文献102

引证文献8

二级引证文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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