## 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
Two resolution procedures are proposed, the first one a simulated annealing based technique, the second one using a tabu search technique, and both are compared with a specialized heuristic. The work in [180] describes a multiobjective routing model for MPLS networks, with multiple service types and traffic splitting, considering a network flow approach so that the routing problem is formulated as a multiobjective mixed-integer linear program having as objective functions the routing cost and the load cost in the network links, including a constraint on maximal splitting of each service bandwidth demand. Two exact resolution methods are developed for obtaining the Pareto optimal solutions, the first one based on the classical constraint method in [77] and the second based on the modified constraint method in [181]. This MILP model is extended in [182] to include a path protection resilient routing scheme (without traffic splitting) and solved exactly by the classical constraint method, after enumerating feasible disjoint path pairs for each traffic flow with the aid of an algorithm based on the \(k\)-shortest path algorithm MPS [71]. A multiobjective routing model for wireless IP-based networks is proposed in [183], seeking to obtain paths which minimize total energy consumption, latency and bit error rate (corresponding to a non-additive metric). The resolution method is based on the optimization of a normalized weighted additive function combining the three OFs, to seek for efficient solutions; a distributed heuristic implementation of the method is described and applied to small test networks. Paper [184] proposes a biobjective routing model for mobile ad-hoc Wireless Networks that consider minimized energy consumption and link stability as OFs, leading to a dynamic biobjective constrained shortest path formulation. This type of wireless networks is composed of a collection of mobile devices that form a self-organizing temporary network that does not use an underlying telecommunication structure or a centralized control. A heuristic resolution method is used which is based on the optimization of the combination of the two OFs, using an ILP formulation, seeking to account for the dynamic nature of the model and the distributed nature of the routing control. A multiobjective routing model for Wireless Sensor Networks (WSNs) is described in [185]. These networks are composed of sensor nodes installed with the objective of gathering real-time information of specific type(s), in a given area, so that the obtained data are forwarded to an interface node, the sink node. The optimization objectives associated with each node are residual energy, frequency count of packet transmission via a node and number of hops counted from the sink node. The proposed resolution method is a heuristic based on a utility function defined for each node that is the additive aggregation of the OFs, using different weight sets, empirically obtained in terms of the resulting packet loss ratio. Similar types of models and multiattribute resolution approaches are presented in [186] (where the weights are chosen by a 'weight rating' method) and [187; 188] that use a decision matrix for choosing the next node to be selected in the path. Note that many multicriteria routing models proposed for WSNs use 'hop-by-hop' path calculation heuristics based on a weighted utility function, such that the next node in the path is selected among the adjacent nodes by using a multiattribute model recurring to a performance matrix updated at each step of the procedure. The work in [189] proposes a generic multicriteria routing framework for WSNs regarding the criteria to be addressed and discusses a form of additive aggregation based on technical features of the used routing protocol.