The Unit Re-Balancing Problem

Abstract

We describe the problem of re-balancing a number of units distributed over a geographic area. Each unit consists of a number of components. A value between 0 and 1 describes the current rating of each component. By a piecewise linear function, this value is converted into a nominal status assessment. The lowest of the statuses determines the efficiency of a unit, and the highest status its cost. An unbalanced unit has a gap between these two. To re-balance the units, components can be transferred. The goal is to maximize the efficiency of all units. On a secondary level, the cost for the re-balancing should be minimal. We present a mixed-integer nonlinear programming formulation for this problem, which describes the potential movement of components as a multi-commodity flow. The piecewise linear functions needed to obtain the status values are reformulated using inequalities and binary variables. This results in a mixed-integer linear program, and numerical standard solvers are able to compute proven optimal solutions for instances with up to 100 units. We present numerical solutions for a set of open test instances and a bi-criteria objective function, and discuss the trade-off between cost and efficiency.

1. Introduction

In recent years, many nations tried to re-organize the structure of their public security forces (army, police, fire departments, first aids, etc.) in order to have better readiness and to be more efficient (see, for example, in [1]). At the same time, this re-organization has to lead to new structures that have to be used with the same or even lower budget.

The basic idea of this re-organization is to re-balance the force, manpower, and equipment by moving some supporting capabilities from the reserve component to the active component. The aim is to bring the reserve component force structure into closer alignment with that of the active component. The purpose of this re-balancing is to reduce the size of the institutional forces—the sustaining base—to an unprecedented low percentage of the total forces.

How do things get un-balanced? Any security force with its units can be found on the hierarchical level of an “organization” in the Living Systems Theory (LST) according to Miller [2]. LST is complemented by the Social Entropy Theory (SET), see Bailey [3] and references therein. SET describes social systems using PILOTS, which represent six macro-sociological variables: population size (P), information (I), level of living (L), organization (O), technology (T), and space or territory (S). Together, they describe the current status of a system. Both LST and SET are receptive for the concept of entropy, which has been originally developed for physical phenomena (the second law of thermodynamics) by Boltzmann in 1866 and later carried over to information theory by Shannon in 1949. In the context of LST and SET, it means that social systems tend to increase their state of disorder when they are not purposely organized by some outside force, up to the point when all system variables go to zero, which would indicate system death and maximum entropy. In this case, the system would not be able to utilize technology, or to organize, or to occupy and defend space [3]. This status clearly needs to be avoided for security forces. The re-balancing that we describe in our work can be seen as an external force to get things back in order before entropy raises to an unhealthy level.

In this paper, we describe a mathematical model which yields a suggestion to the Greek military on how to re-balance its units. We have implemented the model with army sections in mind but it is easily adapted for other nations and forces (police, fire departments, first aids, etc.). The proposed model is capable to re-organize the units in order

(i)

to have the operational capability to execute their core mission,

(ii)

to have the ability to manage the flexibility,

(iii)

to have the required strength and efficiency, and

(iv)

to remain within planned budget.

Re-balancing type problems received a lot of attention from researchers from various scientific fields.

Many applications from an economic perspective have already occurred which used the re-balancing problem in order to construct hedged portfolios or find the optimal portfolio under certain restrictions [4,5]. The so-called portfolio re-balancing problem deals with adjusting the portfolio with the goal of either maximizing the expected return or minimizing the risk of the portfolio [6].

There are a few applications of re-balancing in logistics such as the bike re-balancing problem [7,8], in which the main issue is to re-distribute shared bikes with the objective of minimizing the total cost. A similar problem exists for the re-location of vehicles at car-sharing companies, see in [9,10].

Some authors used the notion of re-balancing in order to address problems in predictive regression, for example, in [11].

In computer science, re-balancing is used to solve problems concerning several aspects such as search trees, assignment problems, or load re-balancing problems [12,13]. In the load re-balancing problem, the load consists of a set of tasks, associated with a processing time, and should be balanced on a set of machines. In [14], the authors study the load re-balancing problem as a game.

Balancing resources is essential in many aspects of public service, e.g., balancing the workload of workers. In [15], the authors focus on locating and re-locating a fleet of response units (from army, police, etc.) in a specific transportation network to optimally cover a number of facilities. They present the problem as a mixed-integer linear program and develop a heuristic algorithm. In [16], the authors consider a multi-commodity re-balancing and transportation problem with traffic congestion in disaster response. This problem is formulated as a bi-objective stochastic mixed-integer nonlinear program and approached via linearization and epsilon-constraint methods. Another well known application of the re-location (re-balancing) problem is the one that deals with emergency vehicles [17,18]. For vehicle routing problems dealing with specialized technicians, balancing issues in the workload of technicians were modeled in [19] and solved with a bi-objective optimization model [20]. In a military context, planning flights and maintenance of military aircrafts is considered in [21], where flights must be balanced to keep aircrafts intact as long as possible and maintenance operations must be balanced to keep the squadron available at all times. The authors improved programming model by training a Machine Learning model on a large set of past real-world instances.

The use of the term re-balancing as we want to understand it has to do with the dynamics. We use this term instead of re-location because in the case where we have some army units we want to re-balance their critical different components (force, manpower, and equipment) from one to another unit in order to increase the efficiency. In this framework the term re-balancing is more appropriate than re-location as re-location deals mainly with finding the best location for each unit. Our approach, for army units, deals with all the components that an army unit has and characterizes them. With the help of piecewise linear functions, the effect of shifting components (possibly leaving single units under- or overequipped) can be represented more detailed and the status of different components can be compared. With our work presented in this paper, we are able to fit nonlinear correlations (e.g., the efficiency and cost of an army unit depending on various ratings) into a mixed-integer linear programming model via the usage of piecewise linear functions. This offers a new perspective on re-balancing problems.

The remainder of this paper is organized as follows. In Section 2, we present a first mathematical model with variables, an objective function, and restrictions, including a first example instance. This basic model is applicable to real-world problems. In Section 3, we introduce an advanced model as an alternative draft to Section 2. Section 4 contains computational results with which the performance of different numerical solvers is analyzed, including an instance inspired by real-world data which shows how the current-day situation can be improved with the help of our models. Finally, in Section 5, we provide some concluding remarks.

2. A Basic Model

