# Genetic Algorithm for Multiuser Discrete Network Design Problem under Demand Uncertainty

Authors: Wu Juan; Lu Huapu; Yu Xinxin; Bian Changzhi
Journal: Mathematical Problems in Engineering
 (2012)

---

## Abstract

Discrete network design is an important part of urban transportation planning. The purpose of this paper is to present a bilevel model for discrete network design. The upper-level model aims to minimize the total travel time under a stochastic demand to design a discrete network. In the lower-level model, demands are assigned to the network through a multiuser traffic equilibrium assignment. Generally, discrete network could affect path selections of demands, while the results of the multiuser traffic equilibrium assignment need to reconstruct a new discrete network. An iterative approach including an improved genetic algorithm and Frank-Wolfe algorithm is used to solve the bi-level model. The numerical results on Nguyen Dupuis network show that the model and the related algorithms were effective for discrete network design.


---

## Body

## 1. Introduction

With the development of cities, travel demand is high and widely spread. The capacity of the current transport system remains limited to accommodate the increasing demand. It has emerged as an important area for progress in handling effective transport planning, in which some new links or roadway segments are added to expanding the current system capacity. The discrete network design problem (DNDP) deals with the selection of link additions to an existing road network, with a given demand from each origin to each destination. The objective of DNDP is often to optimize a given system performance measure such as to minimize total system travel cost, while accounting for the route choice behaviors of network users. Farvaresh and Sepehri [1] presented a single-level mixed integer linear formulation for discrete network design. Miandoabchi and Farahani [2] presented a discrete network design model, in which the concurrent design of street capacity, street direction, and lane allocations for two-way street are optimized based on the reserve capacity maximization. In traditional transportation network design, the travel demand is often assumed as a constant and users are assumed to belong to a single class. However, the assumptions are inappropriate to real-life applications.Different forms may be adopted for different aims in those literatures; but uncertainty in decision making and the diversity of the users are not considered. This paper seeks to make two contributions to the literature. Firstly, when the travel demand is uncertainty, uncertain optimization theory will be used. Secondly, when the users are diversity, they will be classified and treated, respectively. Therefore, a bi-level model was proposed for traffic network design. The upper-level model takes the travel time as the main consideration factor to optimize the network design model. Considering the fact that the travel demand changes along with the change of the network, the lower-level model assigns the users again in the network optimized by the upper-level model.The uncertain transportation network design model based on the stochastic programming theory assumes that travel demand is a stochastic variable submitting to a known probability distribution. At the same time, the optimal network plan will be obtained with stochastic bi-level programming model. Patriksson [3] considered demand uncertainty in stochastic bi-level programming model, in which the upper-level model is to minimize expected value of the objective function, and the lower-level model is the equilibrium conditions of variation inequality.Ukkusuri and Waller [4] provided the chance constrained programming model and two-phase compensation stochastic programming model for designing the transportation network with a single end and uncertain OD demand. When traffic flow meets the dynamic user equilibrium condition, cell transmission model (CTM) can be used, and the numerical calculation shows that the suboptimal solutions will be obtained without considering the uncertainty of demand. Karoonsoontawong and Waller [5] established a continuous transportation network design model under the demand uncertainty. Assume that every demand situation meets a dynamic user equilibrium to describe the traffic flow based on the CTM model of Daganzo [6]. The model minimizes the weighted average of the expected mean value and the expected risk to improve model robustness against demand uncertainty. Yang [7] analyzed the behavior of equilibrium flows with elastic demand which can be used to measure the demand and performance characteristics of the transportation networks. Li et al. [8] attempted to present road toll design model for congested road networks with uncertain demand. A heuristic algorithm based on the sample average approximation approach and a sensitivity analysis is used to solve the network design model.There are two types of methods dealing with multiuser problem in transportation network design problem. One method is to classify users according to traffic mode characteristics and vehicle types; then each category of users has different cost functions. Similar study has been done by Smith [9]; and so forth. Another method assumes that vehicle types of travelers are the same and have the same effect on traffic flow; but there are differences in time value. According to the different way of study, time value distribution can be assumed as discrete or continuous, corresponding to limited categories of users or infinite categories of users. Research about multiuser network equilibrium based on discrete time value has been done by Daganzo [6], Yang and Zhang [10]. Research about multiuser network equilibrium based on continuous time value has been done by Dial [11].In order to correct the inappropriate assumptions in traditional transportation network design, in this paper, the OD trip demand elements are supposed as stochastic variables submitting to given probability distribution. Travelers are divided into different groups by the value of time and a novel multiuser network design model is established. However, for network design, it is difficult to be solved through classical optimization techniques [12]. Recently many studies have proved that heuristic algorithms are suitable for large-scale transit network optimization problems, such as ant colony algorithm [13–15] and simulated annealing algorithm [16].Genetic algorithm (GA) is a search heuristic that based on the idea extracting from the process of natural evolution. Recently many studies have proved that genetic algorithm is suitable for solving network design problem. Pattnaik et al. [17] presented a GA-based optimization method to design transit network, in which the total cost of user and operator was to be minimized. Agrawal and Mathew [12] presented an optimization model for transit network. The model was aiming to minimize the total system cost which included the operating cost and the generalized travel cost. Bielli et al. [18] developed a heuristic based on GA to design transit network. In the heuristic, a multicriteria analysis was used to estimate the fitness values. Thus, in this paper, GA is also used to solve our discrete network design problem.This paper has been organized in the following way. Section2 describes the travelers time value and multiuser classification; Section 3 is about the optimization model, including the problem formulations and the basic notations of variables; Section 4 describes genetic algorithm and Frank-Wolfe algorithm for discrete network design problem. Numerical analysis is carried out in Section 5, and lastly, the conclusions are drawn in Section 6.


