Research Article  Open Access
Bian Changzhi, "A Nondominated Genetic Algorithm Procedure for Multiobjective Discrete Network Design under Demand Uncertainty", Mathematical Problems in Engineering, vol. 2015, Article ID 541782, 8 pages, 2015. https://doi.org/10.1155/2015/541782
A Nondominated Genetic Algorithm Procedure for Multiobjective Discrete Network Design under Demand Uncertainty
Abstract
This paper addresses the multiobjective discrete network design problem under demand uncertainty. The OD travel demands are supposed to be random variables with the given probability distribution. The problem is formulated as a bilevel stochastic optimization model where the decision maker’s objective is to minimize the construction cost, the expectation, and the standard deviation of total travel time simultaneously and the user’s route choice is described using user equilibrium model on the improved network under all scenarios of uncertain demand. The proposed model generates globally nearoptimal Pareto solutions for network configurations based on the Monte Carlo simulation and nondominated sorting genetic algorithms II. Numerical experiments implemented on NguyenDupuis test network show tradeoffs among construction cost, the expectation, and standard deviation of total travel time under uncertainty are obvious. Investment on transportation facilities is an efficient method to improve the network performance and reduce risk under demand uncertainty, but it has an obvious marginal decreasing effect.
1. Introduction
A collection of models dealing with decision problems related to transportation infrastructure investment is called a network design problem (NDP). The NDP is to improve transportation network by selecting facilities (e.g., entirelane or new link) to add to a transportation network or to determine capacity enhancements of existing facilities of a transportation network, under certain investment constraints and considering route choice behaviors of the network users. Bilevel programming models are used for transportation investment decision problems because the bilevel structure enables us to describe both policy makers’ decisions and travelers’ behaviors. Yang and Bell [1] proposed a general form of a bilevel programming model for NDP as follows: where is implicitly defined by When the decision vector in the upperlevel is discrete, the bilevel programming is a discrete network design problem (DNDP). When we assume the links with a certain capacity are to be either built or not built, the DNDP is a better fit for the planning problem.
There are a lot of literatures on developing formulations and solution algorithms for the deterministic DNDP. Leblanc [2] developed a branchandbound algorithm for the DNDP, but the bounding step was dependent on the assumption that additional link improvements would always reduce total user cost. Chen and Alfa [3] presented some computational experiences in solving DNDP where the route selection is based on a stochastic incremental traffic assignment approach. Yang and Bell [1] gave a thorough review on NDP model and various solution algorithms. Gao et al. [4] proposed a traditional bilevel programming model for DNDP and a new solution algorithm using the support function concept. Farvaresh and Sepehri [5] proposed a new branchandbound algorithm being able to find exact solution of the DNDP, and a lower bound for the upperlevel objective and its computation method were developed. Wang et al. [6] developed a dynamic outerapproximation scheme to make use of the stateoftheart mixedinteger linear programming solvers to solve the SOrelaxation formulation for DNDP.
Most of the work so far has primarily been concentrated in developing methodologies for the deterministic NDP. Practically, there are a number of uncertainties in the NDP. Uncertainty in travel demand is typical in longterm forecasting. Sun and Turnquist [7] proposed a model of investment planning for transportation networks to maximize expected system capacity subject to uncertainty that will occur in the future demand pattern. Ukkusuri et al. [8] addressed a robust network design model under demand uncertainty. Chung et al. [9] formulated a robust network design problem as a tractable linear programming model and demonstrated the model robustness by comparing its solution performance with the nominal solution from the corresponding deterministic model.
Moreover, many transportation planning problems involve multiple conflicting objectives that should be considered simultaneously. Chen et al. [10] developed a meanvariance model for determining the optimal toll and capacity in a BOT roadway project subject to traffic demand uncertainty. Lin and Xie [11] proposed a parameterizationbased heuristic that resembles an iterative divideandconquer strategy to locate a Pareto optimal solution in each divided range of commensurate parameters to study equilibrium transportation network design problems with multiple objectives. Yang et al. [12] formulated a multiobjective discrete transportation network design model using the chance constrained model and the ideal point model.
In this paper, a new multiobjective discrete network design problem (MDNDP) under demand uncertainty is formulated using bilevel stochastic optimization approach and solved by nondominated sorting GA technique. This formulation takes into account not only expected total travel time but also the risk reflected by the variance of the total travel time and the construction cost. The results of the model provide a set of Pareto optimal solutions to be used by the decision makers to find the best configuration according to their preferences. This paper is organized as follows. In Section 2, the formulation of MDNDP under demand uncertainty is presented. In Section 3, we explain the nondominated sorting genetic algorithm II (NSGA II) technique to solve the multiobjective problem. Section 4 presents the computational experiments. Finally, the conclusion of the paper is drawn in Section 5.
2. MDNDP under Uncertainty
2.1. Multiobjective under Uncertainty
Uncertainty in longterm OD demand is considered here. It is important because the investment decisions made in present have a significant effect into the future. In urban transportation planning, there are several different goals faced by decision makers, such as total travel time, construction cost, consumer surplus, and accessibility. These goals can be considered simultaneously using the technique of multiobjective optimization.
The multiobjective optimization where the set of feasible solutions is not explicitly known in advance but is restricted by constraint functions can be formulated as follows:where is the decision vector, is the objective vector, is the domain of vector in dimension space, is the domain of vector in dimension space, and the constrains determine the feasible region of decision vector.
In multiobjective optimization problems, multiple objective functions need to be optimized simultaneously. Instead of aiming to find a single solution, the objective is to produce a set of good compromises from which the decision maker will select one. These solutions are known as nondominated, efficient, noninferior, or Pareto optimal solutions. Given a set of multiobjective solutions, some of this set will be dominated by others in this set. Those that are not dominated by any others in that set form what we call the Pareto set. In objective space, the set of objective vectors corresponding to the Pareto set is called the Pareto front.
In this study, the OD travel demands are assumed to be uncertain and can be described using a probability distribution. Expected total travel time (TTT) minimization is an important goal under the realization of all demand scenarios. However, if planners want to reduce the risk in investment decision on transportation facilities, minimization of standard deviation of TTT becomes another important goal. Moreover, the construction cost minimization of infrastructure is always one of the goals faced by decision makers and it is also considered in our model.
2.2. Model Formulation
The main focus of the present paper is to present a formulation to MDNDP which is capable of handling investment decisions under multiobjective and demand uncertainty. Here, OD travel demand is supposed as a random variable submitting to the given probability distribution. In practical calculation, when Monte Carlo random sampling is used to form a demand scenario set , any demand scenario realization is . To analyze the tradeoffs among construction cost, expectation, and the standard deviation of TTT, a new MDNDP model under OD demand uncertainty is formulated using bilevel programming. The upperlevel model is to minimize three objectives simultaneously, the expectation of TTT, the standard deviation of TTT, and the construction cost under all realization scenarios of the random OD demand. The links to be built or expanded will be decided in the upperlevel model. The lowerlevel model is the corresponding user equilibrium of each demand scenario under the improved network decided by the upperlevel model. The resultant MDNDP becomes as follows: where is implicitly defined by the following lowerlevel model: The travel time of link is defined using BPR function: where we have the following: : links set of transportation network; : set of new built or expanded links; : trip generation nodes set; is one of generation nodes; : trip attraction nodes set; is one of attraction nodes; : OD between generation node and attraction node ; : paths set between origin node and destination node ; : traffic volume on link ; : travel time impedance function of link ; : traffic volume using path between OD pair ; : traffic time impedance on path between OD pair ; : indicator variable (1 if link belongs to path between OD , 0 otherwise); : decision variable (1 when link will be built or expanded, otherwise 0); : capacity of link ; : cost of new built or expanded link ; : all possible scenarios set of uncertain travel demand; : any realization of uncertain travel demand; : realization probability of uncertain travel demand scenario ; : travel time impedance on link under free flow in BRP function; : parameters in BPR function.
3. Solution Methodology
Because the formulation is intractable with traditional optimization methods, the MDNDP is better suited for the application of metaheuristics. In this section, we make a brief overview of GA and its application in NDP. Then the solution procedure is presented for MDNDP formulated in previous section using nondominated sorting genetic algorithm II (NSGA II).
3.1. Overview of GA and Its Application in NDP
Genetic algorithms (GA) developed by Holland [13] are one of the best known algorithms in evolutionary computation, which imitates living beings to develop powerful algorithms for difficult optimization problems.
Genetic algorithm is a search algorithm, which works starting from an initial collection of strings representing possible solutions of the problem. Each string of the populations is called a chromosome and has an associated value called a fitness function that contributes to the generation of new populations by means of genetic operators (denoted as reproduction, crossover, and mutation). The initial population is generated randomly, or it may consist of a number of known solutions, or a combination of both. The GA goes through a number of steps in which the population at the beginning of each step is replaced with another population, which hopefully will include better solutions to the problem. The chromosomes at each new generation are produced by a process called reproduction, in which the chromosomes of the old population are combined to create new ones. A detailed explanation of the working of GA can be found in Goldberg [14] and Deb [15].
In the past few years GA has been used in optimization problems in transportation such as NDP. Yin [16] proposed a genetic algorithm based approach to solve the bilevel optimization and compared the performance of the algorithm with the previous sensitivityanalysis based algorithms. Results show that the GA based approach is efficient and much simpler. Jeon et al. [17] proposed a new solution search procedure based on the selectorecombinative genetic algorithm for DNDP. Chen et al. [18] give a multiobjective genetic algorithm procedure for BOT network design problem.
3.2. Nondominated Sorting Genetic Algorithm II
Nondominated sorting genetic algorithm II is an efficient algorithm to solve multiobjective optimization problems proposed by Deb et al. [19]. The procedure of NSGA II can be summarized as follows.
Step 1 (initialization).
Consider the following.
Step 1.1. Determine the basic parameter of GA.
Step 1.2. A random parent population is created. Selection, crossover, and mutation operators are used to create an offspring population . Both sizes of and are .
Step 2 (for the generation). Consider the following.
Step 2.1. Combine the and to form population of size 2.
Step 2.2. Sorting population according to nondomination and the best nondominated set is created.
Step 2.3. Calculate the crowding distance for every individual in .
Step 2.4. Choose to population , until the size of population exceeds ; the last nondominated set is .
Step 2.5. Crowding distance sorting for every individual in , choose the best solutions of to fill all population slots.
Step 2.6. Use the selection, crossover, and mutation operators for to create a new population .
Step 3. End, the Pareto front is formed.
3.3. Demand Simulation and UE Solution Algorithm
To handle travel demand uncertainty in the model, stochastic sampling technique is used to simulate uncertain OD demand based on a probability distribution with predefined expectation and variance. In this study, Monte Carlo simulation is used to generate random OD demand according to a truncation normal distribution. The parameters used are the expectation and variance coefficient in the distribution. It should be noted that other distributions could also be used. The potential OD demand is chosen as the only key exogenous input variables to reflect the uncertainty of travel demand. Under every scenario of OD demand realization, the UE model in lowerlevel is solved using FrankWolfe method presented in Sheffi [20].
3.4. Algorithm Procedure for MDNDP
The algorithm procedure for MDNDP is proposed in Figure 1 and discussed in the following.
Step 1 (initialization). Consider the following.
Step 1.1. Determine the basic settings of GA, including encoding, population size , fitness function, crossover probability, mutation probability, and evolution generation .
Step 1.2. Given the sampling size of OD demand , a random parent population is created. Implement the budget constraint to get enough feasible individuals.
Step 2 (for every individual in generation ). Consider the following.
Step 2.1. Update the transportation network.
Step 2.2. Implement the demand sampling and UE assignment for every OD scenario.
Step 2.3. Calculate the objectives in upperlevel according to all UE assignment traffic flows in all OD scenarios.
Step 3. Update the population using NSGA II.
Step 4. End, the Pareto front is formed.
4. Case Study
4.1. Basic Settings
The main results of the MDNDP model are demonstrated on a middlesized network shown in Figure 2, the network of Nguyen and Dupuis [21], which has been extensively used before by researchers for testing NDP. This network has 13 nodes, 19 existing links, 6 new built links, and 4 OD pairs. A solid line indicates an existing link and can be expanded while a dotted line indicates a link which could be new built.
The parameters in the case are given as follows. Expectation of all 4 OD demands is 350, and the variance coefficient in truncation normal distribution of every OD demand is 0.2. Here, for every OD demand 50 random samplings are implemented. In NSGA II the binary encoding is used where 1 means new built or improvement on existing links and 0 otherwise. The length of chromosomes is 25. For example, the chromosome 0000010000000000000111111 means link 6 will be expanded and links from 20 to 25 are chosen to be built. The population size is set as 50. Updating generation ranges to 100, the fitness function is calculated by ranking the objective function of all individuals. The selection operator is binary tournament selection. The crossover operator is singlepoint crossover with probability 0.8 and the mutation operator is singlepoint mutation with probability 0.01. The parameters and in BPR function are used. Other settings are shown in Figure 2 and Table 1, including the link indicator, free flow time, existing capacity, planned capacity, and construction cost of every link.

