AIRCRAFT LANDING PROBLEM
Aircraft - appearance time, earliest landing time, latest landing time, target landing time, penalty cost for early landing, penalty cost for early landing, separation time between aircrafts.
Determine aircraft landing time (sequence) on runways. To calculate the landing time, we assume that the first aircraft to land on a runway can land at its target landing time. The landing time for the subsequent aircrafts is calculated as: The landing time of the previous aircraft (j) + the separation time (i,j) between the current aircraft (i) and the previous aircraft (j).
Objective of the problem
Minimise the total penalty - The time difference between landing time and target landing time will be used to calculate the penalty. For each aircraft, earliness penalty is calculated as the positive difference between the earliest landing time and the calculated landing time multiplied by the cost of earliness. The same applies for the cost of lateness.
Each aircraft must not land before its earliest landing time and must not land after its latest landing landing time.
Apply the Iterated greedy algorithm in Java to solve the problem.
Print out the solution (landing sequence for each runway, landing times and penalty costs).
Add a clear description of all functions and variables used in the code.
Articles about the problem
Data - Input files and description of the structure of the files
Link to the online library containing the data and the description of the data.