## 2. Analysis of the Fundamental Factors

### 2.1. Traveler Time Value

In economics, social activities can be abstracted into production and consumption behavior. The elements to describe different activities are often different, and time consumption is often used to measure the activity efficiency. Time as a resource, its value should be reasonable measured for better and efficient allocation. Time value represents time saving in terms of money. Under a given space-time environment, the factors that affect time value mainly include traveler characteristics, travel purpose, transportation modes, and other aspects.In different conditions, the influence degree of each factor is different. Evaluation of traveler time value is a comprehensive reflection of these factors. The following is the introduction of the main factors that affect traveler time value.(1) Traveler Characteristics
Different social and economic characteristics often affect traveler behavior. The income level is the greatest effect among their characteristics. High-income passengers pay more attention to quickness, comfort, safety, and service level than the travel fee while low-income passengers tend to use more time to save money.(2) Travel Purpose
Travel purpose is the motive of a trip. When travelers are confronted with different travel purposes, there are often different choices for them to select and different choices with different time and cost. For example, a trip for work has time constraint while a trip for shopping has more free time; so the time value for work is more than the time value for shopping. In some special circumstances, such as the traffic accidents or emergency which need medical assistance, time value is much higher than that of normal work trip.(3) Transportation Mode
Traveler time value is not only related to travel purpose, but also transportation mode. Different transportation modes have different speeds, convenience, and comfort, and those differences affect travelers to select different transportation modes. When travelers choose some transportation modes, they often consider those factors like travel time, travel cost, and the auxiliary or additional travel time. For example, car can provide prompt door to door service, so its time value is high. The bus needs more time not only aboard bus but also out of bus for waiting and walking; so its time value is low.(4) Other Factors
In addition to the influences of the above factors on traveler time value, travel distance, road traffic conditions, vehicles conditions, and the service level [19], to a certain degree, also have influences on the evaluation of travelers time value.


### 2.2. User Classification

There are two types of methods dealing with multiuser problem in transportation network. One method is to classify users according to transportation modes and vehicle types, in which each category of users has its cost function. In this paper, for the convenience of the study, all the traveler time values are also categorized into two kinds: discrete and continuous. In the same way, the users are considered as two kinds: limited categories of users and infinite categories. This paper assumes that the difference among transportation network users is the traveler time value, and the other characteristic is not considered.


## 2.1. Traveler Time Value

In economics, social activities can be abstracted into production and consumption behavior. The elements to describe different activities are often different, and time consumption is often used to measure the activity efficiency. Time as a resource, its value should be reasonable measured for better and efficient allocation. Time value represents time saving in terms of money. Under a given space-time environment, the factors that affect time value mainly include traveler characteristics, travel purpose, transportation modes, and other aspects.In different conditions, the influence degree of each factor is different. Evaluation of traveler time value is a comprehensive reflection of these factors. The following is the introduction of the main factors that affect traveler time value.(1) Traveler Characteristics
Different social and economic characteristics often affect traveler behavior. The income level is the greatest effect among their characteristics. High-income passengers pay more attention to quickness, comfort, safety, and service level than the travel fee while low-income passengers tend to use more time to save money.(2) Travel Purpose
Travel purpose is the motive of a trip. When travelers are confronted with different travel purposes, there are often different choices for them to select and different choices with different time and cost. For example, a trip for work has time constraint while a trip for shopping has more free time; so the time value for work is more than the time value for shopping. In some special circumstances, such as the traffic accidents or emergency which need medical assistance, time value is much higher than that of normal work trip.(3) Transportation Mode
Traveler time value is not only related to travel purpose, but also transportation mode. Different transportation modes have different speeds, convenience, and comfort, and those differences affect travelers to select different transportation modes. When travelers choose some transportation modes, they often consider those factors like travel time, travel cost, and the auxiliary or additional travel time. For example, car can provide prompt door to door service, so its time value is high. The bus needs more time not only aboard bus but also out of bus for waiting and walking; so its time value is low.(4) Other Factors
In addition to the influences of the above factors on traveler time value, travel distance, road traffic conditions, vehicles conditions, and the service level [19], to a certain degree, also have influences on the evaluation of travelers time value.


## 2.2. User Classification

