AIR TASKING ORDER OPTIMIZATION MODEL
Combined Air Operation Center (CAOC) provides command and control in operational level in air operations planning and execution. Operation cycle in CAOC requires planning and controlling 1000-1500 flights daily and creates information overload and time pressure on the decision makers. Under such complicated circumstances, achieving the decision superiority and keeping it emerges as a force multiplier. This study proposed a decision support model to achieve the decision superiority by generating Air Tasking Order (ATO) in a short time which contains assignment information of aircraft, munitions and targets. In this context, target selection process is modeled by heuristic methods, the aircraft are assigned to the targets using P-median model and therefore a complete solution is proposed for the operations planning process. The applicability of the proposed model is tested on several generic scenarios.
 Dolan, M.H., Air Tasking Order (ATO) Optimization Model, Yüksek Lisans Tezi, Naval Postgraduate School, 1993.
 Crawford, K.R., Enhanced ATO Optimization Model, Yüksek Lisans Tezi, Naval Postgraduate School, 1994.
 Griggs, B.J., An Air Mission Planning Algorithm For a Theater Level Combat Model, Yüksek Lisans Tezi, Air Force Institute of Technology, 1994.
 Hinton, D.W., A Decision Support System For Joint Force Air Component Commander JFACC Combat Planning, Yüksek Lisans Tezi, Air Force Institute of Technology, 1994.
 Griggs, B.J., Parnell, G.S. ve Lehmkuhl, L.J., “An Air Mission Planning Algorithm Using Decision Analysis and Mixed Integer Programming”, Operations Research, Vol. 45, No.5, 662-676, 1997.
 Van H., John C., An Integer Programming Decomposition Approach To Combat Planning, Doktora Tezi, Naval Postgraduate School, 1998.
 Abrahams, P., Balart, R., Byrnes, J.S., Cochran, D., Larkin, M.J., Moran, W., Ostheimer, G. ve Pollington, A., “MAAP: The Military Aircraft Allocation Planner”, Evoluationary Computation Proceedings of the IEEE World Congress on Computational Intelligence, 336-341, 1998.
 Koewler, D.A., An Approach For Tasking Allocated Combat Resources To Targets, Yüksek Lisans Tezi, Air Force Institute of Technology, 1999.
 Gürdal, T. ve Leblebicioğlu, K., “Harekât alanında muharip jet uçaklarının hava görev emrinin modellenmesi”, Birinci Ulusal Savunma Uygulamaları Modelleme ve Simülasyon Konferansı (USMOS) Bildiri Kitabı, sf 61-75, 2005.
 Saling, J.M., Dynamic Retasking the JFACC and the Airborne Strike Package, ABD Hava Harp Akademisi Tezi, Air Command and Staff College, 1999.
 Çanlı, H., “Operatif Hava Harekatının Planlamasında Görsel Modelleme Dili Altyapısı”, Havacılık ve Uzay Teknolojileri Dergisi, Cilt 2, Sayı 4, 29-41, 2006.
 Calhoun, K.M., A Tabu Search for Scheduling and Rescheduling Combat Aircraft, Yüksek Lisans Tezi, Air Force Institute of Technology, 2000.
 Calhoun, K.M., Deckro, R.F., Moore, J.T., Chrissis J.W., Van Hove J.C., “Planning and Re-planning in Project and Production Scheduling”, Omega the International Journal of Management Science, Cilt 20, 155-170, 2002.
 Barth, C.D., Composite Mission Variable Formulation For Real-Time Mission Planning, Yüksek Lisans Tezi, Massachusetts Institute of Technology, 2001.
 Rogerio, D. ve Castro, S., Optimization Models For Allocation of Air Strike Assets With Persistence, Yüksek Lisans Tezi, Naval Postgraduate School, 1993.
 Bardak, S.F., Automated Sead Planning for a Feasible Air Tasking Order, Yüksek Lisans Tezi, Orta Doğu Teknik Üniversitesi, 2004.
 Arslan, O., Developing a Tool for the Location Optimization of the Alert Aircraft With Changing Threat Anticipation, Yüksek Lisans Tezi, Air Force Institute of Technology, 2009.
 Weaver, P..R., Development and Evaluation of an Automated Decision aid For Rapid Retasking of air Strike Assets in Response to Time-Sensitive Targets, Yüksek Lisans Tezi, Naval Postgraduate School, 2001.
 Zacherl, B., Weapon-Target Pairing; Revising an Air Tasking Order In Real-Time, Yüksek Lisans Tezi, Naval Postgraduate School, 2006.
 Li, V.C., Curry G.L., Boyd, E.A., “Towards the Real Time Solution of Strike Force Asset Allocation Problems”, Computers & OR, Cilt 31, No 2, 273-291, 2004.
 Barbehenn, M., "A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices", IEEE Transactions on Computers, Cilt 47, No 2, 263, 1998.
 Ausiello G., Crescenzi P., Kann V., Marchetti-Spaccamela A., Protasi M., Complexity and approximation: combinatorial optimization problems and their approximability properties, Springer, Berlin, 1999.
The manuscript with title and authors is being submitted for publication in Journal of Aeronautics and Space Technologies. This article or a major portion of it was not published, not accepted and not submitted for publication elsewhere. If accepted for publication, I hereby grant the unlimited and all copyright privileges to Journal of Aeronautics and Space Technologies.
I declare that I am the responsible writer on behalf of all authors.