Nondeterministic polynomial time algorithm for estimation of space launch base launch capacity

When designing the new space launch bases their maximum launch capacity must be defined. The deterministic evaluation of the launch rate can be performed when the entry hypotheses are very simple. However, when increasing the number of constraints there are no deterministic methods to account for all complexity of launch rate scheduling. That is why we consider it as an NP (nondeterministic polynomial time) problem. The specific algorithm had been developed with an objective to place the maximum number of launch campaigns in a calendar year with numerous constraints, such as launch range, launch operators' concepts of operations (CONOPS), as well as any kind of probability distribution function. Applying the constructed model and varying its parameters, the probability distribution functions of spaceport launch capacity had been obtained over thousands of simulations. The algorithm's behavior had been characterized through test cases. The polyvalent simulation capacity of the algorithm provided the insight to the intrinsic problems and limitations of the spaceport with very high launch rates. In addition, it allowed simulating the potential solutions in terms of spaceport organization, contractual rules towards users and suggest the technical facilities to maximize the available launch capacity.