A unit in any public security force can be characterized by its components. In our presentation we keep the focus on army units. They can be characterized by their amount of armor, personnel, and equipment. By rating each characteristic in every unit with a number between 0 and 1, we can assign statuses. For example, armor could need a high rating to reach a high status, whereas personnel could reach a satisfying status even with a low rating. To determine the cost and efficiency of a single unit, we compare its status in all characteristics. An example is shown in Figure 1. The straight lines represent the status of the unit in the respective characteristics—the longer the line, the higher the status. The cost to maintain a unit depends on its maximum status among its characteristics (depicted as the outer circle on the left). In an analogous manner, the efficiency value of a unit is dependent on its minimum status among its characteristics (inner circle on the left). It follows that it would be optimal to have three equal status values as shown on the right.

2.1. Sets

An organization such as an army consists of several units. These units are numbered in the set $\mathcal{U}: =\{1,\dots ,U\}$, index u. Every unit can be described by various characteristics which are included in the set $\mathcal{C}:=\{1,\dots ,C\}$, index c. Depending on how well a unit can provide each of the characteristics, a status out of $\mathcal{S}: =\{1,\dots ,S\}$, index s, is assigned; 1 being the worst and S being the best possible status. The total area on which the units are distributed, e.g., a country, is divided into regions, e.g., counties or islands. The set of regions is defined as $\mathcal{R}:=\{1,\dots ,R\}$, index r.

2.2. Parameters

The current ratings of all units (i.e., before the optimization) are gathered in a matrix ${\left(p_{c,u}^0\right)}_{c,u}$ with entries in $[0,1]$. Every entry of this matrix can be attached to a status: Each status belongs to an interval range $[{\underline{b}}_{c,s},{\overline{b}}_{c,s}]$ with $0\le {\underline{b}}_{c,s}\le {\overline{b}}_{c,s}\le 1$. The parameter ${\xi }_{u,c,s}^0\in \{0,1\}$ describes if characteristic c of unit u is in status s or not (${\xi }_{u,c,s}^0=1$ meaning that characteristic c of unit u is in status s). Additionally, ${\alpha }_{u,s}^0\in \{0,1\}$ captures if status s is the lowest of unit u or not; similarly, ${\beta }_{u,s}^0\in \{0,1\}$ marks if status s is the highest of unit u or not. To be considered open, a unit needs a minimum rating of ${ϵ}_{\mathrm{open}}\in [0,1]$ in every characteristic. For every unit u, the parameter $x_u^0\in \{0,1\}$ defines if u is open or not. For a fixed $u\in \mathcal{U}$ and $c\in \mathcal{C}$, precisely one value of ${\xi }_{u,c,s}^0$ for some $s\in \mathcal{S}$ is equal to one, if and only if the unit u is open. If the unit is closed, all ${\xi }_{u,c,s}^0$ are equal to zero. Therefore, the parameters fulfill the equation

$$x_u^0=\sum _{s\in \mathcal{S}}{\xi }_{u,c,s}^0,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(1)

Similarly, for the lowest and the highest status, the corresponding equations are

$$x_u^0=\sum _{s\in \mathcal{S}}{\alpha }_{u,s}^0=\sum _{s\in \mathcal{S}}{\beta }_{u,s}^0,\forall u\in \mathcal{U}.$$

(2)

We assume that the given parameters fulfill certain conditions which define a feasible instance and which are checked when input data is given.

A unit is closed if it is rated zero in all characteristics:

$$p_{c,u}^0\le x_u^0,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(3)

To be open, a unit needs to have every characteristic rated above a minimum value:

$${ϵ}_{\mathrm{open}}{x}_u^0\le p_{c,u}^0,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(4)

For each unit u and each characteristic c, the status is coupled to the rating:

$$\sum _{s\in \mathcal{S}}{\underline{b}}_{c,s}·{\xi }_{u,c,s}^0\le p_{c,u}^0\le \sum _{s\in \mathcal{S}}{\overline{b}}_{c,s}·{\xi }_{u,c,s}^0,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(5)

If the lowest status of a unit u is s, then at least one characteristic must be in this status as well and no characteristic can be of status lower than s:

$${\alpha }_{u,s}^0\le \sum _{c\in \mathcal{C}}{\xi }_{u,c,s}^0,\forall u\in \mathcal{U},s\in \mathcal{S},$$

(6)

$${\alpha }_{u,s}^0+{\xi }_{u,c,s_1}^0\le 1,\forall u\in \mathcal{U},c\in \mathcal{C},s,s_1\in \mathcal{S},s_1<s.$$

(7)

If the highest status of a unit u is s, then at least one characteristic must be in this status as well and no characteristic can be of status higher than s:

$${\beta }_{u,s}^0\le \sum _{c\in \mathcal{C}}{\xi }_{u,c,s}^0,\forall u\in \mathcal{U},s\in \mathcal{S},$$

(8)

$${\beta }_{u,s}^0+{\xi }_{u,c,s_1}^0\le 1,\forall u\in \mathcal{U},c\in \mathcal{C},s,s_1\in \mathcal{S},s_1>s.$$

(9)

Let $k_s\in {\mathbb{R}}^{+}$ be the cost coefficient and $v_s\in {\mathbb{R}}^{+}$ be the efficiency coefficient for $s\in S$. As book-keeping parameters we introduce

$$K^0=\sum _{u\in \mathcal{U},s\in \mathcal{S}}{k}_s·{\beta }_{u,s}^0\in {\mathbb{R}}^{+},V^0=\sum _{u\in \mathcal{U},s\in \mathcal{S}}{v}_s·{\alpha }_{u,s}^0\in {\mathbb{R}}^{+},$$

(10)

which reflect the cost and efficiency of all units before the re-balancing, respectively.

Every unit has geographical coordinates $(X_u,Y_u)\in {\mathbb{R}}^2$ and is located in a region $r_u$ with $r_u\in \mathcal{R}$. For some regions, in particular capitals and smaller islands, it is desired to specify lower and upper bounds on the number of units in this region that have at least a particular efficiency value s, specified as ${\underline{n}}_{r,s},{\overline{n}}_{r,s}\in \mathbb{N}$ with $0\le {\underline{n}}_{r,s}\le {\overline{n}}_{r,s}\le U$. Shipping costs vary between regions. Let ${\gamma }_{r_1,r_2}\in {\mathbb{R}}^{+}$ be the shipping cost factor between regions $r_1$ and $r_2$. Different characteristics also have different shipping cost factors ${\kappa }_c\in {\mathbb{R}}^{+}$. Total shipping costs are bounded by ${\sigma }_{\max }\in {\mathbb{R}}^{+}$. The Euclidean distance between two units is given by

$$d:\mathcal{U}\times \mathcal{U}\to {\mathbb{R}}^{+},(u_1,u_2)\mapsto \sqrt{{\left(X_{u_2}-X_{u_1}{)}^2+(Y_{u_2}-Y_{u_1}\right)}^2}.$$

