Genetic Algorithm for Optimizing Aircraft Taxiing Paths

Genetic Algorithm for Optimizing Aircraft Taxiing Paths

Airport aircraft taxiing scheduling refers to: given an airport ground network diagram, under the premise of ensuring that there is no taxiing conflict between each aircraft, solving the optimal taxiing path for each aircraft and the time at each node of the optimal path, so that the total taxiing distance (or time) is minimized or the overall economic loss is minimized.

Aircraft taxiing scheduling is divided into departure flight taxiing scheduling and arrival flight taxiing scheduling. Departure flight taxiing scheduling refers to the aircraft moving from the parking position to the taxiway, selecting the taxiing path to reach the runway entrance; the departure flight taxiing time refers to the time difference between the aircraft entering the taxiway entrance and the aircraft entering the runway entrance. Arrival flight taxiing scheduling refers to the aircraft leaving the runway and entering the taxiway, selecting an appropriate taxiing path to reach the parking position; the arrival flight taxiing time refers to the time difference between the aircraft starting to taxi after leaving the runway and the aircraft reaching the parking position.