The multi-objective network design problem using minimizing externalities as objectives: comparison of a genetic algorithm and simulated annealing framework

Incorporation of externalities in the Multi-Objective Network Design Problem (MO NDP) as objectives is an important step in designing sustainable networks. In this research the problem is defined as a bi-level optimization problem in which minimizing externalities are the objectives and link types which are associated with certain link characteristics are the discrete decision variables. Two distinct solution approaches for this multi-objective optimization problem are compared. The first heuristic is the non-dominated sorting genetic algorithm II (NSGA-II) and the second heuristic is the dominance based multi objective simulated annealing (DBMO-SA). Both heuristics have been applied on a small hypothetical test network as well as a realistic case of the city of Almelo in the Netherlands. The results show that both heuristics are capable of solving the MO NDP. However, the NSGA-II outperforms DBMO-SA, because it is more efficient in finding more non-dominated optimal solutions within the same computation time and maximum number of assessed solutions.