(11)

2.3. Variables

During the re-balancing, the amount of characteristic c that is transferred from unit $u_1$ to unit $u_2$ is stored in $f_{c,u_1,u_2}\in [0,1]$.

After the re-balancing, $p_{c,u}\in [0,1]$ notates the value of characteristic c in unit u. In $x_u\in \{0,1\}$, we can see if unit u is still open or not. Analogous to the paragraph above, ${\xi }_{u,c,s}\in \{0,1\}$ tells if characteristic c of unit u is in status s, ${\alpha }_{u,s}\in \{0,1\}$ tells if status s is the lowest of unit u and ${\beta }_{u,s}\in \{0,1\}$ tells if status s is the highest of unit u.

The book-keeping variables $K\in {\mathbb{R}}^{+}$ and $V\in {\mathbb{R}}^{+}$ represent the cost and efficiency of all units “after”, respectively.

A survey of the sets, parameters, and variables can be found in

Table 1. Sets, parameters, and variables used in the model formulation.

Name	Definition	Description
$\mathcal{U}$	$\{1,\dots ,U\}$	units
$\mathcal{C}$	$\{1,\dots ,C\}$	characteristics
$\mathcal{S}$	$\{1,\dots ,S\}$	statuses
$\mathcal{R}$	$\{1,\dots ,R\}$	regions
Name	Range	Description
$p_{c,u}^0$	$[0,1]$	rating of characteristic c in unit u
${\underline{b}}_{c,s}$	$[0,{\overline{b}}_{c,s}]$	lower bound for interval of status s in characteristic c
${\overline{b}}_{c,s}$	$[{\underline{b}}_{c,s},1]$	upper bound for interval of status s in characteristic c
${\xi }_{u,c,s}^0$	$\{0,1\}$	Is characteristic c of unit u in status s “before” (yes/no)?
${\alpha }_{u,s}^0$	$\{0,1\}$	Is status s the lowest of unit u “before” (yes/no)?
${\beta }_{u,s}^0$	$\{0,1\}$	Is status s the highest of unit u “before” (yes/no)?
$x_u^0$	$\{0,1\}$	Is unit u open “before” (yes/no)?
${ϵ}_{\mathrm{open}}$	[0,1]	minimum rating in every characteristic to consider a unit open
$k_s$	${\mathbb{R}}^{+}$	cost coefficient of status s
$v_s$	${\mathbb{R}}^{+}$	efficiency coefficient of status s
$K^0$	${\mathbb{R}}^{+}$	cost of all units “before”
$V^0$	${\mathbb{R}}^{+}$	efficiency of all units “before”
$(X_u,Y_u)$	${\mathbb{R}}^2$	geographical coordinates of unit u
$r_u$	$\mathcal{R}$	region of unit u
${\underline{n}}_{r,s}$	$[0,{\overline{n}}_{r,s}]$	minimum number of units in region r with efficiency at least s
${\overline{n}}_{r,s}$	$[{\underline{n}}_{r,s},U]$	maximum number of units in region r with efficiency at least s
${\gamma }_{r_1,r_2}$	${\mathbb{R}}^{+}$	shipping cost factor between regions $r_1$ and $r_2$
${\kappa }_c$	${\mathbb{R}}^{+}$	shipping cost factor for characteristic c
$K$	${\mathbb{R}}^{+}$	cost of all units “after”
$V$	${\mathbb{R}}^{+}$	efficiency of all units “after”
$f_{c,u_1,u_2}$	$[0,1]$	amount of characteristic c transferred from unit $u_1$ to $u_2$
$p_{c,u}$	$[0,1]$	value of characteristic c in unit u after re-balancing
$x_u$	$\{0,1\}$	Is unit u open “after” (yes/no)?
${\xi }_{u,c,s}$	$\{0,1\}$	Is characteristic c of unit u in status s “after” (yes/no)?
${\alpha }_{u,s}$	$\{0,1\}$	Is status s the lowest of unit u “after” (yes/no)?
${\beta }_{u,s}$	$\{0,1\}$	Is status s the highest of unit u “after” (yes/no)?

.

2.4. Objective and Constraints

The goal is to maximize the total efficiency after re-balancing the units:

$$\max V.$$

(12)

The cost and efficiency “after” is computed (by adding up the lowest status of every unit multiplied with the corresponding cost value):

$$K=\sum _{u\in \mathcal{U},s\in \mathcal{S}}{k}_s·{\beta }_{u,s},$$

(13)

$$V=\sum _{u\in \mathcal{U},s\in \mathcal{S}}{v}_s·{\alpha }_{u,s}.$$

(14)

The budget is limited. The re-balanced units (“after”) must not be more expensive than “before”:

$$K\le K^0.$$

(15)

After the re-balancing, the following conditions must hold.

Every unit u is either closed or in some status:

$$x_u=\sum _{s\in \mathcal{S}}{\alpha }_{u,s}=\sum _{s\in \mathcal{S}}{\beta }_{u,s},\forall u\in \mathcal{U}.$$

(16)

Additionally, it is ensured that each active unit u is in a unique status:

$$x_u=\sum _{s\in \mathcal{S}}{\xi }_{u,c,s},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(17)

A closed unit has to be emptied completely:

$$p_{c,u}\le x_u,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(18)

An open unit must have a minimum amount of any characteristic:

$${ϵ}_{\mathrm{open}}·x_u\le p_{c,u},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(19)

The existing units can be distributed (cannibalized) to other units:

$$p_{c,u}^0=\sum _{u_1\in U}{f}_{c,u,u_1},p_{c,u}=\sum _{u_0\in U}{f}_{c,u_0,u},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(20)

For each unit u and each characteristic c, the status is coupled to the rating:

$$\sum _{s\in \mathcal{S}}{\underline{b}}_{c,s}·{\xi }_{u,c,s}\le p_{c,u}\le \sum _{s\in \mathcal{S}}{\overline{b}}_{c,s}·{\xi }_{u,c,s},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(21)

If the lowest status of a unit u is s, then at least one characteristic must be in this status as well and no characteristic can be of status lower than s:

$${\alpha }_{u,s}\le \sum _{c\in \mathcal{C}}{\xi }_{u,c,s},\forall u\in \mathcal{U},s\in \mathcal{S},$$

(22)

$${\alpha }_{u,s}+{\xi }_{u,c,s_1}\le 1,\forall u\in \mathcal{U},c\in \mathcal{C},s,s_1\in \mathcal{S},s_1<s.$$

(23)

If the highest status of a unit u is s, then at least one characteristic must be in this status as well and no characteristic can be of status higher than s:

