Locating Routing Problem (LRP) of distribution of priority support items to ground forces in war conditions

In this research, a mathematical modeling approach is presented to determine efficient locations for deploying support forces using Data Envelopment Analysis (DEA). Additionally, a mixed-integer linear programming model is proposed for routing prioritized support items. The proposed model allows for the adjustment of manageable inputs to improve outputs according to the principle of managerial accessibility, while also maintaining the current levels of unmanageable inputs if they cannot be reduced based on the principle of natural accessibility. Subsequently, routing for the distribution of these prioritized support items is provided using a mixed-integer linear programming model. The proposed model has been used to evaluate 25 potential locations prepared to provide ground support services to assist friendly forces in contested areas, with the aim of ending the conflict in favor of friendly forces. Sixteen viable support locations have been identified. Finally, routing for the distribution of support items to these 16 locations has been presented.