Carrier Optimization Launch Algorithm: An Optimization Model to Maximize theNumber of Tactically Tasked Sorties Under Constant Restriction

摘要

Timely arrival of a Carrier Battle Group (CVBG) at an assigned location isextremely important for successful execution of tactical, strategic or logistic operations. Weather conditions, tasking requirements, battle group defense and transit restrictions all impact on the CVBG's rate of advance while in transit to its newly assigned station. If these variables are not carefully considered and accounted for, then the CVBG, in all likelihood, will arrive late at its destination. This paper develops a mathematical model, which incorporates these transit variables, to assist the Battle Group Commander in successfully planning flight operations which will meet both CVBG defensive and routine tasking requirements and as well as arrive at its destination on time. This model through the use of elastic constraints will provide the commander with maximum flexibility and allow him to determine any inconsistencies between desired tasking and transit requirements.