$${\beta }_{u,s}\le \sum _{c\in \mathcal{C}}{\xi }_{u,c,s},\forall u\in \mathcal{U},s\in \mathcal{S},$$

(24)

$${\beta }_{u,s}+{\xi }_{u,c,s_1}\le 1,\forall u\in \mathcal{U},c\in \mathcal{C},s,s_1\in \mathcal{S},s_1>s.$$

(25)

Each region r has a lower (e.g., capitals or large regions) and upper (e.g., smaller regions or islands) bound on the number of units with efficiency at least s:

$${\underline{n}}_{r,s}\le \sum _{\begin{array}{c}u\in U:\\ r_u=r\end{array}}\sum _{\begin{array}{c}{s}_1\in \mathcal{S}:\\ s_1\ge s\end{array}}{\alpha }_{u,s_1}\le {\overline{n}}_{r,s},\forall r\in \mathcal{R},s\in \mathcal{S}.$$

(26)

Shipping costs are not allowed to exceed ${\sigma }_{\max }$:

$$\sum _{\begin{array}{c}c\in C,\\ u,u_1\in U\end{array}}{\kappa }_c·{\gamma }_{r_u,r_{u_1}}·d(u,u_1)·f_{c,u,u1}\le {\sigma }_{\max }.$$

(27)

The model consists of (12)–(27) plus integer and non-negativity constraints.

3. A Continuous Model

The basic model presented in the previous section can be extended to portray real-world scenarios more realistically. A drawback is the fact that the conversion from ratings to statuses is based on step functions (as depicted in Figure 2). As a consequence, characteristics are downgraded to barely hold their current status and not to “waste” any capacities. To counter this, we decided to convert the ratings to statuses via piecewise linear functions, thus turning the statuses into continuous variables.

3.1. Sets

Sets $\mathcal{U}$, $\mathcal{C}$, and $\mathcal{R}$ are adopted from Section 2. Furthermore, let $\mathcal{B}$, index b with $0\le b\le S_{\max }$ ($S_{\max }$ being the highest possible status) be the set containing all values for the regional restrictions described in Section 2.4.

3.2. Parameters

The following parameters are adopted from Section 2: rating “before” $p_{c,u}^0$, minimum rating ${ϵ}_{\mathrm{open}}$, activity “before” $x_u^0$ with the following inequalities:

$$p_{c,u}^0\le x_u^0,\forall u\in \mathcal{U},c\in \mathcal{C},$$

(28)

$${ϵ}_{\mathrm{open}}·x_u^0\le p_{c,u}^0,\forall u\in \mathcal{U},c\in \mathcal{C},$$

(29)

coordinates $X_u,Y_u$, region $r_u$, regional shipping cost factor ${\gamma }_{r_1,r_2}$, characteristical shipping cost factor ${\kappa }_c$, maximum shipping costs ${\sigma }_{\max }$, Euclidean distance $d(u_1,u_2)$. The regional efficiency restrictions are now given as ${\underline{n}}_r\left(b\right),{\overline{n}}_r\left(b\right)\in \mathbb{N}$ with $0\le {\underline{n}}_r\left(b\right)\le {\overline{n}}_r\left(b\right)\le U$.

To determine the status of each characteristic in a unit, we apply continuous piecewise linear functions to $p_{c,u}^0$. This way, statuses can take any value in $[0,S_{\max }]$. Breakpoints of each piecewise linear function are given in the matrix ${\left(g_{c,i}\right)}_{c,i}$, $i\in \{1,\dots ,S_{\max }\}$, which contains the values of $p_{c,u}^0$ that correspond to an integer status value. It follows that $g_{c,S_{\max }}=1$ for all $c\in \mathcal{C}$. We also assume that $p_{c,u}^0=0$ results in a corresponding status of 0.

Cost and efficiency of a unit are determined similarly. The vectors $g^k$ and $g^v$ contain the cost and efficiency values of the integer statuses $1,\dots ,S_{\max }$ and serve as breakpoints of the respective continuous piecewise linear functions. The statuses $s_{c,u}^0$, cost $k_u^0$, and efficiency $v_u^0$ of a unit prior to the re-balancing can be calculated beforehand. The total cost and efficiency values “before” are computed as follows:

$$K^0:=\sum _{u\in \mathcal{U}}{k}_u^0\in {\mathbb{R}}^{+}, V^0:=\sum _{u\in \mathcal{U}}{v}_u^0\in {\mathbb{R}}^{+}.$$

(30)

3.3. Variables

Variables taken from Section 2 include $f_{c,u_1,u_2}$, $p_{c,u}$, $x_u$, $K$, and $V$.

The status of the three characteristics in every unit after the re-balancing is stored in $s_{c,u}\in [0,S_{\max }]$. To model the continuous piecewise linear functions necessary to determine a status, the incremental method [22] is used with auxiliary variables $w_{c,u,i}$ and ${\delta }_{c,u,i}$, $i\in \{1,\dots ,S_{\max }\}$. As the maximum status $s_u^{\max }$ and minimum status $s_u^{\min }$ of each unit have to be determined, the maximum and minimum functions have to be linearized to fit into the MILP model. Therefore, the following auxiliary variables are added: $z_{u,1}^{\max }$, $z_{u,2}^{\max }$, $z_{u,1}^{\min }$, $z_{u,2}^{\min }$, ${\lambda }_u^{\max }$, ${\lambda }_u^{\min }$. The cost $k_u$ and efficiency $v_u$ of each unit is computed similarly to $s_{c,u}$ with auxiliary variables $w_{u,i}^k$, ${\delta }_{u,i}^k$, $w_{u,i}^v$, ${\delta }_{u,i}^v$, $i\in \{1,\dots ,S_{\max }\}$. Finally, ${\theta }_{u,b}\in \{0,1\}$ tells us if the minimum status of a unit u is higher than b. All new variables are listed in

Table 2. Additional variables in the continuous model.

