Performance Analysis of a Bi-Objective Model for Routing with Protection in WDM Networks

The operation of wavelength division multiplexing (WDM) networks involves not only the establishment of lightpaths, defining the sequence of optical fibres and the wavelength in each fibre for traffic flow, but also a fault management scheme in order to avoid the huge loss of data that can result from a single link failure. Dedicated path protection, which establishes two end-to-end disjoint routes between the source-destination node pair, is an effective scheme to preserve customers' connections. This paper reviews a bicriteria model for dedicated path protection, that obtains a topological path pair of node-disjoint routes for each lightpath request in a WDM network, developed by the authors. An extensive performance analysis of the bicriteria model is then presented, comparing the performance metrics obtained with the monocriterion models using the same objective functions, in four different reference networks commonly used in literature

A memetic algorithm for multi-objective dynamic location problems

Abstract This paper describes a new multiobjective interactive memetic algorithm applied to dynamic location problems. The memetic algorithm integrates genetic procedures and local search. It is able to solve capacitated and uncapacitated multi-objective single or multi-level dynamic location problems. These problems are characterized by explicitly considering the possibility of a facility being open, closed and reopen more than once during the planning horizon. It is possible to distinguish the opening and reopening periods, assigning them different coefficient values in the objective functions. The algorithm is part of an interactive procedure that asks the decision maker to define interesting search areas by establishing limits to the objective function values or by indicating reference points. The procedure will be applied to some illustrative location problems