Abstract
A scenario where multiple air vehicles are required to prosecute geographically dispersed targets is considered. Furthermore, multiple tasks are to be successively performed on each target, that is, the targets must be classified, attacked, and verified as destroyed. The optimal, for example, minimum time, performance of these tasks requires cooperation among the vehicles such that critical timing constraints are satisfied, that is, a target must be classified before it can be attacked, and an air vehicle is sent to a target area to verify its destruction only after the target has been attacked. In this paper, the optimal task assignment/scheduling problem is posed as a mixed-integer linear program (MILP). The solution of the MILP assigns all tasks to the vehicles and performs the scheduling in an optimal manner, including staged departure times. Coupled tasks involving timing and task order constraints are automatically addressed. When the air vehicles have sufficient endurance, the existence of a solution is guaranteed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chandler PR and Pachter M (2001). Hierarchical control of autonomous teams. In: Proceedings of the AIAA Guidance, Navigation, and Control Conference 2001. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2001–4149.
Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Mngt Sci 40: 1276–1289.
Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston, MA, USA.
Hooker TN (1995). Testing heuristics—we have it all wrong. J Heuristics 1: 33–44.
ILOG (1999). ILOG CPLEX User's Guide. ILOG: Gentilly, France.
Nemhauser GL and Wolsey LA (1988). Integer and Combinatorial Optimization. Wiley: New York, NY, USA.
O'Rourke KP, Bailey TG, Hill R and Carlton WB (2000). Dynamic routing of unmanned aerial vehicles using reactive Tabu Search. Military Opns Res J 6: 33–42.
Pinedo M (2002). Scheduling. Prentice Hall: Upper Saddle, NJ, USA.
Schumacher C, Chandler PR and Rasmussen SJ (2002). Task allocation for wide area search munitions via iterative network flow. In: Proceedings of the Guidance, Navigation, and Control Conference 2002. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2002–4586.
Schumacher C, Chandler PR and Rasmussen SJ (2003a). Task allocation for wide area search munitions with variable path length. In: Proceedings of the American Control Conference 2003. Institute of Electrical and Electronic Engineers, New York, NY, USA. pp 126–132.
Schumacher C, Chandler PR and Rasmussen SJ (2003b). Path elongation for task assignment. In: Proceedings of the AIAA Guidance, Navigation, and Control Conference 2000. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2003–5585.
Schumacher C, Pachter M, Pachter LS and Chandler P (2003c). UAV task assignment with timing constraints. In: Proceedings of the AIAA Guidance, Navigation, and Control Conference 2003. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2003–5664.
Schumacher C, Pachter M, Pachter LS and Chandler P (2004a). Constrained optimization for UAV task assignment. In: Proceedings of the AIAA Guidance, Navigation, and Control Conference 2004. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2004-5352.
Schumacher C, Chandler P, Pachter M and Pachter LS (2004b). UAV task assignment with timing constraints via Mixed-Integer Linear Programming. In: Proceedings of the Third Unmanned Unlimited Technical Conference 2004. American Institute of Aeronautics and Astronautics, Reston, VA, USA. AIAA Paper No 2004–6410.
Toth P and Vigo D (2002). The Vehicle Routing Problem. SIAM: Philadelphia, PA, USA.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Schumacher, C., Chandler, P., Pachter, M. et al. Optimization of air vehicles operations using mixed-integer linear programming. J Oper Res Soc 58, 516–527 (2007). https://doi.org/10.1057/palgrave.jors.2602176
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602176