*3.2. Model Description*

Based on the previous assumptions, we introduce the DICP, which is a generalization of the DICP-MV presented in Broihan et al. [8], as a linear program in binary variables as follows:

$$\min F = \sum\_{\upsilon \in \mathcal{P}} \left( c\_{\upsilon}^{psu} \cdot \mathbf{Y}\_{\upsilon} + \sum\_{l \in \mathcal{L}\_{\upsilon}} c\_{l}^{itu} \cdot \mathbf{X}\_{l\upsilon} \right) \tag{1}$$

such that

$$\sum\_{\mathbf{c}\in\mathcal{P}}\sum\_{l\in\mathcal{L}\_{\mathbf{c}}\cap\mathcal{L}\_{\mathbf{c}}}X\_{l\upsilon}\cdot\mathbf{e}i\_{l}\geq\mathbf{e}c\_{r}\tag{2}$$

$$X\_{lv} \le Y\_v \tag{3}$$

$$\sum\_{v \in \mathcal{P}\_l} X\_{lv} \le 1 \tag{4}$$

$$\sum\_{l' \in \Gamma\_{lv}} X\_{l'v} \ge X\_{lv} \tag{5}$$

$$X\_{l\boldsymbol{\nu}}\,\boldsymbol{Y}\_{\boldsymbol{\nu}}\in\{0,1\}\tag{5.1}$$

The objective function (1) minimizes the total investment in the components of the dynamic-inductive charging infrastructure. Constraint (2) ensures a sufficiently large energy intake while serving a request *r* ∈ R. According to constraint (3), ITU and PSU installation decisions are connected. Restriction (4) ensures that each link can be equipped at most once with an ITU, in which case it is connected to exactly one installed PSU. Restriction (5) enforces a connected ITU infrastructure from the furthest ITU along a shortest path to the powering PSU.
