A particle swarm approach for flight path optimization in a constrained environment

Blasi, Luciano; Barbato, Simeone; Mattei, M.

doi:10.1016/j.ast.2012.02.021

Cited by 29 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Changing the position and velocity of each particle at each iteration works as follows. Assume that the l-th particle has position vector x l (t) and velocity vector v l (t) [5]. Then, the updated velocity v l (t + 1) will be:…”

Section: Search Algorithmsmentioning

confidence: 99%

Seeking GDOP-optimal Flower Constellations for global coverage problems through evolutionary algorithms

Casanova¹,

Avendaño²,

Mortari³

2014

Aerospace Science and Technology

View full text Add to dashboard Cite

Section: Search Algorithmsmentioning

confidence: 99%

Seeking GDOP-optimal Flower Constellations for global coverage problems through evolutionary algorithms

Casanova¹,

Avendaño²,

Mortari³

2014

Aerospace Science and Technology

View full text Add to dashboard Cite

“…In their experiment, the first-phase heuristic is able to screen out infeasible solutions, and pass the feasible intermediated solution to further optimise with less computational effort. Blasi et al [64] presented a sampling density threshold PSO to avoid the particles crowding problem for a 2-dimensional flight trajectory optimisation which can denote non-circular and concave obstacles taking into account the flight dynamic. The objective of Traffic Management in a Terminal Manoeuvring Area / Terminal Manoeuvring Centre (TMA/TMC) is to maintain a vital balance between smooth air traffic flow and the capacity of surface traffic operation in an airport.…”

Section: Flight Path Optimisationmentioning

confidence: 99%

Review on meta-heuristics approaches for airside operation research

Lee

Chan

et al. 2018

Applied Soft Computing

101

View full text Add to dashboard Cite

The number of publications related to airside operations research is increasing and gaining in popularity. This paper aims to provide researchers with a comprehensive and extensive overview of meta-heuristics application for aviation research, with a particular focus on the airside operations. The scope of airside operations research covers airspace and air traffic flow management, aircraft operation in the terminal manoeuvring area and surface traffic operation. Based on the recent publications related to airside operations, the meta-heuristics approach is a promising approach to enhance the computational efficiency and achieve higher applicable in various decisions in airside operations. However, the literature on airside operations research is quite disjointed and disparate. Therefore, a general taxonomy framework for the airside information system is proposed in order to classify the research systematically and expedites related research and development of engineering applications in the aviation industry. To the best of our knowledge, this is the first review of the field using the meta-heuristics approach. The prominent findings of recent publication and the directions of future research are addressed throughout the review and analysis of the relevant studies.

show abstract

“…Calculus of variation is a technique used to solve the problems appearing in diverse fields, eg., dynamics of rigid body, optimization of orbit [10], flight design [9,13], etc. Optimality conditions and duality results for various classes of nonconvex variational problems have been of much interest in recent years, and several contributions have been made to its development (see, for example, [1,6,12,14,15,20]).…”

Section: Introductionmentioning

confidence: 99%

Exponential type duality for η-approximated variational problems

Jha

Das

Antczak

2020

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

In this article, we use the so-called η-approximation method for solving a new class of nonconvex variational problems with exponential (p, r)-invex functionals. In this approach, we construct η-approximated variational problem and η-approximated Mond-Weir dual variational problem for the considered variational problem and its Mond-Weir dual variational problem. Then several duality results for considered variational problem and its Mond-Weir dual variational problem are proved by the help of duality results established between η-approximated variational problems mentioned above.

show abstract

A particle swarm approach for flight path optimization in a constrained environment

Cited by 29 publications

References 22 publications

Seeking GDOP-optimal Flower Constellations for global coverage problems through evolutionary algorithms

Seeking GDOP-optimal Flower Constellations for global coverage problems through evolutionary algorithms

Review on meta-heuristics approaches for airside operation research

Exponential type duality for η-approximated variational problems

Contact Info

Product

Resources

About