scholarly journals An Efficient Approximation Algorithm for Aircraft Arrival Sequencing and Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Weimin Ma ◽  
Bo Xu ◽  
Ming Liu ◽  
Hui Huang
Keyword(s):  
Approximation Algorithm ◽  
Numerical Study ◽  
Scheduling Problem ◽  
Np Hard ◽  
Scheduling System ◽  
Efficient Approximation Algorithm ◽  
Sequencing And Scheduling ◽  
Permutation Problem ◽  
Efficient Approximation ◽  
Runway Scheduling

The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in airports' runway scheduling system, which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS in the form of a constrained permutation problem and designs a new approximation algorithm to solve it. Then the numerical study is conducted, which validates that this new algorithm has much better performance than ant colony (AC) algorithm and CPLEX, especially when the aircraft types are not too many. In the end, some conclusions are summarized.

AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES

1993 ◽  
Vol 03 (04) ◽  
pp. 417-428 ◽  
Author(s):  
TEOFILO F. GONZALEZ ◽  
MOHAMMADREZA RAZZAZI ◽  
SI-QING ZHENG
Keyword(s):  
Approximation Algorithm ◽  
Time Complexity ◽  
Optimal Solution ◽  
Divide And Conquer ◽  
Problem Instance ◽  
Np Hard ◽  
Approximation Bound ◽  
Efficient Approximation Algorithm ◽  
Efficient Approximation ◽  
Interior Points

Let P be a set of n points located inside a d-box (rectangle if d=2) R. We study the problem of partitioning R into d-boxes by introducing a set of hyperplane (line if d=2) segments of least total (d-1)–volume (length if d=2). Each of the resulting d-boxes in a valid partition cannot contain points from P as interior points. Since this problem is computationally intractable (NP-hard) even when d=2, we present an efficient approximation algorithm for its solution. The partition generated by our approximation algorithm is guaranteed to be within 2d times the optimal solution value. We also present a problem instance for each d≥2 for which the approximation bound is tight for the algorithm. The time complexity for our algorithm is O(dn log n).

Sign in / Sign up

Export Citation Format

Share Document