Name	Range	Description
$s_{c,u}$	$[0,S_{\max }]$	status of characteristic c in unit u after re-balancing
$w_{c,u,i}$	$\{0,1\}$	Is $s_{c,u}$ at least $i-1$ (yes/no)?
${\delta }_{c,u,i}$	$[0,1]$	position of $s_{c,u}$ on the interval $[i-1,i]$
$s_u^{\max }$	$[0,S_{\max }]$	maximum status of unit u “after”
${\lambda }_u^{\max }$	$[0,S_{\max }]$	$\max (s_{\mathrm{ar},u},s_{\mathrm{pe},u})$
$z_{u,1}^{\max }$	$\{0,1\}$	Is $s_{\mathrm{pe},u}\ge s_{\mathrm{ar},u}$ (yes/no)?
$z_{u,2}^{\max }$	$\{0,1\}$	Is $s_{\mathrm{eq},u}\ge {\lambda }_u^{\max }$ (yes/no)?
$s_u^{\min }$	$[0,S_{\max }]$	minimum status of unit u “after”
${\lambda }_u^{\min }$	$[0,S_{\max }]$	$\min (s_{\mathrm{ar},u},s_{\mathrm{pe},u})$
$z_{u,1}^{\min }$	$\{0,1\}$	Is $s_{\mathrm{pe},u}\le s_{\mathrm{ar},u}$ (yes/no)?
$z_{u,2}^{\min }$	$\{0,1\}$	Is $s_{\mathrm{eq},u}\le {\lambda }_u^{\min }$ (yes/no)?
$k_u$	${\mathbb{R}}^{+}$	cost of unit u “after”
$w_{u,i}^k$	$\{0,1\}$	Is $k_u$ at least $g_{i-1}^k$ (yes/no)?
${\delta }_{u,i}^k$	$[0,1]$	position of $k_u$ on the interval $[g_{i-1}^k,g_i^k]$
$v_u$	${\mathbb{R}}^{+}$	efficiency of unit u “after”
$w_{u,i}^v$	$\{0,1\}$	Is $v_u$ at least $g_{i-1}^v$ (yes/no)?
${\delta }_{u,i}^v$	$[0,1]$	position of $v_u$ on the interval $[g_{i-1}^v,g_i^v]$
${\theta }_{u,b}$	$\{0,1\}$	Is $s_u^{\min }>b$ (yes/no)?

.

3.4. Objective and Constraints

The primary goal is to maximize the total efficiency after re-balancing the units. As a secondary objective, the required shipping costs are to be minimized:

$$\max V-\epsilon \sigma$$

(31)

with

$$\sigma =\sum _{\begin{array}{c}c\in C,\\ u,u_1\in U\end{array}}{\kappa }_c·{\gamma }_{r_u,r_{u_1}}·d(u,u_1)·f_{c,u,u1},$$

(32)

and $\epsilon$ being a sufficiently small value (we use $\epsilon :={10}^{-6}$).

After the re-balancing, the following conditions must hold. The total efficiency is computed by adding up the efficiency of the individual units:

$$V=\sum _{u\in \mathcal{U}}{v}_u.$$

(33)

The total costs are computed similarly:

$$K=\sum _{u\in \mathcal{U}}{k}_u.$$

(34)

The budget is limited. The re-balanced units must not be more expensive than “before”:

$$K\le K^0.$$

(35)

A closed unit has to be emptied completely:

$$p_{c,u}\le x_u,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(36)

An open unit must have a minimum amount of any characteristic:

$${ϵ}_{\mathrm{open}}·x_u\le p_{c,u},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(37)

The existing units can be distributed (cannibalized) to other units:

$$p_{c,u}^0=\sum _{u_1\in U}{f}_{c,u,u_1},p_{c,u}=\sum _{u_0\in U}{f}_{c,u_0,u},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(38)

The status “after” is modeled as a continuous piecewise linear function of $p_{c,u}$:

$$w_{c,u,i}\ge {\delta }_{c,u,i},\forall u\in \mathcal{U},c\in \mathcal{C},i\in \{1,\dots ,S_{\max }\},$$

(39)

$${\delta }_{c,u,i}\ge w_{c,u,i+1},\forall u\in \mathcal{U},c\in \mathcal{C},i\in \{1,\dots ,S_{\max }-1\},$$

(40)

$$p_{c,u}=g_{c,1}{\delta }_{c,u,1}+\sum _{i=2}^{S_{\max }}(g_{c,i}-g_{c,i-1}){\delta }_{c,u,i},\forall u\in \mathcal{U},c\in \mathcal{C},$$

(41)

$$s_{c,u}=\sum _{i=1}^{S_{\max }}{\delta }_{c,u,i},\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(42)

To find the maximum status of a unit among its three characteristics “after”, the maximum of two arbitrary statuses (w.l.o.g. we choose armor and personnel) is identified first and saved as ${\lambda }_u^{\max }$:

$${\lambda }_u^{\max }\ge s_{\mathrm{ar},u},\forall u\in \mathcal{U},$$

(43)

$${\lambda }_u^{\max }\ge s_{\mathrm{pe},u},\forall u\in \mathcal{U},$$

(44)

$${\lambda }_u^{\max }\le s_{\mathrm{ar},u}+S_{\max }{z}_{u,1}^{\max },\forall u\in \mathcal{U},$$

(45)

$${\lambda }_u^{\max }\le s_{\mathrm{pe},u}+S_{\max }(1-z_{u,1}^{\max }),\forall u\in \mathcal{U}.$$

(46)

Thereupon, the maximum of ${\lambda }_u^{\max }$ and the third status (in our case: equipment) is determined to find the “true” maximum $s_u^{\max }$:

$$s_u^{\max }\ge {\lambda }_u^{\max },\forall u\in \mathcal{U},$$

(47)

$$s_u^{\max }\ge s_{\mathrm{eq},u},\forall u\in \mathcal{U},$$

(48)

$$s_u^{\max }\le {\lambda }_u^{\max }+S_{\max }{z}_{u,2}^{\max },\forall u\in \mathcal{U},$$

(49)

$$s_u^{\max }\le s_{\mathrm{eq},u}+S_{\max }(1-z_{u,2}^{\max }),\forall u\in \mathcal{U}.$$

(50)

The minimum status $s_u^{\min }$ of a unit is determined similarly:

$${\lambda }_u^{\min }\le s_{\mathrm{ar},u},\forall u\in \mathcal{U},$$

(51)

$${\lambda }_u^{\min }\le s_{\mathrm{pe},u},\forall u\in \mathcal{U},$$

(52)

$${\lambda }_u^{\min }\ge s_{\mathrm{ar},u}-S_{\max }{z}_{u,1}^{\min },\forall u\in \mathcal{U},$$

(53)

$${\lambda }_u^{\min }\ge s_{\mathrm{pe},u}-S_{\max }(1-z_{u,1}^{\min }),\forall u\in \mathcal{U},$$

(54)

$$s_u^{\min }\le {\lambda }_u^{\min },\forall u\in \mathcal{U},$$

(55)

$$s_u^{\min }\le s_{\mathrm{eq},u},\forall u\in \mathcal{U},$$

(56)

