The aim of this talk is to address the determination of K alternative paths linking two given nodes in a network. In particular the paths are expected to minimize simultaneously a linear objective function and a similarity measure based on the overlaps between them. The problem is modelled by means of single-commodity and discretized flow formulations, first considering only the optimization of one of the objectives. Afterwards, the formulations are extended to the bi-objective case and a method for calculating a Pareto front for the resulting problems is discussed.

The talk is based on joint work with M. T. Godinho and A. Moghanni.