A Combinatorial model to optimize air traffic flow management problems

García-Heredia, David; Alonso‐Ayuso, Antonio; Molina, Elisenda

doi:10.1016/j.cor.2019.104768

Cited by 20 publications

(10 citation statements)

References 64 publications

(107 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ATFM problems have a very specific cost structure, as described in (García-Heredia et al, 2019). To test the sensitivity of Gurobi to the cost structure in the IP formulation, we generated costs from a continuous uniform distribution (0, 100) for the arcs in the networks in our problem test set.…”

Section: Integer Programming Resultsmentioning

confidence: 99%

“…The ATFM problem has appeared in the literature (see for instance Bertsimas & Patterson (1998), Bertsimas, Lulli & Odoni (2011 or Agustín, Alonso-Ayuso, Escudero & Pizarro ( 2012)), but only once has been formulated as a SRC-MSPP (García-Heredia et al, 2019). In this approach, each aircraft corresponds to a network where the potential modifications to the flight plan are the arcs.…”

Section: Computational Experiencementioning

confidence: 99%

See 1 more Smart Citation

A solution method for the shared resource-constrained multi-shortest path problem

García-Heredia

Molina

Laguna

et al. 2021

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

We tackle the problem of finding, for each network within a collection, the shortest path between two given nodes, while not exceeding the limits of a set of shared resources. We present an integer programming (IP) formulation of this problem and propose a parallelizable matheuristic consisting of three phases: 1) generation of feasible solutions, 2) combination of solutions, and 3) solution improvement. We show that the shortest paths found with our procedure correspond to the solution of the Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) and that a particular case of the RCMPSP occurs in Air Traffic Flow Management (ATFM). Our computational results include finding optimal solutions to small and medium-size ATFM instances by applying Gurobi to the IP formulation. We use those solutions to assess the quality of the output produced by our proposed matheuristic. For the largest instances, which correspond to actual flight plans in ATFM, exact methods fail and we assess the quality of our solutions by means of Lagrangian bounds. Computational results suggest that the proposed procedure is an effective approach to the family of shortest path problems that we discuss here.

show abstract

Section: Integer Programming Resultsmentioning

confidence: 99%

Section: Computational Experiencementioning

confidence: 99%

A solution method for the shared resource-constrained multi-shortest path problem

García-Heredia

Molina

Laguna

et al. 2021

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…As it is known, the methods of mathematic modelling can significantly help in the traffic control, for example research papers [3][4][5][6].…”

Section: The Major Factors Influencing Traffic Controlmentioning

confidence: 99%

Optimization model of transport traffic at preliminary registration of queries based on controlled queueing models

Kondrashova

2020

E3S Web Conf.

View full text Add to dashboard Cite

The paper is devoted to the model of transport traffic optimization with use of preliminary registration. Preliminary registration of applications for entrance to a certain road-zone in certain time intervals can optimize a road situation and reduce traffic jams. The optimization is based on the controlled queueing model theory, controlled arrival-flow. As a result the transport flow becomes “predictable” and “controlled” thanks to preliminary information, using Internet-services. Algorithmization of model and also the main structure is presented. The example of control on the basis of controlled queueing model is given.

show abstract

“…In specific, a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is used to further address ATFNRP via a proposed multi-objective model. Similarly, García-Heredia et al [11] took the fair distribution of delays between different flights as one of the coefficients defined in the objective function of a combinatorial optimization model for the ATFMRP. It is contended that the proposed model is flexible to fixing coefficients in the objective function such that corresponding considerations in the ATFMRP environment is well-accounted for, unlike Bertsimas et al's [9] and Agustín et al's [12] prior models.…”

Section: Introductionmentioning

confidence: 99%

“…In other words, the use of the proposed model provides a straightforward feasible solution on the set of alternate routes that corresponds to the safety objectives under system constraints. Other solution approaches that attempt to address rerouting problem at either a general or specific view, for instance, a dynamic, multicommodity, integer network flow model [8], MOEA/D [10], and a combinatorial optimization model [11] is not able to directly point out an alternate route to take during disruptions. Nevertheless, these models are framed to generally address objectives in total delays and its associated costs.…”

Section: Introductionmentioning

confidence: 99%

An Integer Linear Programming Formulation for Post-Departure Air Traffic Flow Management

Bongo

2021

AEJ

View full text Add to dashboard Cite

The air transportation domain faces issues in air traffic congestion which leads to delays affecting a network of flights. As stakeholders strive to address such issue by applying air traffic flow management (ATFM) actions, there exists an apparent divide in the solution objective and perspectives. In the extant literature, solution approaches involving ATFM actions are often framed from the perspective of only one stakeholder to another. Such a scheme does not comprehensively cover the overall goal of the stakeholders, thus, provides inadequate, even conflicting, solutions. Therefore, this paper proposes an integer linear programming model for a rerouting problem that satisfactorily incorporates the individual interests of stakeholders (i.e., airport management, airline sector, air traffic management) in the commercial aviation industry and the common goal of ensuring safety in flight operations. The proposed model is designed to tactically select an alternate route when the primary route is constrained due to uncertainties such as inclement weather in a post-departure scenario. A hypothetical case study involving multiple destinations and alternate routes is carried out to illustrate the validity of the model. A Demo version of Lingo software is used to run the proposed model. Notable computational results show significant differences of selected routes as individual system interests are taken into isolation compared to when the general, collaborative model is implemented. In other words, the proposed model is able to show that preferences in alternate routes do vary with the individual interests of stakeholders, more so with the integration of the collaborative decision among stakeholders. Therefore, this research work provides a groundwork to a more comprehensive take of managing air traffic scenario involving all phases of flights. This is realized by providing a proof that significant shifts of decision solutions occur when the overall goal of stakeholders is considered rather than taking their individual interests into isolation.

show abstract

A Combinatorial model to optimize air traffic flow management problems

Cited by 20 publications

References 64 publications

A solution method for the shared resource-constrained multi-shortest path problem

A solution method for the shared resource-constrained multi-shortest path problem

Optimization model of transport traffic at preliminary registration of queries based on controlled queueing models

An Integer Linear Programming Formulation for Post-Departure Air Traffic Flow Management

Contact Info

Product

Resources

About