Integration of colonial competition algorithm and quick selection of preparation time in solving the aircraft sequence planning problem

Number of pages: 79 File Format: word File Code: 31059
Year: 2014 University Degree: Master's degree Category: IT Information Technology Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Integration of colonial competition algorithm and quick selection of preparation time in solving the aircraft sequence planning problem

    Master's Thesis

    Abstract

    Air traffic management is one of the sensitive and stressful jobs that face various problems and obstacles every day, and the Aircraft Sequencing Problem is one of the most important issues that are addressed in the field of Air Traffic Control.

    The aircraft sequencing problem is an NP-hard problem. they lose in high dimensions and cannot achieve the optimal solution in an acceptable time; As a result, nowadays, heuristic and meta-heuristic algorithms are used to solve such problems.

    In this thesis, by combining the ERT (Earliest Ready Time) algorithm to select the best ready-to-operate aircraft with the modified colonial algorithm that uses the random nearest neighbor method for the absorption function along with the triangle improving method for the revolution function, a new method is presented in solving the aircraft sequence problem. The results of the implementation of this algorithm show that it is highly efficient compared to other algorithms. Keywords: airplane landing sequence, corrective colonial competition algorithm, air traffic management, quick preparation time selection algorithm. With the arrival of different planes in the airport's radar range, the flight attendants in the control tower must determine the order of landing of the planes that are flying in the airport's sky at that moment. In order to allocate such a landing order, various limitations are taken into consideration, among which the limitation of separation of two planes can be mentioned. This restriction is very important from the point of view of aerodynamic issues, and if it is not observed, there is a possibility of an accident for successive planes.

    The most important result of planning the landing of planes is to minimize the delays, which prevents additional fuel costs for the planes, as well as the dissatisfaction of the passengers. Since the costs related to the fuel of the flight fleet include a significant percentage of the costs of the airlines, the planning of the landing of the planes has been taken into consideration by the airlines as well as the airport companies. This has caused most airports that perform better in terms of flight traffic management to attract the attention of more airlines. On the other hand, in case of achieving a suitable performance in flight traffic management, airport companies will have the possibility to receive more planes in a fixed time period.

    Airport companies get part of their income from the parking fee[1]. The cost of parking spaces varies depending on its facilities. Facilities such as ground electricity [2] or passenger entrances [3] have an effect on the price of the parking space. There are two types of parking spaces in all airports in the world. Parking space with passenger entrance and parking space away from the hall [4]. A parking space with a passenger entrance, or another name for a parking space with a connecting hose, is a parking space where the passengers of an airplane enter or leave the plane without the need to enter the airport area directly using a corridor (connecting hose). But the planes located in the second parking lot of the hall need a bus service [5] to pick up or drop off their passengers. Among these two types of parking spaces, the parking space with passenger entrance has a higher price. The price of these seats is calculated in such a way that a fixed amount is received from the relevant airline for every passenger who uses a plane from the passenger entrance, compared to which the price of the bus service is insignificant. Despite the higher price of the parking space with passenger entrance, airlines prefer to assign their planes to the parking space with passenger entrance in order to get more satisfaction from their passengers. The parking lot with the passenger entrance also has a safety advantage, by using the passenger entrance, there are no more risks caused by the presence of passengers in the airport area and various incidents are prevented.

    Given that when the airline contracts with the airports, the airlines cannot declare conditions regarding the type of parking space and the type of parking space of an aircraft is the responsibility of the airport controller at the moment of landing of the plane; Therefore, in the case of proper planning, more planes can be allocated to the parking lots with passenger entrances and in this way help to increase the airport's income.

    According to the above, the management of airports in order to attract airlines and also increase their income should be able to create a balance between the two issues of traffic control of incoming airplanes (the landing sequence of airplanes) and the allocation of airplanes to passenger entrances so that in addition to increasing their income, they can satisfy their customers (airline companies). keep But the only problem in this field is the high dependence of these two issues on each other. This means that the planes must be assigned a parking space as soon as they land at the airport, and that parking space must be empty and ready for service at the moment of landing. Or in other words, sometimes the landing of a plane with a delay of a few minutes will cause a parking space with passenger entrance to be empty, and by assigning this plane to the same space, the airport's income will increase; But airports should always keep in mind that the amount of this delay has a direct impact on the satisfaction of airlines. In this chapter, we have an overview of the literature on these two topics. 1-2- Outline of the topic In the United States, it is estimated that the cost of domestic flight delays is about 3.5 billion dollars per year, which will result in a large financial burden with the increase in commercial competition between different airlines. As a result, the planning and sequencing of flights has become one of the most important work issues in the field of flight maintenance. To face this problem and in the situation where the airport has several runways, different algorithms are used. The planning of incoming flights for several runways is a function of the allocation of incoming flights to different runways in an airport, so that the sequence of incoming flights and their landing time reduces flight delays by maintaining the standard separation between flights and the available capacity at the airport.

    To solve the ASP problem in airports with multiple runways, a simple solution called first-in-first-served [6] (FCFS) is used, which is based on the landing time. Scheduled [7] (PLTs) at that airport. Figure 1-1 shows a simple example of solving the problem using the FCFS method

    (images are available in the main file)

    Figure 1-1- Solving the ASP problem using the FCFS method

    However, in determining the order of arrival of flights and choosing the appropriate landing strip to reduce the flight delay, they consider the landing time interval [8] (LTI), which shows the minimum acceptable separation time for two flights entering a runway in a row gives Basically, LTI is a variable quantity because:

    To maintain the safety of flights, it is necessary that two flights of the same height have a minimum horizontal separation based on the type of aircraft and their actual position.

    The speed of each aircraft during landing is different.

    The facilities and equipment of each runway are effective in determining the LTI time.

    Table 1-1 is an example of the minimum LTI time related to different types. It shows passenger planes. As you can see, this table is asymmetric, so that the LTI time of the B727 behind the B747 is 200 seconds, while only 70 seconds are needed in the situation where the order of the two planes is moved. Although the FCFS solution respects justice based on PLT, but due to the asymmetry of LTI time, by moving the position of the aircraft in the entry queue of each runway or by moving them between the rows of different runways, flight delays can be reduced and the flight capacity of the airport can be increased. Check at the desired airport. Since safety is guaranteed with LTI, then the objective function for this problem needs to be obtained on the efficiency of airport operations and accuracy in servicing flights.

  • Contents & References of Integration of colonial competition algorithm and quick selection of preparation time in solving the aircraft sequence planning problem

    List:

    Introduction of the proposed plan.. 1

    1-1- Introduction.. 2

    1-2- Subject plan.. 4

    1-3- Assumptions, limitations. 6

    1-4- Research objectives.. 8

    5-1- An aspect of newness and innovation. 9

    6-1- The results of the research. 9

    1-7- The structure of the thesis.. 10

    2- Review of past works. 11

    2-1- Introduction.. 12

    2-2- Aircraft landing sequence. 12

    2-3- Allocating passenger entry. 15

    2-4- The background of the research.. 17

    2-5- The linear programming model of the program. 21

    3- Proposed method.. 25

    3-1- Proposed solution.. 26

    3-2- Evolutionary algorithm.. 26

    3-2-1- Introduction.. 26

    3-2-2- The reason for using evolutionary algorithms. 29

    3-2-3- types of evolutionary algorithms. 29

    3-3- Colonial competition algorithm. 32

    3-3-1- Formation of the early empire. 34

    3-3-2- Modeling the recruitment policy. 38

    3-3-3- Changing the position of the colony and the imperialist. 41

    3-3-4- The total power of an empire. 42

    3-3-5- Colonial competition. 43

    3-3-6- The fall of weak empires. 46

    3-3-7- Convergence.. 46

    3-4- Corrective colonial competition algorithm. 48

    5-3- Combined algorithms used. 51

    4- System evaluation.. 53

    4-1- Introduction.. 54

    4-2- Modeling of the proposed method. 55

    4-3- Evaluation of the proposed solution. 56

    4-4- Comparative issues. 59 4-4-1- Comparison of the results of incoming and outgoing flights in the number of 15. 59 4-4-2- Comparison of the results of incoming and outgoing flights in the number of 20. 61 4-4-3- Comparison of the results of incoming and outgoing flights in the number of 25. 62 5- Conclusion and presentation of suggestions. 64

    5-1- The aspect of innovation.. 65

    5-2- The result of comparing the results. 65

    5-3- Suggestions.. 66

    6- References.. 67

     

    Source:

     

    David Gianazza, Kevin Guittet. (2009). Selection and evaluation of air traffic complexity metrics. Nils Boysen, Malte Fliedner. (2011). Scheduling aircraft landings to balance workload of ground staff. Computers & Industrial Engineering 60,206-217

    David Gianazza, Jean-Marc Alliot, Géraud Granger. (2012).Optimal combinations of Air Traf?c Control sectors using classical and stochastic methods

    M.A.Christodoulou and C.Kontogeorgou. (2008). A novel algorithm for collision avoidance in commercial aircraft using neural networks and non-linear programming. 16th Mediterranean Conference on Control and Automation Congress Center, 25-27

    Gustafsolveling, Senay Solak, John-Paul B. Clarke, Ellis L. Johnson. (2011). Scheduling of runway operations for reduced environmental impact. Transportation Research Part D

    Marcella Samà, Andrea D'Ariano, Dario Pacciarelli. (2013). Rolling Horizon Approach for Aircraft Scheduling in the Terminal Control Area of ??Busy Airports. Social and Behavioral Sciences 80.531 – 552

    Marcella Samà, Andrea D'Ariano, Dario Pacciarelli. (2012). Optimal aircraft traffic flow management at a terminal control area during disturbances

    Gulsah Hancerliogullari, Ghaith Rabadi, Ameer H. Al-Salem, Mohamed Kharbeche. (2013) Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem. Journal of Air Transport Management 32, 39-48

    Zheng Lei, Zhang Jun, Zhu Yanbo. (2009). Affinity Propagation Clustering Classification Method For Aircraft In Arrival And Departure Sequencing

    Salvatore Capri, Matteo Ignaccolo, (2004), Genetic algorithms for solving the aircraft-sequencing problem: the introduction of departures into the dynamic model, Journal of Air Transport Management 10 (2004) 345-351

    Bennell, J. A. Mesgarpour, M. Potts, C. N. (2011). Airport runway scheduling, OR: Quarterly Journal of Operations Research, 9(2), 115-138

    Dear, R. G. (1976). The dynamic scheduling of aircraft in the near terminal area. MIT Flight Transportation Laboratory Report R76-9, MIT, Cambridge, MA, USA.

    Psaraftis,.

    Psaraftis, H. N. (1980). Dynamic programming approach for sequencing groups of identified jobs, Operations Research, 28, 1347-1359.

    Bianco, L. Rinaldi, G. & Sassano, A. (1987). A combinatorial optimization approach to aircraft sequencing problem. Flow Control of Congested Networks. NATO AS I series, 38, 323-339.

    Bianco, L. Dell'Olmo, P. & Giordani, S. (1997). Scheduling models and algorithms for TMA traffic management. Modeling and Simulation in Air Traffic Management. Springer, 139-167.

    Beasley, J. E. Krishnamoorthy, M. Sharaiha, Y. M. Abramson, D. (2000). Scheduling aircraft landings-the static case, Transportation Science, 34(2), 180-197.

    Wen, M. Larsen, J. Clausen, J. (2005). An exact algorithm for Aircraft Landing Problem, Technical University of Denmark.

    Gupta, G. Malik, W. and Jung, Y. C. (2009). A mixed integer linear program for airport departure scheduling, 9th AIAA Aviation Technology, Integration, and Operations Conference (ATIO). AIAA, Hilton Head, South Carolina.

    Sherali, H. D. Ghoniem, A. Baik, H. Trani, A. A. and (2012). Enhanced formulations for a combined arrival-departure aircraft sequencing problem, Manuscript, Grado Department of Industrial and Systems Engineering (0118). Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA 24061.

    Dear, R. G. & Sherif, Y.S. (1989). The dynamic scheduling of aircraft in high density terminal areas. Microelectrons Reliability, 29, 743–749.

    Dear, R. G. and Y. S. Sherif (1991). An algorithm for computer assisted sequencing and scheduling of terminal area operations, Transportation Research, 25A:129-139.

    Yu, S. P. Cao, X. B. Zhang, J. (2011). A real-time schedule method for aircraft landing scheduling problem based on cellular automaton, Applied Soft Computing Journal.

    Beasley, J. E. Krishnamoorthy, M. Sharaiha, Y. M. Abramson, D. (2000). Scheduling aircraft landings-the static case, Transportation Science, 34(2), 180-197.

    Beasley, J. J. Sonander and P. Havelock (2001). Scheduling aircraft landings at London Heathrow using a population heuristic, Journal of the Operational Research Society, 52, 483-493

    Hu, X. B. and Chen, W. H. (2005). Genetic algorithm based on receding horizon control for arrival sequencing and scheduling, Eng. Appl. Artif. Intel. 18(5), 633–642.

    Hu, X. B. and Paolo, E. D. (2008). Binary-representation-based genetic algorithm for aircraft arrival sequencing and scheduling, IEEE Transactions on Intelligent Transportation System, 9(2), 301–310

    Liu, Y. H. (2010). A genetic local search algorithm with a threshold accepting mechanism for solving the runway dependent aircraft landing problem, Optimization Letters, 5(2), 229-245.

    Atkin, J.A.D. Burke, E.K. Greenwood, J.S. and Reeson, D. (2007). Hybrid metaheuristics to aid runway scheduling at London Heathrow Airport, Transportation Science, 41 (1), 90-106

    Atkin, J.A.D. Burke, E.K. Greenwood, J.S. and Reeson, D. (2008). A meta-heuristic approach to departure scheduling at London Heathrow airport, Computer Aided Systems of Public Transport.

    Lee, Y. H. & Pinedo, M. (1997). Theory and methodology: Scheduling jobs on parallel machines with sequence-dependent setup times. European Journal of Operational Research,100,464-474.

    Pfund, M. Fowler, J. W. Gadkari, A. & Chen, Y. (2008). Scheduling jobs on parallel machines with setup times and ready times, Computers and Industrial Engineering, 54, 764–782.

    Chen, J. F, (2009). Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints. International Journal of Advanced Manufacturing Technologies, 44, 1204-1212

    Lin, S. W. Lu, C. C. Ying, K. C. (2011).

Integration of colonial competition algorithm and quick selection of preparation time in solving the aircraft sequence planning problem