A New Model for Fleet Assignment Problem, Case Study of Iran Air Network at Vision 2036

摘要: The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since is an expensive resource, poor can cause a great increase in costs airlines. There are so many consideration which should be tackled formulation FAP problem, especially parameters regarding to airplanes. This paper presents novel, mixed integer programing for problem. aim this assign most appropriate while minimizing cost and determining optimal number plane fleet. model guarantees that pair nodes served limit planes utilization time constraint. was applied real example. In example demand matrix between 69 airports Iran estimated year 2036. Finally, determined outlook results show by proposed will need less purchasing comparing current needs total investment air industry decreased much.