## 3 Applications to Communication Network Design
### Overview of Selected Papers
#### 3.2.3 Models That Include the Resolution of MOPPs by Non-Dedicated Path Approaches  
Herein, we overview contributions representative of routing models and path-related models for different types of communication networks such that the mathematical formulation of the model includes multiobjective path problems, solved by approaches not specifically dedicated to MOPPs. A summary of some essential features of these models is in Table 6.  
In [178], a very specific problem of route selection for survivable book-ahead guaranteed (BAG) services in MPLS networks is tackled. The authors consider different and potentially conflicting objectives and different survivability requirements for the service requests. The survivable BAG services must be routed without significantly affecting best effort services. To guarantee the survivability, a pair of link-disjoint paths (primary and secondary paths) is calculated by recurring to a MILP formulation, considering four different optimization objectives: residual capacity, routing cost, a penalty cost for non-routed demands and routing revenue. An iterative heuristic is proposed to solve the formulated problem. A multiobjective routing model for supporting a long-term virtual private network on the Internet is proposed in [134], using an integer multicommodity flow approach with special constraints. This leads to a biobjective path model considering average packet delay and traffic load balancing as OFs. A heuristic of the type Greedy Randomized Adaptive Search procedure is used as the resolution method. A metaheuristic procedure for solving a multiobjective routing problem in MPLS networks is proposed in [124]. In this paper, a variable neighborhood multiobjective genetic algorithm (VN-MGA) is developed, aiming at the minimization of the network cost, the minimization of the number of rejected simultaneous requests and the maximization of arc bandwidth load. Results are compared with those obtained with an ILP solver. In [179], there is a proposal of a multiobjective routing model for MPLS considering traffic splitting (in terms of bandwidth) leading to a multipath routing problem addressed with a MILP formulation. The OFs are the average packet delay, a traffic load balancing function and the total number of used LSPs (Label-Switched Paths). The resolution method \begin{table}
\begin{tabular}{p{113.8 pt} p{113.8 pt} p{113.8 pt} p{113.8 pt}} \hline \hline
**Reference** & **\# Objectives * & **Type of Model** & **Approach/Auxiliary Method** \\ \hline ([PERSON] et al., 2005) [173] & 2 & Hierarchical stochastic multiobjective & Heuristic/Biobjective stochastic shortest path algorithm \\ ([PERSON] et al., 2009) [175] & 2 & Hierarchical stochastic multiobjective with two traffic classes & Heuristic/Biobjective stochastic shortest path algorithm \\ ([PERSON] and [PERSON] 2022) [133] & 2 & Stochastic biobjective path pair (resilient routing) & Metaheuristic/\(k\)-shortest path algorithm \\ \hline ([PERSON] 2003) [177] & 1 & Shortest path based biobjective routing with traffic splitting & Heuristic (for biobjective weight setting problem)/Shortest path algorithm \\ ([PERSON] et al., 2011) [123] & 2 & Shortest path based multiobjective routing with traffic splitting & Metaheuristic (for multiobjective weight setting problem)/Shortest path algorithm \\ \hline \hline \end{tabular}  
* number of objective functions of the auxiliary resolution procedure.  
\end{table} 
Table 5: Summary of some essential features of routing models that use shortest path dedicated algorithms as auxiliary resolution procedures. is based on an evolutionary algorithm, and the results are compared with those of an alternative resolution procedure. Paper [120] presents a metaheuristic resolution approach for the stochastic hierarchical multiobjective routing model for MPLS networks with two service classes including fairness objectives developed in [175].