Research on Aircraft stands Assignment Problem Based on Genetic Particle Swarm Algorithm
In order to ensure the rational allocation and efficient utilization of airport apron resources,this study analyzes the safety operational rules in the apron allocation process.It considers constraints such as matching aircraft stand sizes,safety time intervals between the same apron and adjacent aprons.A multi-objective optimization model is developed to minimize the number of remote aprons and minimize the idle time of nearby aprons.A novel approach to apron allocation and optimization is proposed,combining the advantages of Genetic Algorithm(GA)and Particle Swarm Optimization(PSO)into a Genetic Particle Swarm Optimization(GAPSO)algorithm.The adaptive limitation on the particle velocity update is also improved.The simulation results demonstrate that the GAPSO algorithm performs better in terms of remote apron allocation and idle time of nearby aprons.It exhibits faster convergence speed and stronger global optimization ability,thereby enhancing the efficiency of aviation transportation and providing practical significance to airport management and apron resource allocation.
Aircraft stands assignmentGenetic-particle swarm optimizationAircraft position matchHybrid algo-rithm
万方数据
维普