There are two types of methods dealing with multiuser problem in transportation network. One method is to classify users according to transportation modes and vehicle types, in which each category of users has its cost function. In this paper, for the convenience of the study, all the traveler time values are also categorized into two kinds: discrete and continuous. In the same way, the users are considered as two kinds: limited categories of users and infinite categories. This paper assumes that the difference among transportation network users is the traveler time value, and the other characteristic is not considered.


## 3. Multiuser Discrete Network Design Model under OD Demand Uncertainty

### 3.1. Basic Notations

The following are the notations used in the model formulation.N:
Transportation network nodes setA:
Transportation network links setOr:
The trip generation flow from the terminalrDs:
The trip attraction flow from the terminalsPrs:
The routes set from the origin terminalr to the destination terminal sxa:
Traffic flow on linkata(x):
Travel time impedance function of linkafkrs:
Traffic flow on pathk between OD pair r and sckrs:
Traffic cost on pathk between OD pair r and sδa,krs:
Whena belongs to path k which is between OD pair r and s, δ=1; otherwise δ=0A-:
Set of new built or expanded linksya:
Decision variable of linka,ya∈{0,1}, when link will be new built or expanded, ya=1; otherwise, ya=0Ca:
Transport capacity of linkaLa:
Length of linkaGa(ya):
Cost of new built or expanded linkaB:
Budget of all the new built or expanded linksΩ:
All possible scenarios set of uncertain travel demandω:
Any realization of uncertain travel demandpω:
Realization probability of uncertain travel demand scenariowρ:
Mean and variance weight of travel time given by planning decision makers.


### 3.2. Multiuser Assumption

Each group of travelers has similar social and economic characteristics (such as income level). If travelers can be divided into discreteI groups according to time value, the time value of travelers i from the origin terminal r to the destination terminal s is set to grsi when i∈I. Thus, the user cost includes two parts. One is the cost of travel time value which is related to route flow; the other is the toll fee τa, which is a constant. The sum of the cost from two parts is changed as the variation of the travel time value. Formula (3.1) is the generalized cost of the use of link a by i group users. Formula (3.2) is the time cost on path k between OD pair r and s. Formula (3.3) is the expenses cost on path k between OD pair r ands. Formula (3.4) generalized the cost of the use of path k between OD pair r and s by i group users:
(3.1)gai(xa)=ta(xa)+1ψiτa,∀a∈A,i∈I,(3.2)ckrs=∑ta(xa)δa,krs,∀r∈R,s∈S,k∈K,(3.3)τkrs=∑τaδa,krs,∀r∈R,s∈S,k∈K,(3.4)gk,irs=ckrs+1ψiτkrs,∀r∈R,s∈S,k∈Prs,i∈I.


### 3.3. Multiuser Network Optimization Model under OD Demand Uncertainty

OD trip demand of each group travelers 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 w. OD trip demand is qrsi,ω, where i is the set of groups of travelers. Scenario realization probability is pω. Multiuser discrete network design model under OD trip demand uncertainty includes upper-level model (3.5) and lower-level model (3.6), which are correlated by network improved decision variable y and traffic flow x.The upper-level model (3.5) is to minimize the system total travel time mean and standard deviation with the random demand in all scenarios realization condition, when planners choose new built and rebuilt links under the capital budget constraints. The lower-level model (3.6) is the corresponding multiuser equilibrium of each demand scenario under the improved decisions conditions decided by the upper-level model. On has(3.5)minZ(x,y)=ρ∑ωpω[∑axaωtaω(xaω,ya)]+(1-ρ)×[∑ωpω{∑axaωtaω(xaω,ya)-∑ωpω[∑axaωtaω(xaω,ya)]}2]1/2,(3.5a)s.t.∑a∈A-Ga(ya)≤B,(3.5b)ya∈{0,1},∀a∈A-,where x=x(y) is implicit function of y, decided by lower-level model (3.6). On has(3.6)minT(x)=∑a∫0xaωtaω(w)dw+∑a∑i∈I1ψixai,ωτa(3.6a)s.t.∑k∈Prsfk,irs,ω=qrsi,ω,∀r∈R,s∈S,∀i∈I,ω∈Ω(3.6b)fk,irs,ω≥0,∀r∈R,s∈S,k∈Prs,i∈I,ω∈Ω(3.6c)xai,ω=∑r∈R∑s∈S∑k∈Prsfk,irs,ωδakrs,ω,∀a,i∈I,ω∈Ω(3.6d)xaω=∑i∈Ixai,ω,∀a,ω∈Ω.Here, travel time of link a is described as BPR function.The right balance between the mean and standard deviation is kept by weight factorρ(ρ∈[0,1]), where ρ shows the prediction of the planners for the average performance of uncertainty and the discrete degree of depart from the average performance. The bigger ρ value is, the less the planners would like to select.In this paper, the multiuser discrete network design problem under demand uncertainty can be shown in Figure1.Figure 1
The optimized process of discrete network design problem.


## 3.1. Basic Notations

