Modified differential evolution algorithm for the continuous network design problem

Abstract The Continuous Network Design Problem (CNDP) is recognized to be one of the most difficult problems in transportation field since the bilevel formulation of the CNDP is nonconvex. On the other hand, the computation time is crucial importance for solving the CNDP because the algorithms implemented on real sized networks require solving traffic assignment model many times, which is the most time consuming part of the solution process. Although the methods developed so far are capable of solving the CNDP, an efficient algorithm, which is able to solve the CNDP with less number of User Equilibrium (UE) assignments, is still needed. Therefore, this paper deals with solving the CNDP using MOdified Differential Evolution (MODE) algorithm with a new local search and mutation operators. For this purpose, a bilevel model is proposed, in which the upper level problem deals with minimizing the sum of total travel time and investment cost of link capacity expansions, while at the lower level problem, UE link flows are determined by Wardrop's first principle. A numerical example is presented to compare the proposed MODE algorithm with some existing methods. Results showed that the proposed algorithm may effectively be used in order to reduce the number of UE assignments in solving the CNDP.

[1]  Ozgur Baskan.  Harmony search algorithm for continuous network design problem with link capacity expansions , 2014 .

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

[3]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[4]  Toshihide Ibaraki,et al.  Optimal scheduling policies in time sharing service systems , 1995 .

[5]  Terry L. Friesz,et al.  Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints , 1990, Math. Program..

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

[7]  Gary A. Davis,et al.  Exact local solution of the continuous network design problem via stochastic user equilibrium assignment , 1994 .

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

[9]  Hai Yang,et al.  Sensitivity analysis for the elastic-demand network equilibrium problem with applications , 1997 .

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

[11]  Patrice Marcotte,et al.  Efficient implementation of heuristics for the continuous network design problem , 1992, Ann. Oper. Res..

[12]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[13]  Hong Kam Lo,et al.  Global Optimum of the Linearized Network Design Problem with Equilibrium Flows , 2010 .

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

[15]  Yang Hai,et al.  Sensitivity analysis for queuing equilibrium network flow and its application to traffic control , 1995 .

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

[17]  Yong Wang,et al.  Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization , 2010, Appl. Soft Comput..

[18]  Hai Yang,et al.  A global optimization method for continuous network design problems , 2012 .

[19]  Jiangang Lu,et al.  Decomposition Scheme for Continuous Network Design Problem with Asymmetric User Equilibria , 2006 .

[20]  Ozgur Baskan,et al.  Artificial bee colony algorithm for continuous network design problem with link capacity expansions , 2012 .

[21]  Ozgur Baskan.  Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights , 2013, J. Appl. Math..