Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective funct...Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.展开更多
Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating mod...Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance.展开更多
In the real-world situation,the lunar missions’scale and terrain are different according to various operational regions or worksheets,which requests a more flexible and efficient algorithm to generate task paths.A mu...In the real-world situation,the lunar missions’scale and terrain are different according to various operational regions or worksheets,which requests a more flexible and efficient algorithm to generate task paths.A multi-scale ant colony planning method for the lunar robot is designed to meet the requirements of large scale and complex terrain in lunar space.In the algorithm,the actual lunar surface image is meshed into a gird map,the path planning algorithm is modeled on it,and then the actual path is projected to the original lunar surface and mission.The classical ant colony planning algorithm is rewritten utilizing a multi-scale method to address the diverse task problem.Moreover,the path smoothness is also considered to reduce the magnitude of the steering angle.Finally,several typical conditions to verify the efficiency and feasibility of the proposed algorithm are presented.展开更多
Due to the ever-increasing air traffic flow,the influence of aircraft noise around the airport has become significant.As most airlines are trying to decrease operation cost,stringent requirements for more simple and e...Due to the ever-increasing air traffic flow,the influence of aircraft noise around the airport has become significant.As most airlines are trying to decrease operation cost,stringent requirements for more simple and efficient departure trajectory are on a rise.Therefore,a departure trajectory design was established for performancebased navigation technology,and a multi-objective optimization model was developed,with constraints of safety and noise influence,as well as optimization targets of efficiency and simplicity.An improved ant colony algorithm was then proposed to solve the optimization problem.Finally,an experiment was conducted using the Lanzhou terminal airspace operation data,and the results showed that the designed departure trajectory was feasible and efficient in decreasing the aircraft noise influence.展开更多
In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) ...In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC.展开更多
Based on ADS-B surveillance data,this paper proposes a multi-unmanned aerial vehicle(multi-UAV)collision detection method based on linear extrapolation for ground-based UAV collision detection and resolution,thus to p...Based on ADS-B surveillance data,this paper proposes a multi-unmanned aerial vehicle(multi-UAV)collision detection method based on linear extrapolation for ground-based UAV collision detection and resolution,thus to provide early warning of possible conflicts.To address the problem of multi-UAV conflict,the basic ant colony algorithm is introduced.The conflict simplification model of the traditional basic ant colony algorithm is optimized by adding a speed regulation strategy.A multi-UAV conflict resolution scheme is presented based on speed regulation and heading strategies.The ant colony algorithm is improved by adding angle information and a queuing system.The results show that the improved ant colony algorithm can provide multi-UAV joint escape routes for a multi-UAV conflict situation in airspace.Unlike the traditional ant colony algorithm,our approach converges to the optimization target.The time required for the calculation is reduced by 43.9%,and the total delay distance caused by conflict resolution is reduced by 58.4%.展开更多
With the rapid growth of the number and flight time of unmanned aerial vehicles(UAVs),safety accidents caused by UAVs flight risk is increasing gradually.Safe air route planning is an effective means to reduce the ope...With the rapid growth of the number and flight time of unmanned aerial vehicles(UAVs),safety accidents caused by UAVs flight risk is increasing gradually.Safe air route planning is an effective means to reduce the operational risk of UAVs at the strategic level.The optimal air route planning model based on ground risk assessment is presented by considering the safety cost of UAV air route.Through the rasterization of the ground surface under the air route,the safety factor of each grid is defined with the probability of fatality on the ground per flight hour as the quantitative index.The air route safety cost function is constructed based on the safety factor of each grid.Then,the total cost function considering both air route safety and flight distance is established.The expected function of the ant colony algorithm is rebuilt and used as the algorithm to plan the air routes.The effectiveness of the new air route planning model is verified through the logistical distribution scenario on urban airspace.The results indicate that the new air route planning model considering safety factor can greatly improve the overall safety of air route under small increase of the total flight time.展开更多
Engineering change management is a special form of problem solving where many rules must be followed to satisfy the requirements of product changes.As engineering change has great influence on the cycle and the cost o...Engineering change management is a special form of problem solving where many rules must be followed to satisfy the requirements of product changes.As engineering change has great influence on the cycle and the cost of product development,it is necessary to anticipate design changes(DCs)in advance and estimate the influence effectively.A process simulation-based method for engineering change management is proposed incorporating multiple assessment parameters.First,the change propagation model is established,which includes the formulation of change propagation influence,assessment score of DC solution.Then the optimization process of DC solution is introduced based on ant colony optimization(ACO),and an optimization algorithm is detailed to acquire the optimal DC solution automatically.Finally,a case study of belt conveyor platform is implemented to validate the proposed method.The results show that changed requirement of product can be satisfied by multiple DC solutions and the optimal one can be acquired according to the unique characteristics of each solution.展开更多
Batteries transfer management is one important aspect in electric vehicle(EV)network's intelligent operation management system.Batteries transfer is a special and much more complex VRP(Vehicle Routing Problem) whi...Batteries transfer management is one important aspect in electric vehicle(EV)network's intelligent operation management system.Batteries transfer is a special and much more complex VRP(Vehicle Routing Problem) which takes the multiple constraints such as dynamic multi-depots,time windows,simultaneous pickups and deliveries,distance minimization,etc.into account.We call it VRPEVB(VRP with EV Batteries).This paper,based on the intelligent management model of EV's battery power,puts forward a battery transfer algorithm for the EV network which considers the traffic congestion that changes dynamically and uses improved Ant Colony Optimization.By setting a reasonable tabv range,special update rules of the pheromone and path list memory functions,the algorithm can have a better convergence,and its feasibility is proved by the experiment in an EV's demonstration operation system.展开更多
Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexi...Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexity.A scientific and rational sectorization of TMA can optimize airspace resources,and sufficiently utilize the control of human resources to ensure the safety of TMA.The functional sectorization model was established based on the route structure of arriving and departing aircraft as well as controlling requirements.Based on principles of sectorization and topological relations within a network,the arrival and departure sectorization model was established,using tree based ant colony algorithm(ACO)searching.Shanghai TMA was taken as an example to be sectorizaed,and the result showed that this model was superior to traditional ones when arrival and departure routes were separated at dense airport terminal airspace.展开更多
By considering energy-efficient anycast routing in wireless sensor network （WSN）, and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm （...By considering energy-efficient anycast routing in wireless sensor network （WSN）, and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm （SWPAR） with multi-sink nodes is pro- posed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol （SARP） and the hierarchy-based anyeast routing protocol （HARP）, the proposed algorithm improves network lifetime and reduces power consumption.展开更多
基金supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)
文摘Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.
基金Sponsored by the National High Technology Research and Development Program of China(2006AA701306)the National Innovation Foundation of Enterprises(05C26212200378)
文摘Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance.
基金supported by the National Natural Science Foundations of China(No.11772185)Fundamental Research Funds for the Central Universities(No.3072022JC0202)。
文摘In the real-world situation,the lunar missions’scale and terrain are different according to various operational regions or worksheets,which requests a more flexible and efficient algorithm to generate task paths.A multi-scale ant colony planning method for the lunar robot is designed to meet the requirements of large scale and complex terrain in lunar space.In the algorithm,the actual lunar surface image is meshed into a gird map,the path planning algorithm is modeled on it,and then the actual path is projected to the original lunar surface and mission.The classical ant colony planning algorithm is rewritten utilizing a multi-scale method to address the diverse task problem.Moreover,the path smoothness is also considered to reduce the magnitude of the steering angle.Finally,several typical conditions to verify the efficiency and feasibility of the proposed algorithm are presented.
文摘Due to the ever-increasing air traffic flow,the influence of aircraft noise around the airport has become significant.As most airlines are trying to decrease operation cost,stringent requirements for more simple and efficient departure trajectory are on a rise.Therefore,a departure trajectory design was established for performancebased navigation technology,and a multi-objective optimization model was developed,with constraints of safety and noise influence,as well as optimization targets of efficiency and simplicity.An improved ant colony algorithm was then proposed to solve the optimization problem.Finally,an experiment was conducted using the Lanzhou terminal airspace operation data,and the results showed that the designed departure trajectory was feasible and efficient in decreasing the aircraft noise influence.
文摘In this paper, recent developments of some heuristic algorithms were discussed. The focus was laid on the improvements of ant-cycle (AC) algorithm based on the analysis of the performances of simulated annealing (SA) and AC for the traveling salesman problem (TSP). The Metropolis rules in SA were applied to AC and turned out an improved AC. The computational results obtained from the case study indicated that the improved AC algorithm has advantages over the sheer SA or unmixed AC.
基金supported by the National Natural Science Foundation of China (No. 61773202)the National Key Laboratory of Air Traffic Control (No.SKLATM201706)the Sichuan Science and Technology Plan Project(No. 2018JZ0030).
文摘Based on ADS-B surveillance data,this paper proposes a multi-unmanned aerial vehicle(multi-UAV)collision detection method based on linear extrapolation for ground-based UAV collision detection and resolution,thus to provide early warning of possible conflicts.To address the problem of multi-UAV conflict,the basic ant colony algorithm is introduced.The conflict simplification model of the traditional basic ant colony algorithm is optimized by adding a speed regulation strategy.A multi-UAV conflict resolution scheme is presented based on speed regulation and heading strategies.The ant colony algorithm is improved by adding angle information and a queuing system.The results show that the improved ant colony algorithm can provide multi-UAV joint escape routes for a multi-UAV conflict situation in airspace.Unlike the traditional ant colony algorithm,our approach converges to the optimization target.The time required for the calculation is reduced by 43.9%,and the total delay distance caused by conflict resolution is reduced by 58.4%.
基金This work is supported by the Scientific Research Project of Tianjin Education Commission(No.2019KJ128).
文摘With the rapid growth of the number and flight time of unmanned aerial vehicles(UAVs),safety accidents caused by UAVs flight risk is increasing gradually.Safe air route planning is an effective means to reduce the operational risk of UAVs at the strategic level.The optimal air route planning model based on ground risk assessment is presented by considering the safety cost of UAV air route.Through the rasterization of the ground surface under the air route,the safety factor of each grid is defined with the probability of fatality on the ground per flight hour as the quantitative index.The air route safety cost function is constructed based on the safety factor of each grid.Then,the total cost function considering both air route safety and flight distance is established.The expected function of the ant colony algorithm is rebuilt and used as the algorithm to plan the air routes.The effectiveness of the new air route planning model is verified through the logistical distribution scenario on urban airspace.The results indicate that the new air route planning model considering safety factor can greatly improve the overall safety of air route under small increase of the total flight time.
基金supported by the National Natural Science Foundation of China(No.51805253)Research Start-up Fund Project of Introduced Talent(No.YKJ201969)Equipment Project of Ship Assembly and Construction for the Ministry of Industry and Information Technology(No.TC190H47J)。
文摘Engineering change management is a special form of problem solving where many rules must be followed to satisfy the requirements of product changes.As engineering change has great influence on the cycle and the cost of product development,it is necessary to anticipate design changes(DCs)in advance and estimate the influence effectively.A process simulation-based method for engineering change management is proposed incorporating multiple assessment parameters.First,the change propagation model is established,which includes the formulation of change propagation influence,assessment score of DC solution.Then the optimization process of DC solution is introduced based on ant colony optimization(ACO),and an optimization algorithm is detailed to acquire the optimal DC solution automatically.Finally,a case study of belt conveyor platform is implemented to validate the proposed method.The results show that changed requirement of product can be satisfied by multiple DC solutions and the optimal one can be acquired according to the unique characteristics of each solution.
基金supported by the 973 Program under Grant No.2011CB302506, 2012CB315802National Key Technology Research and Development Program of China under Grant No.2012BAH94F02+5 种基金The 863 Program under Grant No.2013AA102301NNSF of China under Grant No.61132001, 61170273Program for New Century Excel-lent Talents in University under Grant No. NCET-11-0592Project of New Generation Broad band Wireless Network under Grant No.2014ZX03006003The Technology Development and Experiment of Innovative Network Architecture(CNGI-12-03-007)The Open Fund Project of CAAC InformationTechnology Research Base(CAACITRB-201201)
文摘Batteries transfer management is one important aspect in electric vehicle(EV)network's intelligent operation management system.Batteries transfer is a special and much more complex VRP(Vehicle Routing Problem) which takes the multiple constraints such as dynamic multi-depots,time windows,simultaneous pickups and deliveries,distance minimization,etc.into account.We call it VRPEVB(VRP with EV Batteries).This paper,based on the intelligent management model of EV's battery power,puts forward a battery transfer algorithm for the EV network which considers the traffic congestion that changes dynamically and uses improved Ant Colony Optimization.By setting a reasonable tabv range,special update rules of the pheromone and path list memory functions,the algorithm can have a better convergence,and its feasibility is proved by the experiment in an EV's demonstration operation system.
基金supported by the National Natural Science Foundation of China(Nos.U1233101,71271113)the Fundamental Research Funds for the Central Universities(No.NS2016062)
文摘Terminal airspace(TMA)is the airspace centering several military and civil aviation airports with complex route structure,limited airspace resources,traffic flow,difficult management and considerable airspace complexity.A scientific and rational sectorization of TMA can optimize airspace resources,and sufficiently utilize the control of human resources to ensure the safety of TMA.The functional sectorization model was established based on the route structure of arriving and departing aircraft as well as controlling requirements.Based on principles of sectorization and topological relations within a network,the arrival and departure sectorization model was established,using tree based ant colony algorithm(ACO)searching.Shanghai TMA was taken as an example to be sectorizaed,and the result showed that this model was superior to traditional ones when arrival and departure routes were separated at dense airport terminal airspace.
基金The Grand Fundamental Advanced Research of Chinese National Defense (No.S0500A001)
文摘By considering energy-efficient anycast routing in wireless sensor network （WSN）, and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm （SWPAR） with multi-sink nodes is pro- posed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol （SARP） and the hierarchy-based anyeast routing protocol （HARP）, the proposed algorithm improves network lifetime and reduces power consumption.