4.2. Experiment Results
Figure 3 shows the Pareto front of the solutions of MDNDP on NguyenDupuis network. Figures from 4 to 6 are the projection of the Pareto front on the axis of standard deviation of TTT, expectation of TTT, and construction cost.
The Pareto front here consisted of 50 Pareto optimal solutions. Each dot in the front indicates a different configuration to the NguyenDupuis network. Different from the deterministic optimization, the dots in the figures are not distributed in a strict smooth curve. The dots have a small deviation surrounding the curve because the OD demand is random and the Monte Carlo sampling size is set as 50 times. The OD demand is different from the previous one when updating the population in NSGA II, so there is a little difference among the solutions. But the difference is very small, and we can improve the results by raising the sampling size of OD demand, so the results are acceptable in practical application.
Some findings can be observed according to the results above.(1)Figure 3 indicates that there are tradeoffs among the construction cost, the expectation of TTT, and the standard deviation of TTT.(2)Figure 4 shows the tradeoff between the construction cost and the expectation of TTT. When the construction cost ranges from 0 to 2100, the expected total travel time decreases from to . However marginal effect to build or expand links on the network is different, and the effect is decreasing usually. For example, the investment on initial 5 links makes the expectation of TTT change from to ; the changing extent is about 42% to previous network, while investment on the following 5 links just makes 10% decrease in the expected total travel time. This result is similar to Kim et al. [22], in which a dynamic DNP formulation is proposed and the results show that more benefit can be obtained by an early investment.(3)Figure 5 shows the tradeoff between the construction cost and the standard deviation of TTT. When the construction cost ranges from 0 to 2100, the standard deviation of TTT decreases from to . The marginal decreasing effect is also obvious. And the changing range of the standard deviation of TTT is larger than the expectation under certain construction cost. This result demonstrates that investment on initial key links is very efficient to reduce the risk caused by demand uncertainty.(4)Figure 6 shows the tradeoff between the expectation and standard deviation of TTT. It indicates that the expectation and the standard deviation both decrease when the investment on network is expanded, while, under a certain restriction of construction cost, there is an inverse relationship between the expectation and the standard deviation of TTT. The meanvariance tradeoff under certain investment illustrated here is similar to the famous models introduced in Finance by Markowitz [23]. Moreover, the results show that when the investment on networks is bigger, the changing range surrounding the average of the expectation and the standard deviation of TTT is smaller, especially the standard variance.
5. Conclusions
In this paper, a multiobjective discrete network design problem under demand uncertainty is investigated. The model formulation and solution approach presented here provide a means for accounting for uncertainty in network design decisions on the tradeoffs among expected network performance, risk, and investment, when the longterm OD demand is supposed to be a random variable. The problem is formulated as a bilevel optimization model where the planner’s objective is to minimize the expectation of TTT, the standard deviation of TTT, and construction cost and the user’s route choice is dependent on user equilibrium under all scenarios of uncertain demand. An efficient solution approach based on NSGAII is proposed for solving the MDNDP. As demonstrated, the proposed approach can produce nearoptimal Pareto solutions. Numerical experiments have been made on the NguyenDupuis test network. Tradeoffs among construction cost, the expectation, and standard deviation of TTT under uncertainty are observed obviously. Investment on transport network is an efficient method to improve the operational performance and reduce risk under demand uncertainty, but it has an obvious marginal decreasing effect. Practically, most of infrastructure investment decisions are made through political processes. But the model developed herein will be very useful to aid the decision process. Some possible directions for further work include the improvement of MDNDP and more efficient algorithms for large network in practical application.
Conflict of Interests
The author has no conflict of interests regarding this paper.
References
 H. Yang and M. G. H. Bell, “Models and algorithms for road network design: a review and some new developments,” Transport Reviews, vol. 18, no. 3, pp. 257–278, 1998. View at: Publisher Site  Google Scholar
 L. J. Leblanc, “An algorithm for the discrete network design problem,” Transportation Science, vol. 9, no. 3, pp. 183–199, 1975. View at: Publisher Site  Google Scholar
 M. Chen and A. S. Alfa, “A network design algorithm using a stochastic incremental traffic assignment approach,” Transportation Science, vol. 25, no. 3, pp. 215–224, 1991. View at: Publisher Site  Google Scholar
 Z. Y. Gao, J. J. Wu, and H. J. Sun, “Solution algorithm for the bilevel discrete network design problem,” Transportation Research Part B: Methodological, vol. 39, no. 6, pp. 479–495, 2005. View at: Publisher Site  Google Scholar
 H. Farvaresh and M. M. Sepehri, “A branch and bound algorithm for bilevel discrete network design problem,” Networks and Spatial Economics, vol. 13, no. 1, pp. 67–106, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 S. Wang, Q. Meng, and H. Yang, “Global optimization methods for the discrete network design problem,” Transportation Research Part B: Methodological, vol. 50, pp. 42–60, 2013. View at: Publisher Site  Google Scholar
 Y. Sun and M. A. Turnquist, “Investment in transportation network capacity under uncertainty simulated annealing approach,” Transportation Research Record, vol. 2039, pp. 67–74, 2007. View at: Publisher Site  Google Scholar
 S. V. Ukkusuri, T. V. Mathew, and S. T. Waller, “Robust transportation network design under demand uncertainty,” ComputerAided Civil and Infrastructure Engineering, vol. 22, no. 1, pp. 6–18, 2007. View at: Publisher Site  Google Scholar
 B. D. Chung, T. Yao, C. Xie, and A. Thorsen, “Robust optimization model for a dynamic network design problem under demand uncertainty,” Networks and Spatial Economics, vol. 11, no. 2, pp. 371–389, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 A. Chen, K. Subprasom, and Z. Ji, “Meanvariance model for the buildoperatetransfer scheme under demand uncertainty,” Transportation Research Record, no. 1857, pp. 93–101, 2003. View at: Google Scholar
 D.Y. Lin and C. Xie, “The Paretooptimal solution set of the equilibrium network design problem with multiple commensurate objectives,” Networks and Spatial Economics, vol. 11, no. 4, pp. 727–751, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 M. Yang, B. Su, Z. Sun, and Y. Xu, “Model and algorithm of multiobjective discrete transportation network design under stochastic demand among OD pairs,” Journal of Southwest Jiaotong University, vol. 49, no. 1, pp. 119–125, 2014. View at: Google Scholar
 J. H. Holland, Adapation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at: MathSciNet
 D. E. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning, AddisonWesley, Boston, Mass, USA, 1989.
 K. Deb, MultiObjective Optimization Using Evolutionary Algorithms, John Wiley & Sons, Chichester, UK, 2002.
 Y. Yin, “Geneticalgorithmsbased approach for bilevel programming models,” Journal of Transportation Engineering, vol. 126, no. 2, pp. 115–120, 2000. View at: Publisher Site  Google Scholar
 K. Jeon, J. S. Lee, S. Ukkusuri, and S. T. Waller, “Selectorecombinative genetic algorithm to relax computational complexity of discrete network design problem,” Transportation Research Record, no. 1964, pp. 91–103, 2006. View at: Google Scholar
 A. Chen, K. Subprasom, and Z. Ji, “A simulationbased multiobjective genetic algorithm (SMOGA) procedure for BOT network design problem,” Optimization and Engineering, vol. 7, no. 3, pp. 225–247, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGAII,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at: Publisher Site  Google Scholar
 Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice Hall, Englewood Cliffs, NJ, USA, 1985.
 S. Nguyen and C. Dupuis, “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs,” Transportation Science, vol. 18, no. 2, pp. 185–202, 1984. View at: Publisher Site  Google Scholar
 B. J. Kim, W. Kim, and B. H. Song, “Sequencing and scheduling highway network expansion using a discrete network design model,” Annals of Regional Science, vol. 42, no. 3, pp. 621–642, 2008. View at: Publisher Site  Google Scholar
 H. M. Markowitz, “Portfolio selection,” The Journal of Finance, vol. 7, no. 1, pp. 77–91, 1952. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2015 Bian Changzhi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.