Approach to Solving the Problem of Resource Allocation in the Implementation of Critical Logistics Scenarios

In todayʼs environment, critical scenarios that are carried out without constant logistical sup-port and require effective resource management are becoming increasingly important in terms of security. Such missions include military operations of small mobile units, rescue missions in hard-to-reach areas, humanitarian expeditions in disaster or combat zones, environmental or scientific research in Arctic, mountainous, or desert regions, as well as long-term expeditions far from supply bases. One of the key aspects of planning such missions is resource provision, since it is the rational distribution of resources that largely determines the autonomy, endur-ance, and safety of participants. In the field, each participant must carry their own supply of resources or a portion of the total volume, which requires proper balancing of weight and vol-ume. Inefficient distribution can lead to overloading of individual participants or a shortage of resources at critical moments of the mission. Therefore, the optimization task of efficient re-source distribution among participants of autonomous groups, taking into account time, physi-cal, and organizational constraints, becomes relevant. To formalize this, a mathematical model has been proposed that generalizes the classic Multiple Knapsack Problem (MKP), extended by the conditions of monotonic load reduction, fixed allocation of resources to a specific par-ticipant and day of resource use, as well as taking into account individual physical capabilities. A computer model developed on this basis, designed to be implemented in the form of a mo-bile application, enables the automation of the process of planning and distributing resources among participants in autonomous missions in accordance with their capabilities and specified constraints.