The following are the notations used in the model formulation.N:
Transportation network nodes setA:
Transportation network links setOr:
The trip generation flow from the terminalrDs:
The trip attraction flow from the terminalsPrs:
The routes set from the origin terminalr to the destination terminal sxa:
Traffic flow on linkata(x):
Travel time impedance function of linkafkrs:
Traffic flow on pathk between OD pair r and sckrs:
Traffic cost on pathk between OD pair r and sδa,krs:
Whena belongs to path k which is between OD pair r and s, δ=1; otherwise δ=0A-:
Set of new built or expanded linksya:
Decision variable of linka,ya∈{0,1}, when link will be new built or expanded, ya=1; otherwise, ya=0Ca:
Transport capacity of linkaLa:
Length of linkaGa(ya):
Cost of new built or expanded linkaB:
Budget of all the new built or expanded linksΩ:
All possible scenarios set of uncertain travel demandω:
Any realization of uncertain travel demandpω:
Realization probability of uncertain travel demand scenariowρ:
Mean and variance weight of travel time given by planning decision makers.


## 3.2. Multiuser Assumption

Each group of travelers has similar social and economic characteristics (such as income level). If travelers can be divided into discreteI groups according to time value, the time value of travelers i from the origin terminal r to the destination terminal s is set to grsi when i∈I. Thus, the user cost includes two parts. One is the cost of travel time value which is related to route flow; the other is the toll fee τa, which is a constant. The sum of the cost from two parts is changed as the variation of the travel time value. Formula (3.1) is the generalized cost of the use of link a by i group users. Formula (3.2) is the time cost on path k between OD pair r and s. Formula (3.3) is the expenses cost on path k between OD pair r ands. Formula (3.4) generalized the cost of the use of path k between OD pair r and s by i group users:
(3.1)gai(xa)=ta(xa)+1ψiτa,∀a∈A,i∈I,(3.2)ckrs=∑ta(xa)δa,krs,∀r∈R,s∈S,k∈K,(3.3)τkrs=∑τaδa,krs,∀r∈R,s∈S,k∈K,(3.4)gk,irs=ckrs+1ψiτkrs,∀r∈R,s∈S,k∈Prs,i∈I.


## 3.3. Multiuser Network Optimization Model under OD Demand Uncertainty

OD trip demand of each group travelers 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 w. OD trip demand is qrsi,ω, where i is the set of groups of travelers. Scenario realization probability is pω. Multiuser discrete network design model under OD trip demand uncertainty includes upper-level model (3.5) and lower-level model (3.6), which are correlated by network improved decision variable y and traffic flow x.The upper-level model (3.5) is to minimize the system total travel time mean and standard deviation with the random demand in all scenarios realization condition, when planners choose new built and rebuilt links under the capital budget constraints. The lower-level model (3.6) is the corresponding multiuser equilibrium of each demand scenario under the improved decisions conditions decided by the upper-level model. On has(3.5)minZ(x,y)=ρ∑ωpω[∑axaωtaω(xaω,ya)]+(1-ρ)×[∑ωpω{∑axaωtaω(xaω,ya)-∑ωpω[∑axaωtaω(xaω,ya)]}2]1/2,(3.5a)s.t.∑a∈A-Ga(ya)≤B,(3.5b)ya∈{0,1},∀a∈A-,where x=x(y) is implicit function of y, decided by lower-level model (3.6). On has(3.6)minT(x)=∑a∫0xaωtaω(w)dw+∑a∑i∈I1ψixai,ωτa(3.6a)s.t.∑k∈Prsfk,irs,ω=qrsi,ω,∀r∈R,s∈S,∀i∈I,ω∈Ω(3.6b)fk,irs,ω≥0,∀r∈R,s∈S,k∈Prs,i∈I,ω∈Ω(3.6c)xai,ω=∑r∈R∑s∈S∑k∈Prsfk,irs,ωδakrs,ω,∀a,i∈I,ω∈Ω(3.6d)xaω=∑i∈Ixai,ω,∀a,ω∈Ω.Here, travel time of link a is described as BPR function.The right balance between the mean and standard deviation is kept by weight factorρ(ρ∈[0,1]), where ρ shows the prediction of the planners for the average performance of uncertainty and the discrete degree of depart from the average performance. The bigger ρ value is, the less the planners would like to select.In this paper, the multiuser discrete network design problem under demand uncertainty can be shown in Figure1.Figure 1
The optimized process of discrete network design problem.


## 4. Solution Approach

### 4.1. Multiuser Traffic Equilibrium Assignment

Using Frank-Wolfe method to solve multiuser equilibrium model consists of the following steps.Step 1.
Initialization: according to{ta0=ta(0)} and {τa}, 0-1 traffic assignment based on generalized cost is conducted to each group of users demand {qrsi} when n=1.Step 2.
Updating travel time on each link: determining generalized costgain(xan) of each group of users on each link when tan=ta(xan), for all a.Step 3.
Searching for iterative direction: conduct 0-1 traffic assignment according to generalized cost{gain(xan)} to each group of users and get a set of additional traffic flow {yain}.Step 4.
Searching for iteration step lengthλn based on min0≤λn≤1T(xin+λn(yin-xin)): to seek λn until it meets min0≤λn≤1T(xin+λn(yin-xin)).Step 5.
Updating road traffic flow on each link:(4.1)xai(n+1)=xain+λn(yain-xain),∀a,i;xan+1=xan+λn(yan-xan),∀a.Step 6.
Convergence test: if{xan+1} already meets specified convergence criteria, calculation stops and {xan+1} are the balance solutions. Otherwise update n=n+1, return to Step 2.