$$s_u^{\min }\ge {\lambda }_u^{\min }-S_{\max }{z}_{u,2}^{\min },\forall u\in \mathcal{U},$$

(57)

$$s_u^{\min }\ge s_{\mathrm{eq},u}-S_{\max }(1-z_{u,2}^{\min }),\forall u\in \mathcal{U}.$$

(58)

The cost and efficiency of a unit are continuous piecewise linear functions of $s_u^{\max }$ and $s_u^{\min }$, respectively:

$$w_{u,i}^k\ge {\delta }_{u,i}^k,\forall u\in \mathcal{U},i\in \{1,\dots ,S_{\max }\},$$

(59)

$${\delta }_{u,i}^k\ge w_{u,i+1}^k,\forall u\in \mathcal{U},i\in \{1,\dots ,S_{\max }-1\},$$

(60)

$$s_u^{\max }=\sum _{i=1}^{S_{\max }}{\delta }_{u,i}^k,\forall u\in \mathcal{U},c\in \mathcal{C},$$

(61)

$$k_u=g_1^k{\delta }_{u,1}^k+\sum _{i=2}^{S_{\max }}(g_i^k-g_{i-1}^k){\delta }_{u,i}^k,\forall u\in \mathcal{U},c\in \mathcal{C},$$

(62)

$$w_{u,i}^v\ge {\delta }_{u,i}^v,\forall u\in \mathcal{U},i\in \{1,\dots ,S_{\max }\},$$

(63)

$${\delta }_{u,i}^v\ge w_{u,i+1}^v,\forall u\in \mathcal{U},i\in \{1,\dots ,S_{\max }-1\},$$

(64)

$$s_u^{\min }=\sum _{i=1}^{S_{\max }}{\delta }_{u,i}^v,\forall u\in \mathcal{U},c\in \mathcal{C},$$

(65)

$$v_u=g_1^v{\delta }_{u,1}^v+\sum _{i=2}^{S_{\max }}(g_i^v-g_{i-1}^v){\delta }_{u,i}^v,\forall u\in \mathcal{U},c\in \mathcal{C}.$$

(66)

The minimum status of a unit may or may not exceed a given level:

$$S_{\max }{\theta }_{u,b}\le S_{\max }+s_u^{\min }-b,\forall u\in \mathcal{U},b\in \mathcal{B},$$

(67)

$$s_u^{\min }-b\le S_{\max }{\theta }_{u,b}-\epsilon ,\forall u\in \mathcal{U},b\in \mathcal{B}.$$

(68)

Every region must contain a certain number of units with their lowest status between given levels:

$${\underline{n}}_r\left(b\right)\le \sum _{\begin{array}{c}u\in U:\\ r_u=r\end{array}}{\theta }_{u,b}\le {\overline{n}}_r\left(b\right),\forall r\in \mathcal{R},b\in \mathcal{B}.$$

(69)

Shipping costs are not allowed to exceed ${\sigma }_{\max }$:

$$\sum _{\begin{array}{c}c\in C,\\ u,u_1\in U\end{array}}{\kappa }_c·{\gamma }_{r_u,r_{u_1}}·d(u,u_1)·f_{c,u,u1}\le {\sigma }_{\max }.$$

(70)

The model (C) consists of (31)–(70).

4. Computational Results

4.1. A Demonstrator Example

We consider an instance with $U=5$ units, $C=3$ characteristics (armor, personnel, and equipment), and $S=8$ statuses. The ratings before the re-balancing can be found in the following matrix:

$${\left(p_{c,u}^0\right)}_{c,u}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.2& 0.7& 0.5& 0.9& 0.1\\ 0.5& 0.3& 0.7& 0.8& 0.4\\ 0.8& 0.5& 0.4& 0.9& 0.6\end{array}\right)\end{array}.$$

(71)

The coordinates and region of each unit can be found in

Table 3. Coordinates and region of units.

u	${\mathit{X}}_{\mathit{u}}$	${\mathit{Y}}_{\mathit{u}}$	${\mathit{r}}_{\mathit{u}}$
1	1	1	1
2	2	3	1
3	5	5	2
4	6	5	2
5	1	9	3

.

Shipping costs are defined as follows:

$${\left({\gamma }_{r_1,r_2}\right)}_{r_1,r_2}:=\begin{array}{cc}& \begin{array}{ccc}1& 2& 3\end{array}\\ \begin{array}{c}1\\ 2\\ 3\end{array}& \left(\begin{array}{ccc}1& 1.5& 2.5\\ 1.5& 1& 2\\ 2.5& 2& 1\end{array}\right)\end{array},{\kappa }_{\mathrm{ar}}=2,{\kappa }_{\mathrm{pe}}=0.3,{\kappa }_{\mathrm{eq}}=1.2.$$

(72)

Total shipping costs may not exceed ${\sigma }_{\max }=5$. In the following, this instance is modeled and solved in both the basic and the continuous model.

4.1.1. Basic Model

The interval range for the statuses of each characteristic are as follows:

$${\left({\underline{b}}_{c,s}\right)}_{c,s}:=\begin{array}{cc}& \begin{array}{cccccccc}1& 2& 3& 4& 5& 6& 7& 8\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{cccccccc}0.01& 0.06& 0.17& 0.35& 0.53& 0.71& 0.88& 0.96\\ 0.01& 0.09& 0.21& 0.35& 0.50& 0.65& 0.80& 0.96\\ 0.01& 0.09& 0.20& 0.35& 0.52& 0.65& 0.79& 0.96\end{array}\right)\end{array},$$

(73)

$${\left({\overline{b}}_{c,s}\right)}_{c,s}:=\begin{array}{cc}& \begin{array}{cccccccc}1& 2& 3& 4& 5& 6& 7& 8\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{cccccccc}0.05& 0.16& 0.34& 0.52& 0.70& 0.87& 0.95& 1.00\\ 0.08& 0.20& 0.34& 0.49& 0.64& 0.79& 0.95& 1.00\\ 0.08& 0.19& 0.34& 0.51& 0.64& 0.78& 0.95& 1.00\end{array}\right)\end{array}.$$

(74)

As an example, Figure 2 shows how the personnel ratings of the five units get converted into statuses.

Furthermore, cost coefficients

$${\left(k_s\right)}_s=(0.20,0.32,0.44,0.53,0.69,0.79,0.87,0.98)$$

(75)

and efficiency coefficients

$${\left(v_s\right)}_s=(0.02,0.14,0.28,0.41,0.59,0.71,0.83,0.92)$$

(76)

are given. Additionally, the following restrictions are enforced:

$${\underline{n}}_{1,3}=2,{\underline{n}}_{1,5}=1,{\underline{n}}_{2,7}=1;$$

