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.

[1]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[2]  Tong Heng Lee,et al.  Multiobjective Evolutionary Algorithms and Applications , 2005, Advanced Information and Knowledge Processing.

[3]  Michiel C.J. Bliemer,et al.  Pruning and ranking the Pareto optimal set, application for the dynamic multi-objective network design problem , 2014 .

[4]  Sushant Sharma,et al.  Capacity Expansion Problem for Large Urban Transportation Networks , 2009 .

[5]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[6]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[7]  Sushant Sharma,et al.  Multiobjective Network Design for Emission and Travel-Time Trade-off for a Sustainable Large Urban Transportation Network , 2011 .

[8]  Sushant Sharma,et al.  Continuous Network Design with Emission Pricing as a Bi-Level Optimization Problem , 2006 .

[9]  Terry L. Friesz,et al.  A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..

[10]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[11]  Michiel C. J. Bliemer,et al.  Comparison of Multiobjective Evolutionary Algorithms for Optimization of Externalities by Using Dynamic Traffic Management Measures , 2011 .

[12]  Larry J. LeBlanc,et al.  An efficient dual approach to the urban road network design problem , 1979 .

[13]  Suh-Wen Chiou,et al.  Bilevel programming for the continuous transport network design problem , 2005 .

[14]  T. Friesz,et al.  The multiobjective equilibrium network design problem revisited: A simulated annealing approach , 1993 .

[15]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[16]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[17]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[18]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[19]  George B. Dantzig,et al.  Formulating and solving the network design problem by decomposition , 1979 .

[20]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[21]  P H Mijjer,et al.  OPTIMIZATION OF TRANSPORT NETWORK , 1989 .

[22]  Giulio Erberto Cantarella,et al.  Heuristics for urban road network design: Lane layout and signal settings , 2006, Eur. J. Oper. Res..

[23]  Hossain Poorzahedy,et al.  Hybrid meta-heuristic algorithms for solving network design problem , 2007, Eur. J. Oper. Res..

[24]  David E. Boyce,et al.  A discrete transportation network design problem with combined trip distribution and assignment , 1980 .

[25]  Ziyou Gao,et al.  Solution algorithm for the bi-level discrete network design problem , 2005 .

[26]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[27]  S. Waller,et al.  Dynamic Continuous Network Design Problem , 2006 .

[28]  Fang Zhao,et al.  Simulated Annealing-Genetic Algorithm for Transit Network Optimization , 2006 .

[29]  Hai Yang,et al.  An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem , 2001 .

[30]  Ghulam Q. Memon,et al.  Multivariate Optimization Strategies for Real-Time Traffic Control Signals , 1996 .

[31]  Heng Wei,et al.  Study on continuous network design problem using simulated annealing and genetic algorithm , 2009, Expert Syst. Appl..

[32]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[33]  Satish V. Ukkusuri,et al.  Pareto Optimal Multiobjective Optimization for Robust Transportation Network Design Problem , 2009 .

[34]  Gwo-Hshiung Tzeng,et al.  Application of multiple criteria decision making for network improvement , 1997 .

[35]  Luc Johannes Josephus Wismans,et al.  Aan de slag met veilige regionale bereikbaarheid. Gebiedsgericht Benutten plus Duurzaam Veilig met RBV , 2007 .

[36]  Jian Lu,et al.  Genetic Algorithm for Continuous Network Design Problem , 2007 .

[37]  Yafeng Yin,et al.  Multiobjective bilevel optimization for transportation planning and management problems , 2002 .

[38]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.