### 4.2. GA for Multiuser Discrete Transportation Network Design

GA is inspired by evolutionary biology like inheritance, selection, crossover, and mutation. Based on a fitness function, GA attempts to retain relatively good genetic information from generation to generation. GA has been used for solving approximately combinatorial optimization problems [20]. In this paper, GA is adopted to solve multiuser discrete transportation network design model under demand uncertainty. The following is the steps of GA.(1) Encoding
For a discrete network design, the added links or expanded links are to assign to the current network. Thus, an integer-coded scheme is selected to represent the alternative links in this paper, and a chromosome example is as shown in Figure2, where “0” represents the corresponding link remaining the current situation while “1” represents the links need to add new links or be expanded. For example, the chromosome is 1100110000 which represents that route no. 1, 2, 5, and 6 needs to add new links or be expanded. The other routes remain the current situation.Figure 2(2) Fitness Function
Generally, GA is optimal searching method to find the maximum fitness of the individual chromosome. Therefore, a constantQ is introduced to transform our objective function to a maximum fitness function and the chromosomes are evaluated as follows:
(4.2)M(f)=QZ,
where M(f) is the fitness function and Q is a constant.(3) Selection
The basic part of the selection process is to stochastically select from one generation to create the basis of the next generation. The requirement is that the fittest individuals have a greater chance of survival than weaker ones. That is, the better the chromosomes are, the more chances to be selected they have. Therefore, the Roulette wheel selection method is used for the selection of chromosomes in this paper. In addition, to increase the performance of GA, elitism is used for selection. That is, if the elitism parameter was set toR; then the top R chromosomes in the population are copied to the next generation.(4) Crossover
Crossover is a genetic operator that exchanges genetic information between two parents’ chromosomes to produce two new children chromosomes. The crossover operator occurs during evolution according to a given crossover ratepc. In this paper, in crossover operation, the two links are selected, based on a simple arithmetic crossover [20], from the parent chromosomes and exchange the two links, and then generate two new children chromosomes:
(4.3)genk,It=αigenk,It-1+(1-αk)genk,IIt-1,genk,IIt=αigenk,IIt-1+(1-αk)genk,It-1,
where genk,It-1,genk,IIt-1 is a pair of “parent” chromosomes; genk,It,genk,IIt is a pair of “children” chromosomes; αk is a random number between (0,1); k∈[1,2,3] (kis the total genes for the crossover operation).(5) Mutation
Like the crossover, the mutation operator is also associated with a mutation rate (Pm) to determine whether or not the mutation operator is to be applied to the chromosome. An arithmetic mutation like the crossover is designed, and then a new offspring chromosome is acquired by mutation operator.Assume a chromosome isG=(gen1t,…,genkt,…,genmt), if the gen2t was selected for the mutation, the mutation can be shown in (4.4):(4.4)G′=(gen1t-1,…,genkt,…,genmt-1),genkt={genkt-1+Δ(t,genkmaxt-genkt-1),ifrandom(0,1)=0,genkt-1+Δ(t,genkt-1-genkmint),ifrandom(0,1)=1.The functionΔ(t,y) returns a value between [0,y] given in (4.5).(4.5)Δ(t,y)=y×(1-r(1-t/Tmax)λ),
where r is a random number between [0,1]; Tmax is the maximum number of generations; here λ=3. This property causes this operation to make a uniform search in the initial space when t is small and a very local one in later stages.


## 4.1. Multiuser Traffic Equilibrium Assignment

Using Frank-Wolfe method to solve multiuser equilibrium model consists of the following steps.Step 1.
Initialization: according to{ta0=ta(0)} and {τa}, 0-1 traffic assignment based on generalized cost is conducted to each group of users demand {qrsi} when n=1.Step 2.
Updating travel time on each link: determining generalized costgain(xan) of each group of users on each link when tan=ta(xan), for all a.Step 3.
Searching for iterative direction: conduct 0-1 traffic assignment according to generalized cost{gain(xan)} to each group of users and get a set of additional traffic flow {yain}.Step 4.
Searching for iteration step lengthλn based on min0≤λn≤1T(xin+λn(yin-xin)): to seek λn until it meets min0≤λn≤1T(xin+λn(yin-xin)).Step 5.
Updating road traffic flow on each link:(4.1)xai(n+1)=xain+λn(yain-xain),∀a,i;xan+1=xan+λn(yan-xan),∀a.Step 6.
Convergence test: if{xan+1} already meets specified convergence criteria, calculation stops and {xan+1} are the balance solutions. Otherwise update n=n+1, return to Step 2.


## 4.2. GA for Multiuser Discrete Transportation Network Design

GA is inspired by evolutionary biology like inheritance, selection, crossover, and mutation. Based on a fitness function, GA attempts to retain relatively good genetic information from generation to generation. GA has been used for solving approximately combinatorial optimization problems [20]. In this paper, GA is adopted to solve multiuser discrete transportation network design model under demand uncertainty. The following is the steps of GA.(1) Encoding
For a discrete network design, the added links or expanded links are to assign to the current network. Thus, an integer-coded scheme is selected to represent the alternative links in this paper, and a chromosome example is as shown in Figure2, where “0” represents the corresponding link remaining the current situation while “1” represents the links need to add new links or be expanded. For example, the chromosome is 1100110000 which represents that route no. 1, 2, 5, and 6 needs to add new links or be expanded. The other routes remain the current situation.Figure 2(2) Fitness Function
Generally, GA is optimal searching method to find the maximum fitness of the individual chromosome. Therefore, a constantQ is introduced to transform our objective function to a maximum fitness function and the chromosomes are evaluated as follows:
(4.2)M(f)=QZ,
where M(f) is the fitness function and Q is a constant.(3) Selection
The basic part of the selection process is to stochastically select from one generation to create the basis of the next generation. The requirement is that the fittest individuals have a greater chance of survival than weaker ones. That is, the better the chromosomes are, the more chances to be selected they have. Therefore, the Roulette wheel selection method is used for the selection of chromosomes in this paper. In addition, to increase the performance of GA, elitism is used for selection. That is, if the elitism parameter was set toR; then the top R chromosomes in the population are copied to the next generation.(4) Crossover
Crossover is a genetic operator that exchanges genetic information between two parents’ chromosomes to produce two new children chromosomes. The crossover operator occurs during evolution according to a given crossover ratepc. In this paper, in crossover operation, the two links are selected, based on a simple arithmetic crossover [20], from the parent chromosomes and exchange the two links, and then generate two new children chromosomes:
(4.3)genk,It=αigenk,It-1+(1-αk)genk,IIt-1,genk,IIt=αigenk,IIt-1+(1-αk)genk,It-1,
where genk,It-1,genk,IIt-1 is a pair of “parent” chromosomes; genk,It,genk,IIt is a pair of “children” chromosomes; αk is a random number between (0,1); k∈[1,2,3] (kis the total genes for the crossover operation).(5) Mutation
Like the crossover, the mutation operator is also associated with a mutation rate (Pm) to determine whether or not the mutation operator is to be applied to the chromosome. An arithmetic mutation like the crossover is designed, and then a new offspring chromosome is acquired by mutation operator.Assume a chromosome isG=(gen1t,…,genkt,…,genmt), if the gen2t was selected for the mutation, the mutation can be shown in (4.4):(4.4)G′=(gen1t-1,…,genkt,…,genmt-1),genkt={genkt-1+Δ(t,genkmaxt-genkt-1),ifrandom(0,1)=0,genkt-1+Δ(t,genkt-1-genkmint),ifrandom(0,1)=1.The functionΔ(t,y) returns a value between [0,y] given in (4.5).(4.5)Δ(t,y)=y×(1-r(1-t/Tmax)λ),
where r is a random number between [0,1]; Tmax is the maximum number of generations; here λ=3. This property causes this operation to make a uniform search in the initial space when t is small and a very local one in later stages.


## 5. Case Studies

### 5.1. Network Structure

In this paper, the test network of Nguyen and Dupuis [21] is used as a case study. This network has 13 nodes, 19 links, and 4 OD pairs. The basic structures of this network is shown in Figure 3, in which a red nodeis the symbol for a travel demand generation point, a blue node is the symbol for a travel demand attract point, a solid line is the symbol for a existing road, and a dotted line is the symbol for a road to be built. Table 1 shows the basic information of the network, including free flow time, traffic capacity under the present situation, traffic capacity under planning situation, construction cost, and so forth. Table 2 is OD trip demand information, including deterministic demand and truncated normal distribution travel demand.Table 1
The attribute of the Nguyen Dupuis network.
Link
Free flow time
Existing capacity
Planning capacity
Construction cost
1
12
250
500
100
2
12
250
500
100
3
12
250
500
100
4
24
150
250
100
5
12
250
500
100
6
12
250
500
100
7
12
250
500
100
8
12
250
500
100
9
12
250
500
100
10
12
250
500
100
11
12
250
500
100
12
12
250
500
100
13
24
150
250
100
14
12
250
500
100
15
12
250
500
100
16
12
250
500
100
17
12
250
500
100
18
36
150
250
100
19
12
250
500
100
20
24
0
250
100
21
24
0
250
100
22
24
0
250
100
23
24
0
250
100
24
12
0
500
100
25
24
0
250
100Table 2
The data of OD.
Category
Number
Trip generation and attraction
Truncation normal distribution of trip generation and attraction
Trip generation site
1
O
1
¯
TN
(
O
1
¯
,
μ
O
1
¯
)
4
O
4
¯
TN
(
O
4
¯
,
μ
O
4
¯
)
Trip attraction site
2
D
2
¯
TN
(
D
2
¯
,
μ
D
2
¯
)
3
D
3
¯
TN
(
D
3
¯
,
μ
D
3
¯
)Figure 3
The networks of Nguyen Dupuis.


### 5.2. Calculation Results

This network is assumed to have three types of users, and the OD trip demand of each type of users submits to truncation normal distribution; time value is set to 0.5, 1, and 2, respectively. There are 25 routes for new links and expanding links. So the parameters in genetic algorithm are set as the following. That is population size as 40, evolutional generation range as 100, chromosome length as 25, crossover probability as 0.8, and mutation probability as 0.01 (Table3).Table 3
The parameters of the scenario.
Scenario
User demand
Mutation coefficientμ
Budget level
Risk coefficientρ
Sample size
I
100/150/100
0
1000
1
1
II
50/250/50
0
1000
1
1
III
250/50/50
0
1000
1
1
IV
50/50/250
0
1000
1
1
V
100/150/100
0.2
1000
1
50
VI
100/150/100
0.5
1000
1
50
VII
100/150/100
0.2
1000
0.5
50
VIII
350
0
1000
1
1The evolution process under deterministic OD trip demand is shown in Figures4, 5, 6, and 7. The evolution process under uncertain OD trip demand is shown Figures 8, 9, and 10. The evolution process with only one type of users is shown in Figure 11.Figure 4
The solution of scenario I.Figure 5
The solution of scenario II.Figure 6
The solution of scenario III.Figure 7
The solution of scenario IV.Figure 8
The solution of scenario V.Figure 9
The solution of scenario VI.Figure 10
The solution of scenario VII.Figure 11
The solution of scenario VIII.Table4 shows the calculation results of multiuser discrete transportation network under OD trip demand uncertainty, from which we can obtain the following conclusion.(1)
Scenario I and scenario VIII have the same total demand of all OD pairs, while scenario VIII has only one type of users and scenario I has three types of users. Results show that network planning scheme based on multiuser equilibrium model is different from that of single user model, and the total travel time of the system based on multiuser equilibrium model is higher.(2)
Contrasting from scenario I to scenario IV, OD trips of each type of users are different. The calculation results show that the OD trips proportion of different users to the total amount of the network has a significant impact on the planning scheme. In the transportation planning practice, the trip amount of different users should be determined according to social and economic characteristics of the region’s inhabitants to provide a more powerful support for transportation network planning decision.(3)
Scenario V and scenario VI show the network planning results under the target function of system expected total travel time under OD trip uncertainty. It shows that the greater the OD demand uncertainty degree is, the greater the mean of the system total travel time is.(4)
Scenario V and scenario VII have the same degree of OD trip uncertainty. Risk preference of decision makers influences the final network planning scheme.Table 4
The solution of the sample.
Scenario
The fitter chromosome
Newly built roads
Extension roads
Fitness value
I
0111010101100000101010000
21, 22, 23, 25
2, 4, 5, 11, 13, 15
1.05 * 105
II
1001010101000001101010001
20, 23, 25
2, 4, 10, 11, 13, 15, 19
1.07 * 105
III
1101010111000000100100010
20, 21, 23, 25
2, 3, 4, 11, 14, 18
1.05 * 105
IV
0011011101000000011010100
22, 23, 25
1, 2, 4, 12, 13, 15, 17
1.11 * 105
V
1100000011000100001100111
20, 21
3, 4, 8, 13, 14, 17, 18, 19
1.14 * 105
VI
0001010101010001101100010
23, 25
2, 4, 6, 10, 11, 13, 14, 18
1.39 * 105
VII
1011010101010000001010001
20, 22, 23, 25
2, 4, 6, 13, 15, 19
6.91 * 104
VIII
1111000111000000001110000
20, 2122, 23
2, 3, 413, 14, 15
9.15 * 104


## 5.1. Network Structure

In this paper, the test network of Nguyen and Dupuis [21] is used as a case study. This network has 13 nodes, 19 links, and 4 OD pairs. The basic structures of this network is shown in Figure 3, in which a red nodeis the symbol for a travel demand generation point, a blue node is the symbol for a travel demand attract point, a solid line is the symbol for a existing road, and a dotted line is the symbol for a road to be built. Table 1 shows the basic information of the network, including free flow time, traffic capacity under the present situation, traffic capacity under planning situation, construction cost, and so forth. Table 2 is OD trip demand information, including deterministic demand and truncated normal distribution travel demand.Table 1
The attribute of the Nguyen Dupuis network.
Link
Free flow time
Existing capacity
Planning capacity
Construction cost
1
12
250
500
100
2
12
250
500
100
3
12
250
500
100
4
24
150
250
100
5
12
250
500
100
6
12
250
500
100
7
12
250
500
100
8
12
250
500
100
9
12
250
500
100
10
12
250
500
100
11
12
250
500
100
12
12
250
500
100
13
24
150
250
100
14
12
250
500
100
15
12
250
500
100
16
12
250
500
100
17
12
250
500
100
18
36
150
250
100
19
12
250
500
100
20
24
0
250
100
21
24
0
250
100
22
24
0
250
100
23
24
0
250
100
24
12
0
500
100
25
24
0
250
100Table 2
The data of OD.
Category
Number
Trip generation and attraction
Truncation normal distribution of trip generation and attraction
Trip generation site
1
O
1
¯
TN
(
O
1
¯
,
μ
O
1
¯
)
4
O
4
¯
TN
(
O
4
¯
,
μ
O
4
¯
)
Trip attraction site
2
D
2
¯
TN
(
D
2
¯
,
μ
D
2
¯
)
3
D
3
¯
TN
(
D
3
¯
,
μ
D
3
¯
)Figure 3
The networks of Nguyen Dupuis.


## 5.2. Calculation Results

This network is assumed to have three types of users, and the OD trip demand of each type of users submits to truncation normal distribution; time value is set to 0.5, 1, and 2, respectively. There are 25 routes for new links and expanding links. So the parameters in genetic algorithm are set as the following. That is population size as 40, evolutional generation range as 100, chromosome length as 25, crossover probability as 0.8, and mutation probability as 0.01 (Table3).Table 3
The parameters of the scenario.
Scenario
User demand
Mutation coefficientμ
Budget level
Risk coefficientρ
Sample size
I
100/150/100
0
1000
1
1
II
50/250/50
0
1000
1
1
III
250/50/50
0
1000
1
1
IV
50/50/250
0
1000
1
1
V
100/150/100
0.2
1000
1
50
VI
100/150/100
0.5
1000
1
50
VII
100/150/100
0.2
1000
0.5
50
VIII
350
0
1000
1
1The evolution process under deterministic OD trip demand is shown in Figures4, 5, 6, and 7. The evolution process under uncertain OD trip demand is shown Figures 8, 9, and 10. The evolution process with only one type of users is shown in Figure 11.Figure 4
The solution of scenario I.Figure 5
The solution of scenario II.Figure 6
The solution of scenario III.Figure 7
The solution of scenario IV.Figure 8
The solution of scenario V.Figure 9
The solution of scenario VI.Figure 10
The solution of scenario VII.Figure 11
The solution of scenario VIII.Table4 shows the calculation results of multiuser discrete transportation network under OD trip demand uncertainty, from which we can obtain the following conclusion.(1)
Scenario I and scenario VIII have the same total demand of all OD pairs, while scenario VIII has only one type of users and scenario I has three types of users. Results show that network planning scheme based on multiuser equilibrium model is different from that of single user model, and the total travel time of the system based on multiuser equilibrium model is higher.(2)
Contrasting from scenario I to scenario IV, OD trips of each type of users are different. The calculation results show that the OD trips proportion of different users to the total amount of the network has a significant impact on the planning scheme. In the transportation planning practice, the trip amount of different users should be determined according to social and economic characteristics of the region’s inhabitants to provide a more powerful support for transportation network planning decision.(3)
Scenario V and scenario VI show the network planning results under the target function of system expected total travel time under OD trip uncertainty. It shows that the greater the OD demand uncertainty degree is, the greater the mean of the system total travel time is.(4)
Scenario V and scenario VII have the same degree of OD trip uncertainty. Risk preference of decision makers influences the final network planning scheme.Table 4
The solution of the sample.
Scenario
The fitter chromosome
Newly built roads
Extension roads
Fitness value
I
0111010101100000101010000
21, 22, 23, 25
2, 4, 5, 11, 13, 15
1.05 * 105
II
1001010101000001101010001
20, 23, 25
2, 4, 10, 11, 13, 15, 19
1.07 * 105
III
1101010111000000100100010
20, 21, 23, 25
2, 3, 4, 11, 14, 18
1.05 * 105
IV
0011011101000000011010100
22, 23, 25
1, 2, 4, 12, 13, 15, 17
1.11 * 105
V
1100000011000100001100111
20, 21
3, 4, 8, 13, 14, 17, 18, 19
1.14 * 105
VI
0001010101010001101100010
23, 25
2, 4, 6, 10, 11, 13, 14, 18
1.39 * 105
VII
1011010101010000001010001
20, 22, 23, 25
2, 4, 6, 13, 15, 19
6.91 * 104
VIII
1111000111000000001110000
20, 2122, 23
2, 3, 413, 14, 15
9.15 * 104


## 6. Conclusions

In this paper, a discrete transportation network design problem is investigated, in which the trip generation flow and trip attraction flow are supposed as stochastic variables submitting to the given probability distribution. When travelers are divided into different groups by travel time value, a novel multiuser discrete network design model based on demand uncertainty is established. Genetic algorithm and Monte-Carlo simulation algorithm are integrated to solve the bi-level model for discrete network design. Calculation results on Nguyen Dupuis network show that user heterogeneity has a significant impact on network planning outcome under uncertain conditions. Furthermore, it can be found that GA is a potential tool for multiuser discrete transportation network design problem.



---

*Source: 686272-2012-12-09.xml*