期刊文献+

基于改进粒子群算法的航空行李在线装载优化 被引量:4

Online Luggage Loading Optimization Based on Improved Particle Swarm Algorithm
下载PDF
导出
摘要 目的为解决航空行李自动装卸中关键装载算法问题,实现航空行李自动装卸,同时满足流水作业的实际需要。方法基于关键点装载策略,提出一种以装载空间利用率为优化目标,考虑行李质量、体积及装载顺序等约束条件的改进粒子群算法。首先,通过关键点法输出流水线上待装载行李的全部可放点序列,然后根据约束条件重新定义粒子群算法的速度与位置,以空间利用率为适应度函数进行迭代寻优,输出全局最优解,实现对装载位置与姿态的优化。结果实验部分采用真实行李数据对算法进行仿真验证表明,改进粒子群算法优化后可将箱体空间利用率提高了10.8%,平均规划布局效率提高了26.5%。结论提出的装载算法能够有效地解决实际行李装载问题,为行李流水作业的货物装载提供理论依据及参考。 The work aims to solve the key loading algorithm problem in the automatic loading and unloading of air luggage,realize automatic loading and unloading of air luggage and meet the actual needs of flow operation.Based on the key point loading strategy,an improved particle swarm optimization(PSO)algorithm that considered constraints such as the weight,volume and loading order of luggage was proposed with the utilization of loading space as the optimization objective.Firstly,the key point method was used to output all the point sequences of the bags to be loaded on the pipeline.Then,the speed and position of the particle swarm optimization algorithm were redefined according to the constraint conditions.The space utilization was used as the fitness function for iterative optimization,and the global optimal solution was output to optimize the loading position and attitude.In the experimental part,the real luggage data was used to verify the algorithm.The results showed that the improved particle swarm optimization algorithm could improve the box space utilization by 10.8%and the average layout efficiency by 26.5%.The proposed loading algorithm can effectively solve the actual luggage packing problem,and provide a theoretical basis and reference for the cargo loading of luggage flow process.
作者 张长勇 张倩倩 翟一鸣 刘佳瑜 ZHANG Chang-yong;ZHANG Qian-qian;ZHAI Yi-ming;LIU Jia-yu(College of Electronic Information and Automation,Civil Aviation University of China,Tianjin 300300,China)
出处 《包装工程》 CAS 北大核心 2021年第21期200-206,共7页 Packaging Engineering
基金 国家自然科学基金青年基金(51707195) 中央高校基本科研业务费专项基金A类(3122016A009)。
关键词 航空行李 三维装箱 改进粒子群算法 关键点 组合优化 air luggage 3D boxing improved particle swarm optimization key points combinatorial optimization
  • 相关文献

参考文献6

二级参考文献72

  • 1雷定猷.货物装运优化理论与应用研究[D].长沙:中南大学,2004.
  • 2Raymond Edward Miller, James W Thatcher. Complexity of computer computations [ M ]. New York : Plenum Press, 1972 : 85 - 103.
  • 3HE Yaohua, WU Yong, De Souza, et al. A global search framework for practical three - dimensional packing with variable carton orientations [ J ]. Computers and Opera- tions Research, 2012, 39(10) : 2395 - 2414.
  • 4ZHU Wenbin, QIN Hu, Lim, et al. A two stage tabu search algorithm with enhanced packing heuristics for the 3L- CVRP and M3L- CVRP [J]. Computers and Oper- ations Research, 2012, 39(9) : 2178 -2195.
  • 5TAO YI, WANG Fan. An effective tabu search approach with improved loading algorithms for the 3L- CVRP [ J]. Computers and Operations Research, 2015, 55 : 127 - 140.
  • 6Jose Fernando Goncalves, Mauricio G C, Resende. A biased random key genetic algorithm for 2D and 3D bin packing problems [ J ]. Int J Production Economies, 2013, 145(2) : 500 -510.
  • 7Hifi Mhand, Negre St6phane, WU Lei. Hybrid greedy heuristics based on linear programming for the three - di- mensional single bin - size International Transactions 2014, 21(1): 59-79.
  • 8Alvarez -Valdes R, Parrefio F, Tamarit JM. A GRASP Path Relinking algorithm for two - and three -dimen- sional multiple bin - size bin packing problems [ J ]. Computers and Operations Research, 2013, 40 (12) : 3081 - 3090.
  • 9Wu Y, Li W, Goh M, de Souza R. Three dimensional bin packing problem with variable bin height[ J]. Euro- pean Journal of Operational Research, 2010 ;202 : 347 - 55.
  • 10Andreas Bortfeldt, Gerhard Wascher. Container loading problem a state of the art review [ R]. Magdeburg: Otto -von - Guericke - University, 2012.

共引文献51

同被引文献36

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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