(77)

$${\overline{n}}_{1,7}=1,{\overline{n}}_{3,5}=0.$$

(78)

By inspection of matrix ${\left(p_{c,u}^0\right)}_{c,u}$ one can see that the statuses of the units are as follows:

$$\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{lowest}\\ \mathrm{highest}\end{array}& \left(\begin{array}{ccccc}3& 3& 4& 7& 2\\ 7& 5& 6& 7& 5\end{array}\right)\end{array}.$$

(79)

The total costs are $K^0=3.91$, and the efficiency is $V^0=1.94$.

Running the above model with these input data leads to the following solution:

$${\left(p_{c,u}\right)}_{c,u}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.35& 0.55& 0.37& 0.96& 0.17\\ 0.35& 0.50& 0.49& 0.96& 0.40\\ 0.77& 0.52& 0.35& 0.96& 0.60\end{array}\right)\end{array}.$$

(80)

By inspection of matrix ${\left(p_{c,u}\right)}_{c,u}$ one can see that the statuses of units are as follows:

$$\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{lowest}\\ \mathrm{highest}\end{array}& \left(\begin{array}{ccccc}4& 5& 4& 8& 3\\ 6& 5& 4& 8& 5\end{array}\right)\end{array}.$$

(81)

The efficiency has increased to $V=2.61$ while the total costs have sunk to $K=3.68$. The shipping costs for the re-balancing operation add up to $2.822$.

4.1.2. Continuous Model

Defining $\mathcal{B}:=\{3,5,7\}$, the regional restrictions from Section 4.1.1 can be copied. The breakpoints of the piecewise linear functions are derived from the upper bounds ${\overline{b}}_{c,s}$ of the status intervals in the basic model:

$${\left(g_{c,i}\right)}_{c,i}:=\begin{array}{cc}& \begin{array}{cccccccc}1& 2& 3& 4& 5& 6& 7& 8\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{cccccccc}0.05& 0.16& 0.34& 0.52& 0.70& 0.87& 0.95& 1.00\\ 0.08& 0.29& 0.34& 0.49& 0.64& 0.79& 0.95& 1.00\\ 0.08& 0.19& 0.34& 0.51& 0.64& 0.78& 0.95& 1.00\end{array}\right)\end{array}.$$

(82)

To determine the cost and efficiency of a unit, we use

$$g^k=(0.20,0.32,0.44,0.53,0.69,0.79,0.87,0.98),$$

(83)

$$g^v=(0.02,0.14,0.28,0.41,0.59,0.71,0.83,0.92).$$

(84)

Converting ${\left(p_{c,u}^0\right)}_{c,u}$ into status values yields

$${\left(s_{c,u}^0\right)}_{c,u}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}2.222& 5& 0.889& 6.375& 1.455\\ 4.067& 2.2& 5.4& 6.706& 3.4\\ 6.118& 3.941& 3.353& 6.063& 4.692\end{array}\right)\end{array}.$$

(85)

Before the optimization, total costs add up to $K^0=3.707$. The total efficiency is $V^0=1.457$.

Re-balancing offers the following solution:

$${\left(p_{c,u}\right)}_{c,u}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.34& 0.70& 0.37& 0.20& 1\\ 0.16& 0.34& 0.64& 0.34& 1\\ 0.66& 0.64& 0.30& 1& 0.60\end{array}\right)\end{array},$$

(86)

corresponding to the following statuses:

$${\left(s_{c,u}\right)}_{c,u}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}3& 5& 2.222& 8& 2\\ 3& 5& 2.733& 8& 3.356\\ 5.143& 5& 2.733& 8& 4.692\end{array}\right)\end{array}.$$

(87)

Total costs have fallen to $K=3.423$ and total efficiency has been raised to $V=2.101$. Shipping costs amount to $\sigma =4.672$.

An overview of the location and initial strength of each unit together with the effect of the re-balancing is given in Figure 3.

4.2. Comparison of Solvers

In this section, we want to focus on the continuous model. After formulating the model as a mixed-integer linear programming problem as described in Section 3, numerical solvers can be used to find feasible solutions and—in the best case—verify that the provided solution is optimal. For our computations, we used an Apple MacBook Pro laptop running an Intel Core i7 at 3.10 GHz clock speed and 16 GB RAM. All instances were provided for the algebraic modeling language AMPL (version 20190927). The following solvers were available: CPLEX 12.9, Gurobi 8.1, Xpress 8.6.

To identify the best among the three solvers for instances of our model, we compared their performance on a variety of instances. For a fixed maximum status ($S_{\max }=5$) and number of regions ($R=9$), we varied the number of units between 5 and 30, generating 20 instances each. Coordinates were randomly assigned on a $100\times 100$ square area. Regions were determined by dividing the area into thirds horizontally and vertically. Shipping costs were generated so that ${\gamma }_{r_1,r_2}={\gamma }_{r_2,r_1}$ for all $r_1,r_2\in \mathcal{R}$ and ${\kappa }_{\mathrm{ar}}\ge {\kappa }_{\mathrm{eq}}\ge {\kappa }_{\mathrm{pe}}$. Regional restrictions were not enforced.

For this sample, Gurobi returned the best results. With Gurobi, instances were solved fastest or, when reaching the maximum computation time of one hour, left the smallest relative gaps between the best feasible solution found and the best upper bound. Average solution times for each solver can be seen in Figure 4. In total, Gurobi needed 684,422 s to solve all instances with the remaining gaps summing up to 147%. CPLEX needed 704,981 s and left a total sum of gaps of 207%. Solving all instances with Xpress took the longest time with 809,152 s and summed gaps of 263%. Consequently, we used Gurobi for all following computations. Note that although many instances exceeded the maximum computation time of one hour, Gurobi left gaps no bigger than 6.4%. In most cases, solutions with a remaining gap of <1% could be found in under a minute.

4.3. Analyzing Solver Performance

As we can see in Figure 4, increasing the number of units also increases the average computation time. In order to gain more detailed computation results, 20 instances for $U=31,\dots ,40$ were additionally solved with Gurobi. Solving all new instances took a total of 634,922 s. The results are displayed in Figure 5.

For 22 and more units, the optimal solution for the median instance could not be provided within an hour. However, outliers seem to occur independent of the amount of units: a 40-unit instance was solved in 5 s. The average gap was highest for $U=40$ with $1.02\%$.

4.4. A Real-World Example

Goal of this paper is the re-balancing of $U=75$ army units which are distributed over $R=12$ regions.

4.4.1. Basic Model

