SA حل مسيله ي تخصيص هواپيما به پرواز با روش

SOLVING FLEET ASSIGNMENT PROBLEM WITH SIMULATED ANNEALING METHOD

Flight scheduling is one of the major problems for any airline company. This problem has been investigated as an optimization problem for many years. Usually, the flight scheduling problem is divided into a number of sub-problems, one of them being the fleet assignment. In this problem, given a flight timetable and aircraft specifications, the type of aircraft is determined for each flight. In recent studies, the fleet assignment problem has been modeled as a multi-commodity network flow problem with integer and real variables, which has been solved by conventional methods. In this research, one of the exisiting models has been modified for a domestic airline company and simulated annealing (SA) algorithm is used to solve it. This algorithm was implemented for the fleet assignment problem and used to solve some sample problems. Comparison of the results of solving sample problems by SA algorithm and GAMS software indicates that the SA has a good capability for solving the fleet assignment problem.