Pitch Program Optimization via Genetic Algorithm and Sequential Quadratic Programming

Purpose – This article aims at investigating the effect of different modeling of pitch program onoptimizing flight path of a launch vehicle for loading it with the maximum amount of payload in LEO orbit andthen determining which program is the optimum pitch program.Design/methodology/approach – Three types of pitch programs having square-linear, square-inversesine, and linear-constant formats have been investigated. Optimization problem has been solved in order thatoptimization parameters existing in each pitch program be identified. The methods adopted to solve theoptimization problem are SQP and Genetic algorithm.Findings – Selecting the model of the optimum pitch program regarding the constraints of the problemfor putting the maximum amount of payload in the orbit. Investigation of Genetic algorithm and SQP methodsand comparing their outcomes and choosing the more appropriate method.Practical implications – In order that a launch vehicle reaches its target, it should take the best path.Pitch program specifically indicates the guidance path of a launch vehicle in the direction of reaching the orbit.There are various algorithms for pitch program. Investigation of three types of major and practical algorithmsin the flight and indicating their differences can be immensely helpful in finding a more accurate algorithm forpitch program.Originality – This article is innovative and differs from previous investigations conducted in this fielddue to the way optimization parameters have been selected. The selection of vertical flight time as one of theoptimization parameters and comparison of three pitch programs have been quite rare in other studies. Theselection of separation angle at different stages as one of the optimization parameters is one of the maindifferences of this work with previous studies.

کلیدواژه ها:

Launch Vehicle ، Pitch Program ، Optimum ، Genetic Algorithm ، SQP