The aircraft scheduling problem (ASP) is a salient problem in airport runway scheduling system. This paper originally proposes an Ant Colony (AC) algorithm based on the wake vortex modeling (WVM) method for ASP. Numer...
详细信息
The aircraft scheduling problem (ASP) is a salient problem in airport runway scheduling system. This paper originally proposes an Ant Colony (AC) algorithm based on the wake vortex modeling (WVM) method for ASP. Numerical results validate that this new method has better performance than CPLEX, general AC algorithm, and approximation algorithm in Ma et al. (2014). It is a promising method to improve the efficiency of the aircraftscheduling system from a theoretical standpoint. (c) 2016 Elsevier B.V. All rights reserved.
The aircraft departure schedulingproblem (ASP) is a salient problem in the airports' runway control system, which proves to be nondeterministic polynomial hard. This paper formulates the ASP in the form of a perm...
详细信息
The aircraft departure schedulingproblem (ASP) is a salient problem in the airports' runway control system, which proves to be nondeterministic polynomial hard. This paper formulates the ASP in the form of a permutation problem and proposes a new approximation algorithm based on sparse optimization to solve it. Then the numerical study is conducted, which validates that this new approximation algorithm has much better performance than ant colony and CPLEX. After that, we consider the ASP in real-time scenario, where the performance of this new algorithm is also good. Finally, some conclusions are summarized, and the future research directions are pointed out.
The aircraft scheduling problem is researched in this paper, the equilibrium model of aircraft scheduling problem is proposed and a sorting algorithm is constructed. By introducing the concept of flight connections, a...
详细信息
ISBN:
(纸本)9783037855447
The aircraft scheduling problem is researched in this paper, the equilibrium model of aircraft scheduling problem is proposed and a sorting algorithm is constructed. By introducing the concept of flight connections, aircraft scheduling problem is transformed into the distribution of flight connections, the mathematical model of the problem is established, to solve the model, a sorting algorithm is constructed. We use the airline's flight data to test the algorithm. The simulation results show that the model and the algorithm are feasible.
Air traffic management relies strongly on the accuracy of prediction, while uncertainties such as weather, navigation accuracy, pilot operations, etc. may weaken the performance of predictive tools and cause potential...
详细信息
Air traffic management relies strongly on the accuracy of prediction, while uncertainties such as weather, navigation accuracy, pilot operations, etc. may weaken the performance of predictive tools and cause potential safety issues or reduced capacity. Among all controlled airspace, the Terminal Maneuvering Area (TMA) is one of the most complex areas in which flight safety can be easily affected by unpredictable disturbances. This paper addresses an aircraftscheduling prob-lem under uncertainty with the aim of providing a robust schedule for arrival flights. Uncertainty quantification and propagation along the routes are realized in a trajectory model that formulates the time information as random variables. Conflict detection and resolution are performed at waypoints of a predefined network based on the predicted time information from the trajectory model. By minimizing the expected number of conflicts, consecutively operated flights can be well separated. Apart from the proposed model, two other models -the deterministic model and a model that incorporates separation buffers -are presented as benchmarks. A meta-heuristic simulated annealing algorithm combined with a time decomposition sliding window is pro-posed for solving a case study of the Paris Charles de Gaulle (CDG) airport. Further, a simulation framework based on the Monte-Carlo approach is implemented so as to evaluate the optimized solutions obtained from the three models. Statistical comparison among the results shows instability of the model that incorporates the separation buffers, in contrast, the proposed model has absolute advantages in both stability and the conflict absorbing ability when uncertainty arises.
In this paper, we deal with the problem of routing and schedulingaircraft ground movement operations. We implement two objective functions: the minimization of total routing taxiing delay and the minimization of poll...
详细信息
In this paper, we deal with the problem of routing and schedulingaircraft ground movement operations. We implement two objective functions: the minimization of total routing taxiing delay and the minimization of pollution emission in terms of total waiting time the engines are turned on. We use alternative graph model to represent the routing solution and to solve the airport ground movement problem. We consider the case study of malpensa terminal maneuvering area, Italy, which implies a peculiar traffic flow management due to its complex layout, where runways and taxi network intersect in many points. Experimental results based on real data are reported, which are promising both for the total routing taxiing delay minimization and the reduction of the pollution emission.
aircraftscheduling is an important factor affecting the operating costs of airlines. Dispatching aircraft reasonably can not only maximize the benefits of the aircraft utilization, but also reduce flight delays. In t...
详细信息
ISBN:
(纸本)9781538629185
aircraftscheduling is an important factor affecting the operating costs of airlines. Dispatching aircraft reasonably can not only maximize the benefits of the aircraft utilization, but also reduce flight delays. In this paper, we first transfer the scuduling model to the postman problem with the network model. Then, a scheduling model that use minimal aircrafts under the giving flight plan is put forward. To solve the model, a scheduling algorithm based on greedy algorithm is designed. After that, at a deeper level, we take the flight delay into consideraton and propose a modified model based on the robustness constrain. Finally, a computational experiment is performed with the data provided by an airline company to show the application of the proposed model and algorithm. Our paper uses the network model to transfer the aircraft scheduling problem to a postman promblem, which considers the connectivity of the airlines. It is remarkable that the paper provides a novel method to solve the aircraft scheduling problem.
This paper presents an optimization method for the aircraft scheduling problem with general runway configurations. Take-offs and landings have to be assigned to a runway and a time while meeting the sequence-dependent...
详细信息
This paper presents an optimization method for the aircraft scheduling problem with general runway configurations. Take-offs and landings have to be assigned to a runway and a time while meeting the sequence-dependent separation requirements and minimizing the costs incurred by delays. Some runways can be used only for take-offs, landings, or certain types of aircraft while schedules for interdependent runways have to consider additional diagonal separation constraints. Our dynamic programming approach solves realistic problem instances to optimality within short computation times. In addition, we propose a rolling planning horizon heuristic for large instances that returns close-to-optimal results. (C) 2016 Elsevier Ltd. All rights reserved.
In this paper we deal with the ground optimization problem, that is the problem of routing and scheduling airplanes surface maneuvering operations. We consider the specific case study of Malpensa Terminal Maneuvering ...
详细信息
ISBN:
(纸本)9781479949236
In this paper we deal with the ground optimization problem, that is the problem of routing and scheduling airplanes surface maneuvering operations. We consider the specific case study of Malpensa Terminal Maneuvering Area (Italy). Our objective function is the minimization of total tardiness. At first a routing problem is solved to assign a path to each aircraft in the terminal, then the schedulingproblem of minimizing the average tardiness is addressed. We model the schedulingproblem as a job-shop schedulingproblem. We develop heuristic procedures based on the alternative graph formulation of the problem to construct and improve feasible solutions. Experimental results based on real data and analysis are reported.
We propose a job-shop scheduling model with sequence dependent set-up times and release dates to coordinate both inbound and outbound traffic flows on all the prefixed routes of an airport terminal area and all aircra...
详细信息
We propose a job-shop scheduling model with sequence dependent set-up times and release dates to coordinate both inbound and outbound traffic flows on all the prefixed routes of an airport terminal area and all aircraft operations at the runway complex. The proposed model is suitable for representing several operational constraints (e.g., longitudinal and diagonal separations in specific airspace regions), and different runway configurations (e.g., crossing, parallel, with or without dependent approaches) in a uniform framework. The complexity and the highly dynamic nature of the problem call for heuristic approaches. We propose a fast dynamic local search heuristic algorithm for the job-shop model suitable for considering one of the different performance criteria and embedding aircraft position shifting control technique to limit the controllers/pilots' workload. Finally, we describe in detail the experimental analysis of the proposed model and algorithm applied to two real case studies of Milan-Malpensa and Rome-Fiumicino airport terminal areas.
暂无评论