For a given status quo, each characteristic of every unit can be assigned to one of $S=5$ statuses with the following interval ranges:

$${\left({\underline{b}}_{c,s}\right)}_{c,s}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.01& 0.16& 0.65& 0.90& 0.98\\ 0.01& 0.05& 0.12& 0.36& 0.81\\ 0.01& 0.10& 0.35& 0.63& 0.96\end{array}\right)\end{array},$$

(88)

$${\left({\overline{b}}_{c,s}\right)}_{c,s}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.15& 0.64& 0.89& 0.97& 1.00\\ 0.04& 0.11& 0.35& 0.80& 1.00\\ 0.09& 0.34& 0.62& 0.95& 1.00\end{array}\right)\end{array}.$$

(89)

Cost and efficiency coefficients are chosen as follows:

$${\left(k_s\right)}_s=(0.27,0.51,0.68,0.81,0.94),$$

(90)

$${\left(v_s\right)}_s=(0.16,0.38,0.49,0.76,0.89).$$

(91)

The regional restrictions are listed in

Table 4. Regional restrictions for a 75-unit instance.

r	s	${\underline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$	${\overline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$	r	s	${\underline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$	${\overline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$	r	s	${\underline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$	${\overline{\mathit{n}}}_{\mathit{r}\mathbf{,}\mathit{s}}$
3	3	4	4	9	3	8	8	11	3	4	4
3	4	2	2	9	4	3	3	11	4	2	2
7	3	8	8	10	3	4	4	12	3	4	4
7	4	3	3	10	4	2	2	12	4	2	2

.

Furthermore, let ${\kappa }_{\mathrm{ar}}=0.9,{\kappa }_{\mathrm{pe}}=0.3,{\kappa }_{\mathrm{eq}}=0.8$.

The total costs prior to the optimization sum up to $K^0=56.37$, resulting in a total efficiency of $V^0=37.15$.

Re-balancing increases the total efficiency to $V=50.84$ (increase of 36.9%) while lowering the cost to $K=56.27$.

4.4.2. Continuous Model

For a given status quo, each characteristic of every unit can be assigned to a status $\in [0,5]$. The breakpoints for the piecewise linear functions of armor, personnel, and equipment are defined by the test functions $x\mapsto x^2$, $x\mapsto \sqrt{x}$, and $x\mapsto x$, respectively. For example, a square function used for the pe characteristic would impose a quadratic benefit from adding more personnel to a unit, which resembles to Lanchester’s square law, see in [23]. The breakpoints are given as follows:

$${\left(g_{c,i}\right)}_{c,i}:=\begin{array}{cc}& \begin{array}{ccccc}1& 2& 3& 4& 5\end{array}\\ \begin{array}{c}\mathrm{ar}\\ \mathrm{pe}\\ \mathrm{eq}\end{array}& \left(\begin{array}{ccccc}0.45& 0.63& 0.77& 0.89& 1.00\\ 0.04& 0.16& 0.36& 0.64& 1.00\\ 0.20& 0.40& 0.60& 0.80& 1.00\end{array}\right)\end{array}.$$

(92)

The corresponding piecewise linear functions are shown in Figure 6.

Let $g^k={\left(k_s\right)}_s$ and $g^v={\left(v_s\right)}_s$ from the basic model. All other parameters are taken over. An overview of the location and initial strength of each unit is given in Figure 7.

Before the re-balancing, the total efficiency equals $V^0=32.449$ with total costs of $K^0=50.971$. Afterwards, the efficiency is increased to $V=37.279$ (14.9% increase) while total costs have fallen to $K=48.754$. Shipping costs for the re-balancing operations sum up to $\sigma =750.834$. As a result of the re-balancing process, six units were closed. The effects can be seen in Figure 8.

The movements of each characteristic between the regions can be visualized in alluvial flow diagrams [24]. Exemplarily, the shifts of personnel are shown in Figure 9.

4.5. Trade-Off between Budget and Efficiency

In our model, we demand that the total costs of all units $K$ after the re-balancing cannot exceed the total costs $K^0$ beforehand. This constraint could either be loosened (e.g., by allowing a maximum cost increase of 10%) or tightened (e.g., by additionally forcing a 20% reduction of the total costs). With allowing a cost increase, one would hope for a corresponding increase in total efficiency. On the other hand, reducing the total costs will probably lessen the total efficiency. To check the effects of increasing or decreasing the maximum total costs, we reverted to the instance solved in Section 4.4.2. As we can see, the solution which maximizes efficiency includes total costs after of $K=48.754$ which are well below the total costs before ($K^0=50.971$). Raising the barrier for the maximum total costs would have no effect on the optimal solution. Therefore, the remaining question is how far the total costs can be reduced and what impact this has on the total efficiency. For this instance, the lowest possible costs (assuming no destruction of material or dismissal of personnel) sum up to $K=46.297$ (5.0% less compared to the “highest efficiency” solution). However, efficiency also dropped to $V=34.534$ (7.4% decrease). To identify the behavior of costs and efficiency between these two extremes, instances were solved where the maximum costs were restricted to a value in the interval $[46.30,48.75]$, applying the epsilon-constraint method as described in [25]. In these computations, shipping costs were ignored to speed up the process. In total, 51 instances were solved within a time restriction of one hour each, leaving a maximum gap of 0.22%. Total computation time was 109,626 s. The results are shown in Figure 10.

5. Conclusions

We gave a nonlinear mixed-integer model formulation for the re-balancing of resources or assets for security services. The resources or assets are moved from one unit to another. The model can be re-formulated as a mixed-integer linear program, so that it is solvable with standard numerical solvers for this problem class. It turns out that it is possible to achieve an increasing active operating strength and more efficiency with the same operational budget.

The study employed anonymized data from army units. The results indicate that re-balancing the resources has an extremely positive influence on the efficiency of the units. At the same time the total operational cost can be reduced. The way of organizing the units after the re-balancing procedure creates a force that is more effective for today’s tasks.

Future research in this topic could focus on the trade-off between budget and efficiency. As the example in Figure 10 showed, total costs can be reduced significantly if one allows a minor reduction of efficiency. Consequently, one could consider a bi-objective optimization maximizing $V$ and minimizing $K$ to compute the Pareto front and to trade off between the two conflicting objectives. Shipping costs would be disregarded in this formulation as a reduction of long-term costs could be considered more important than the one-time shipping expenses. Epsilon-constraint and two-phase methods may efficiently solve this formulation. Other future projects could consider the case where certain parameters (e.g., ratings and breakpoints of the piecewise linear functions) are uncertain. Open-source solvers like CBC could be compared to the commercial solvers used in this paper.