A decomposition solution approach to the troops-to-tasks assignment in military peacekeeping operations
- 20 September 2019
- journal article
- research article
- Published by SAGE Publications in The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology
- Vol. 17 (4) , 357-371
Abstract
This paper considers the Peacekeeping Troops-to-Tasks Problem (PTTP). The PTTP deals with assigning battlegroup resources to a set of tasks associated with a given peacekeeping mission. The tasks may be spread across several locations, and have requirements regarding the time at which they can be handled, and the skills and skill levels needed to complete them. There is also a utility value related to each completed task that reflects its importance. The resources are bound by a hierarchy of command, limiting their movement in relation to one another. The aim is to decide which tasks to complete, when, and by whom. We present a mathematical compact model for the PTTP, which includes a number of complicating real-life factors. Due to the complexity of the compact model, it is difficult to solve large instances using a commercial solver. Therefore, we also propose a decomposition-based solution approach, with a decomposed model where possible travel routes for the resources are generated a priori. The computational study shows that the decomposed model has better performance than the compact model, and that it can be used as a good starting point for developing a useful decision support tool for military peacekeeping operations planning.Keywords
This publication has 29 references indexed in Scilit:
- Multi-site scheduling under production and transportation constraintsInternational Journal of Computer Integrated Manufacturing, 2013
- A survey of variants and extensions of the resource-constrained project scheduling problemEuropean Journal of Operational Research, 2010
- Parallel machine scheduling with precedence constraints and setup timesComputers & Operations Research, 2010
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problemEuropean Journal of Operational Research, 2010
- A hybrid scatter search for the discrete time/resource trade-off problem in project schedulingEuropean Journal of Operational Research, 2009
- A Simulation-optimization Approach to Air Warfare PlanningThe Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, 2004
- Network decomposition techniques for resource-constrained project schedulingJournal of the Operational Research Society, 2002
- ProGen/πx – An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensionsEuropean Journal of Operational Research, 2000
- Heuristics for multimode scheduling problems with dedicated resourcesEuropean Journal of Operational Research, 1998
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983