This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem.
The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been wid... more The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been widely explored and a variety of approaches have been investigated and developed. ALP is an NP-hard problem that deals in assigning an arriving aircraft to an available runway and a landing time. The landing time for each aircraft must be within a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time, an additional cost will be imposed that is determined by the amount of earliness and lateness of the actual landing time. The objective is to minimize the overall cost, i.e., the deviation from a preferred target time of each aircraft. This paper centers on reviewing optimization approaches as state-of-the-art algorithms proposed to ALP that are tested on OR-library datasets. These algorithms are analyzed in three categories, namely, exact, approximate and hybrid approaches. Finally, possible suggestions for future studies are obtained from this survey.
This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem.
The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been wid... more The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been widely explored and a variety of approaches have been investigated and developed. ALP is an NP-hard problem that deals in assigning an arriving aircraft to an available runway and a landing time. The landing time for each aircraft must be within a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time, an additional cost will be imposed that is determined by the amount of earliness and lateness of the actual landing time. The objective is to minimize the overall cost, i.e., the deviation from a preferred target time of each aircraft. This paper centers on reviewing optimization approaches as state-of-the-art algorithms proposed to ALP that are tested on OR-library datasets. These algorithms are analyzed in three categories, namely, exact, approximate and hybrid approaches. Finally, possible suggestions for future studies are obtained from this survey.
This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem. It deals with assigning landing times and runways for a set of arrival aircrafts. Each aircraft has its predefined target landing time within a time window, and a separation time between each successive pairs of aircrafts. The objective of ALS problem is to minimize the deviation from the target landing time of each aircraft subject to a set of constraints. The performance of the proposed algorithm is evaluated on thirteen benchmark instances ranging from 10 to 500 aircrafts, and 1 to 5 runways. The results show that the proposed algorithm works considerably well on small-sized instances.
One of the most challenging optimization problems in air traffic control is minimizing the deviat... more One of the most challenging optimization problems in air traffic control is minimizing the deviation of aircraft arrival times from its target landing time. This can be achieved by efficiently allocating landing times and runways to the arriving aircraft. This problem is called the Aircraft Landing Problem (ALP). To address the ALP, this paper proposes a new approach which combines the Simulated Annealing (SA) algorithm with an exact timing method. The problem is solved in two stages: first, the optimal sequence is generated using the SA; in the second stage, the optimal landing time is determined using the exact timing method. The proposed approach is tested with 500 aircraft and a single runway using a well-known benchmark dataset from the scientific literature. The obtained results demonstrated the ability of the proposed approach to generate promising and competitive results.
This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem.
The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been wid... more The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been widely explored and a variety of approaches have been investigated and developed. ALP is an NP-hard problem that deals in assigning an arriving aircraft to an available runway and a landing time. The landing time for each aircraft must be within a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time, an additional cost will be imposed that is determined by the amount of earliness and lateness of the actual landing time. The objective is to minimize the overall cost, i.e., the deviation from a preferred target time of each aircraft. This paper centers on reviewing optimization approaches as state-of-the-art algorithms proposed to ALP that are tested on OR-library datasets. These algorithms are analyzed in three categories, namely, exact, approximate and hybrid approaches. Finally, possible suggestions for future studies are obtained from this survey.
This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem.
The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been wid... more The Aircraft Landing Problem (ALP) is an important element in airport operations. It has been widely explored and a variety of approaches have been investigated and developed. ALP is an NP-hard problem that deals in assigning an arriving aircraft to an available runway and a landing time. The landing time for each aircraft must be within a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time, an additional cost will be imposed that is determined by the amount of earliness and lateness of the actual landing time. The objective is to minimize the overall cost, i.e., the deviation from a preferred target time of each aircraft. This paper centers on reviewing optimization approaches as state-of-the-art algorithms proposed to ALP that are tested on OR-library datasets. These algorithms are analyzed in three categories, namely, exact, approximate and hybrid approaches. Finally, possible suggestions for future studies are obtained from this survey.
This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landin... more This paper proposes a Harmony Search (HS) algorithm to solve the multiple runways aircraft landing scheduling (ALS) problem. ALS is a combinatorial optimization problem that has been recognized as an NP-hard problem. It deals with assigning landing times and runways for a set of arrival aircrafts. Each aircraft has its predefined target landing time within a time window, and a separation time between each successive pairs of aircrafts. The objective of ALS problem is to minimize the deviation from the target landing time of each aircraft subject to a set of constraints. The performance of the proposed algorithm is evaluated on thirteen benchmark instances ranging from 10 to 500 aircrafts, and 1 to 5 runways. The results show that the proposed algorithm works considerably well on small-sized instances.
One of the most challenging optimization problems in air traffic control is minimizing the deviat... more One of the most challenging optimization problems in air traffic control is minimizing the deviation of aircraft arrival times from its target landing time. This can be achieved by efficiently allocating landing times and runways to the arriving aircraft. This problem is called the Aircraft Landing Problem (ALP). To address the ALP, this paper proposes a new approach which combines the Simulated Annealing (SA) algorithm with an exact timing method. The problem is solved in two stages: first, the optimal sequence is generated using the SA; in the second stage, the optimal landing time is determined using the exact timing method. The proposed approach is tested with 500 aircraft and a single runway using a well-known benchmark dataset from the scientific literature. The obtained results demonstrated the ability of the proposed approach to generate promising and competitive results.
Uploads
Papers by omar salim