Pareto Optimal Multiobjective Optimization for Robust Transportation Network Design Problem

Abstract

A study was done to formulate and solve the multiobjective network design problem with uncertain demand. Various samples of demand are realized for optimal improvements in the network while the objectives of the expected total system travel time and the higher moment for total system travel time are minimized. A formulation is proposed for multiobjective robust network design, and a solution methodology is developed on the basis, of a revised fast and elitist nondominated sorting genetic algorithm. The developed methodology has been tested on the Nguyen-Dupuis network, and various Pareto optimal solutions are compared with earlier work on the single-objective robust network design problem. A real medium-size network was solved to prove efficacy of the model. The results show better solutions for the multiobjective robust network design problem with relatively less computational effort.