Next Article in Journal
The Energy Transition and Energy Equity: A Compatible Combination?
Next Article in Special Issue
Reversible Lane Optimization of the Urban Road Network Considering Adjustment Time Constraints
Previous Article in Journal
Circular Economy: Illusion or First Step towards a Sustainable Economy: A Physico-Economic Perspective
Previous Article in Special Issue
UAV-Based Bridge Inspection via Transfer Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Temporary Reversible Lane Design Based on Bi-Level Programming Model during the Winter Olympic Games

1
Beijing Laboratory of General Aviation Technology, Beijing University of Civil Engineering and Architecture, Beijing 100044, China
2
Beijing General Municipal Engineering Design & Research Institute Co., Ltd., Beijing 100082, China
*
Author to whom correspondence should be addressed.
Sustainability 2022, 14(8), 4780; https://doi.org/10.3390/su14084780
Submission received: 3 March 2022 / Revised: 12 April 2022 / Accepted: 14 April 2022 / Published: 15 April 2022

Abstract

:
When the Winter Olympic Games were held, several roads were divided into exclusive lanes for the Winter Olympics to ensure the smooth passage of Winter Olympic vehicles. This reduced the number of lanes available for private vehicles, which caused a temporary tidal traffic phenomenon that led to traffic congestion and increased exhaust emissions. Temporary reversible lanes were added to the object lane to alleviate the temporary tide traffic phenomenon. A bi-level programming model was developed based on the principle of the minimum construction cost and the minimum total travel time of the road network. Meanwhile, three heuristics algorithms were used to solve the problem. The results show that the reasonable addition of temporary reversible lanes during the Olympic Games can reduce the total system travel cost, solve the temporary tidal traffic phenomenon, and alleviate traffic congestion.

1. Introduction

To ensure the health of all Winter Olympic Games personnel and civil organizers during the Winter Olympic Games in the face of COVID-19, Beijing traffic management departments established Olympic-exclusive lanes on several road sections. Meanwhile, they implemented a whole closed cycle and point-to-point, closed-loop management process for all Winter Olympic personnel. Beijing used signs and markings to alert private vehicles that they could not drive in the Olympic exclusive lane during specified times. Some soft isolation measures were implemented for the closed-loop traffic flow to ensure the smooth running of Winter Olympic vehicles.
When certain lanes were reserved exclusively for the Olympics, the number of lanes for private cars decreased, leading to traffic jams and tensions related to road resources. Consequently, a temporary one-way congestion was caused, namely a temporary tidal traffic phenomenon in one direction. The phenomenon of tidal traffic can cause a huge waste of traffic resources. It increased the risk of congestion and caused inconveniences and problems for travelers. Having cars driving at slow speeds for a long time produces a high level of exhaust fumes, which pollutes the environment. Moreover, it is important to leave a good impression of the traffic in Beijing on international spectators.
Setting reversible lanes is an effective way of solving the tidal traffic phenomenon [1]. Through a practical investigation over five months in the United States, it was found that the installation of tidal reversible lanes at peak hours made it possible to significantly reduce traffic congestion [2]. Reversible lanes can significantly increase road capacity, while creating road safety challenges [3,4]. The installation of reversible lanes can significantly reduce travel time [5]. Therefore, setting reversible lanes was an effective way to solve the problem of unbalanced urban traffic flow on road sections during the Olympic Games, which could quickly dissipate the traffic congestion in the direction of the main traffic flow by borrowing the capacity of the reverse section to reduce traffic congestion.
To handle the temporary tidal traffic phenomenon, temporary reversible lanes were established to utilize road resources and meet traveler’s demands. Most of the time, no vehicle was seen on the Olympic exclusive lanes. Reversible lanes ensured the safe journey of Olympic personnel. They also alleviated the traffic volume on the side of high pressure during peak hours. To decrease the effect of reversible lanes on other roads [6], measures were put in place to install variable lanes, looking at the entire traffic network system based on the overall traffic network conditions.

2. Literature Review

Large-scale studies of tidal lane characteristics began in the 1960s. To form the specifications of reversible lane settings in documents such as the American Highway and Roadway Design Manual (AASHTO) [7,8], Wolshon et al. [2,9] investigated the application of variable lane settings in the US and conducted an exhaustive study of variable lane settings in the National Highway Research Program (NCHRP) [10]. Waleczek et al. [11] put the reversible lane system into practice to confirm the practicality and safety of the system. Aaron [12] summarized the implementation criteria of the tidal reversible lane scheme after analyzing many theories related to its installation. Asaithambi [13] discussed various methods of traffic control for reversible lanes using signs and signals, barriers, etc. Ampountolas [14] provided a Pareto-optimal solution based on kinematic wave theory applied to the operation of a simulation of Aston expressway.
There is a relatively large body of literature that is concerned with contraflow in the case of evacuation and construction areas. Tudydes [15] developed a tabu search heuristic to solve the problem of setting reversible lanes in response to a temporary occurrence of a disaster. It can be found that the installation of reversible lanes is a feasible strategy that can reduce traffic congestion and allow for a satisfactory evacuation time. Pyakurel has conducted several studies in response to rapidly occurring natural disasters and limited road capacity. In 2015, he developed static mathematical models and solution algorithms for the lexicographically maximum dynamic contraflow and earliest arrival contraflow problems [16]. Then, mathematical models and solution algorithms were designed for dynamic reverse traffic flow [17]. Afterwards, a continuous flow algorithm was proposed, which shows that the design of the reverse lane can increase the traffic flow [18]. Time-varying parameters were introduced to the dynamic contraflow model to calculate its minimum cost and optimize its optimal algorithm [19]. The results show that the use of contraflow can minimize congestion and allows for smooth traffic flow during evacuation. The use of reversible lanes in construction zones can reduce travel time loss and simultaneously reduce the accident rate on the highway [11].
Reversible lanes have been set up as tidal lanes for a long time to alleviate the tidal traffic phenomenon in fixed areas. They can also be used in emergency accident evacuations. The reversible lanes in the Olympic period are expected to exist for 1–2 months. Therefore, the setting conditions are slightly different from those for tidal lanes and evacuations.
Most research on reversible lane settings has been carried out using bi-level programming models. Meng et al. [20] developed a bi-level programming model with the lowest total cost of travel in the upper layer and a reset of travel paths after reversible lane transformation in the lower layer, while a genetic algorithm was used for the design. Additionally, using the feasibility of the model and algorithm were verified in the Singapore traffic network. Wang et al. [21] researched the reversible lane setting in emergency evacuation situations. They proposed a bi-level programming model for reversible lane setting and verified the validity of the model with three arithmetic examples with distinctive features. Zhen et al. [22] proposed a nonlinear bi-level programming model seeking to maximize the coupling degree of the network structure and the demand junction to find the optimal lane combination strategy in the traffic network. Lu et al. [23], in order to research the dynamic reversible lane assignment method at an intersection, developed a bi-level programming model with the maximum queue length at intersections as the upper-level objective function and the lower-layer function for traffic assignment using a logit stochastic user equilibrium model.
Several scholars have also studied reversible lanes using alternative mathematical models or simulation methods under different setup conditions. Punith [24] developed a microsimulation model to evaluate the operation of reversible lanes and investigate the impact of reversible lanes on road capacity. Wei et al. [25] developed a reversible lane selection model based on BPR function and environmental benefits, using the number of reversible lanes as the decision variable and considering the delay and algorithm needed to minimize energy and emission costs. Pyakurel et al. [26] proposed a new partial lane reversal strategy that can help to achieve the shortest transport time in an evacuation situation. José [27] proposed a macroscopic model and two control algorithms for the setting and control of reversible lanes for highway traffic flow operation states. Wei et al. [28] calibrated some parameters of reverse traffic flow with the help of the VISSIM platform to further evaluate the impact of reverse lanes on an evacuation situation.
Scholars have mostly used heuristic algorithms to solve the bi-level programming model, due to its complexity. Zhang et al. [29] used a multi-objective hierarchical genetic algorithm to solve a bi-level programming model to solve the job shop’s scheduling and layout problems. Ma et al. [30] proposed an algorithm combining a hybrid particle swarm algorithm and a differential evolutionary algorithm to deal with bi-level programming problems. Sun et al. [31] used a genetic algorithm to find the signal control variables in a bi-level programming model. Bin et al. [32] applied a combination of a column generation algorithm, a branch constraint algorithm, and a successive averaging method to solve the problem of bus lane distribution in multimodal transport networks. Kaboli et al. [33] used simulated annealing methods to solve a multi-objective bi-level programming model. Ma et al. [34] proposed an algorithm based on a human evolutionary model to solve a bi-level programming model.
In the literature, the problem of setting reversible lanes is mostly studied using a bi-level programming model, which makes the setting of reversible lanes more reasonable by continuously changing the upper-level objective function. The focus of the temporary reversible lane setting is different from that of the previous normal tidal lane. The reversible lanes are time-sensitive and government investment only exists for a few months. Therefore, the optimal objective is to reduce the setup costs and minimize the travel time. Due to the complexity of solving the model, we used three different solution algorithms. The proposed model was implemented and the rationality of the solution using arithmetic examples was demonstrated.

3. Methods

The Olympic exclusive lane is defined by traffic marking or signage on the roadway to designate a lane for Olympic vehicles throughout the day or at certain specific times without allowing other vehicles to pass. The Olympic exclusive lane is an exclusive access space for Olympic vehicles that reduces the impact of private vehicles on Olympic vehicles. The installation of the Olympic exclusive lane changes the roadway access, travel time, and cost, affecting the traveler’s choice of travel path, and thus has an impact on roadway capacity and roadway impedance functions.
The capacity of a road section is the maximum number of vehicles that can pass through a section of the road within a certain amount of time. The Olympic exclusive lane occupies an entire lane as a dedicated lane, which will change the road’s access status, thus changing the overall capacity of the road. The impedance function of the road characterizes the relation between road cost and traffic. When setting Olympic lanes on the road section, we can treat the travel time of Olympic vehicles in the Olympic lanes as a constant value, while the setting of Olympic lanes will directly affect the capacity of the remaining lanes in the same direction. Therefore, to minimize the impact of Olympic exclusive lanes on the other lanes, the addition of temporary reversible lanes to the road sections, which can distribute traffic in the direction of high traffic pressure, should be considered. The installation of reversible lanes changes the previous road network structure, the capacity of the road in different directions, and the impedance function of the road, which consequently affects the travel path choice of travelers. The problem of the optimal adjustment of reversible lanes is essentially an optimization search problem.
The bi-level programming model was first proposed in 1977 and modelled according to the Stackelberg game model, which is typically characterized by a bi-level recursive structure in economic theory [35]. The reversible lane setting during the Olympic Games is a Stackelberg game model, as are other traffic network design issues. The design of tidal lanes typically aims to reduce total travel time, total cost of management and construction, and overall pollution emissions. Meanwhile, network travelers choose the travel options and the minimum travel costs based on the tidal lane settings. The choices of all travelers influence the state of the road network and then influence the decisions of management. Therefore, the goal of the optimal design of reversible lanes during the Olympic Games is to guide travelers to make travel choices that are beneficial to the overall state of the road network through the reasonable design of reversible lanes.
As the installation of reversible lanes during the Olympics is a short-term investment, minimal investment costs and administrative costs are required by the management. Finding the minimum investment cost and the lowest total cost of road network travel is the overall objective of the upper-level model. The lower model mainly considers the travel time of each traveler and introduces the first principle of Wardrop [36]: it is assumed that the traveler can clearly grasp the time spent on each route and the selection behavior; that is, the shortest route is always chosen. The traffic network distribution model is adopted to establish a bi-level programming model with the goal of ensuring the shortest travel time for travelers.
The following four aspects need to be considered when setting up tidal reversible lanes [10]: (1) The number of lanes in both directions should be no less than three. (2) The traffic flow distribution factor should be greater than 2/3. (3) The reversible lanes cannot be designed to affect the capacity of all the traffic. (4) Line-markings, signal facilities’ configuration, and median strips need to be considered.
To facilitate the presentation and analysis of the bi-level programming model, all definitions and notations used throughout this work are described in Nomenclature.
Since the direction of the road tidal phenomenon has different peak hours, it is assumed that the number of tidal increase lanes in the two directions of the road is set at different peak hours. In other words, the two-way traffic flows through the Olympic vehicles during different peak hours, and the Olympic lane with less traffic does not contain the Olympic vehicles, or there is no Olympic lane.
u a = u a
We assume that the road traffic network V is not set up with one-way streets. Additionally, vehicles are divided into two directions on the road section. Thus, the value of u a should satisfy the relationship:
1 n a + u a n a + n a ¯ 1
The investment management cost of the tidal lane includes investment in the construction costs of setting the tidal lane, equipment maintenance, energy loss, etc. This is generally presented as:
p a u a = d a · u a
Private vehicles have fewer lanes to drive on due to the special lane. Therefore, the road capacity should be subtracted from the number of the special lanes. t a uses the BPR function [37] as follows:
t a x a , u a = t a 0 1 + α x a c a n a 1 + u a β
Following the relevant studies which implement the analysis and validation with field-held data in Beijing, the model of the US Bureau of Highways was shown to be more similar to the domestic situation, and the former’s recommended coefficients, α = 0.15 and β = 4 [37], can be used.
Suppose all travel users tend to choose the path with the lowest travel cost. After the effect of price regulation, their path selection behavior will eventually satisfy Wardrop’s first principle to achieve the status of user equilibrium.
A bi-level programming model is established as follows:
min u Z = a A t a x a , u a x a + γ a D p a y a
Equation (5) is the objective function of the road network reversible lane optimization design problem. The total system impedance of the traffic network is minimized by implementing improvements to some road sections to enhance their overall capacity.
s . t . 1 n a + u a n a + n a ¯ 1 , a D
u a 2 , 1 , 0 , 1 , 2 , a D
Equations (6) and (7) show the range of lane number adjustment. Based on the conventional road network, the number of lane adjustments is limited to no more than two. Vehicles are divided in both directions on the road section. Additionally, the total number of lanes remains constant.
min x a A 0 x a t a w , u a d w
k P r s f r s k = q r s , r , s R S
f r s k 0 , k P r s , r , s R S
x a = ( r , s ) R S k P r s f r s k δ r s a k , a A
Equations (8)–(11) are the user equilibrium flow distribution model and its constraints.

4. Algorithm

For the bi-level programming model of reversible lane setting during the Winter Olympics, the upper-level solution variables are mostly a set of discrete integer variables, which are recognized as one of the most difficult problems to solve, since the traffic flow and OD demand at traffic equilibrium are in most cases non-convex, non-derivable functions for increasing the number of lanes. It is more difficult to choose the traditional algorithm to solve the bi-level programming model and it is impossible to obtain the global optimal solution to the model. Consequently, we used the intelligent optimization algorithm to solve the model.
Due to the separation of employment and residence, residents need to travel from one fixed location to another. Thus, a serious imbalance of OD demand exists in one direction during peak hours. This, in turn, generates serious tidal traffic phenomena and causes one-way congestion. To put forward a more reasonable reversible lane setting scheme, we designed a solution algorithm combined with the genetic algorithm, particle swarm algorithm, quantum particle swarm algorithm, and traffic implication.

4.1. Genetic Algorithm Design

Genetic algorithms were first proposed by Professor Holland in the United States in 1975, in his monograph “Adaption in Natural and Artificial System” [38]. It is a stochastic search algorithm that draws on natural selection and natural genetic mechanisms in biology. The following algorithm was designed for the proposed model based on the genetic algorithm. The genetic algorithm was designed based on the bi-level programming model and tidal traffic characteristics.
For all road pairs a , a ¯ in a regional traffic network, the number of lanes added to the positive section U = , u a , in the lane adjustment scheme is coded p = g 1 , g 2 , g i . The coding scheme adopts the decimal system. The i represents the number of lanes that are added to the positive section of the road. The fitness function is defined as the inverse of the upper model objective function value as follows:
F p o p x = 1 a A t a x a , u a x a + γ a D p a y a
Using roulette as a selection mechanism for genetic algorithms, then, the details of the design problem are optimized with the help of reversible lanes, from which the adaptive crossover probabilities are selected. It is important that the details of the reversible lane optimization design problem in the parent generation are taken into account. The parent is repeatedly selected, and the offspring reversible lane optimization design is generated by crossover, from which a more complete offspring population is obtained. The flowchart of the genetic algorithm design is shown in Figure 1.

4.2. Particle Swarm Algorithm Design

A particle swarm algorithm [39] is also known as a particle swarm optimization (PSO) algorithm or a bird flock foraging algorithm. The particle swarm algorithm is mainly based on observations of animal group behavior. Then, the information sharing between individuals in the group is used to induce the whole group to start evolving from disorder to order in the problem–solution space. Finally, the optimal solution algorithm is obtained. Based on the bi-level programming model and tidal traffic characteristics, the particle swarm algorithm is proposed.
For all road pairs a , a ¯ in a regional traffic network, consider the number of lanes U = , u a , added to positive section a in the reversible lane adjustment scheme road network to be the number of particles. For any two-way road, u a + u a ¯ = 0 , we can make z i = , z a i , the i-th particle in a certain kind of group. v i = , v a i , represents the velocity of the i-th particle. The particle updates its velocity and position according to Equations (13) and (14) as follows (subscripts indicate the number of iterations):
v t + i i = ϖ v t i + c 1 ξ p t i z t i + c 2 η g t z t i
z t + 1 i = z t i + v t i
where i = 1 , 2 , , m and m is the particle swarm size. ω is the inertia weight factor, which is obtained by the adaptive linear decreasing method ω = ω m a x ω m a x ω m i n * t / t m a x . c 1 , c 2 are learning factors. ξ and η are uniformly distributed random numbers between [0,1]. p t i refers to the best position for the individual. g t at this point refers to the best historical position passed at time t.
The flow chart of the particle swarm algorithm design is shown in Figure 2.

4.3. Quantum Particle Swarm Algorithm Design

The quantum particle swarm algorithm is mainly a population-based probabilistic algorithm based on the particle swarm algorithm [40]. The main idea is to use the wave function in quantum mechanics to describe the state of particle motion, replacing the position and velocity description of the particle motion state in the basic particle swarm optimization algorithm. Based on the bi-level programming model and tidal traffic characteristics, the quantum particle swarm algorithm is put forward.
For all road pairs a , a ¯ in a regional traffic network, consider the number of lanes U = , u a , added to the positive section a in the reversible lane adjustment scheme road network to be the number of particles. For any two-way road, u a + u a ¯ = 0 , we can make z i = , z a i , the i-th particle in a certain kind of group. Update the particle positions according to Equation (15) as follows (subscripts indicate the number of iterations):
z t + 1 i = p t i ± χ m b e s t t z t i × ln 1 u t i
χ is the contraction and expansion factor. m b e s t t refers to the average best position at this point. u t i ~ u 0 , 1 .
The flow chart of the quantum particle swarm algorithm is shown in Figure 3.
According to the OD and traffic network conditions of the existing tidal traffic phenomenon, m reversible lanes’ setting scheme codes are randomly selected. The bi-level programming model is calculated by the genetic algorithm, particle swarm algorithm, and quantum particle swarm algorithm. The minimum travel time relative to the initial total cost of the system is compared to that of the final minimum total cost. Traffic congestion is alleviated by the decreasing travel index. The optimal solution is used to adjust the reversible lanes according to the system’s minimum total cost.

5. Examples and Results

5.1. Numerical Examples

5.1.1. Construction Examples

To verify the validity and rationality of the above model and the solution algorithm, this paper assumes a regional two-way traffic network where an Olympic lane is set up on a road with three lanes in one direction during peak hours. That is, the number of lanes available for private vehicles in one direction is two and the number of lanes available in both directions is five. During peak hours, the Olympic lanes in the direction of greater traffic are closed to private vehicles.
A regional two-way traffic network is assumed to be selected with 24 nodes and 38 two-way roads with a total of 76 road sections, as shown in Figure 4.
The number of lanes between points is marked above the road. The relative length and width of the road gets wider as it goes out. Figure 4 is more like a mini-city, with urban areas in the middle of the road and expressways on the periphery. Depending on conditions of setting reversible lanes, only 7 roads can satisfy the limitations, which using blue color to highlight.
The situation of each road section and the peak hour OD demand are shown in Table 1 and Table 2.

5.1.2. Solution Algorithm and Analysis

To compare and analyze the effectiveness of the model, we first calculated the system cost value of the traffic network without reversible lanes. A genetic algorithm, a particle swarm algorithm, and a quantum particle swarm algorithm were used to solve the reversible lane scheme of the road network for the arithmetic cases. Meanwhile, the system cost values were compared with the situation with no tidal reversible lanes.
This section of the tidal reversible lane setting scheme only illustrates the setting of tidal reversible lanes on forward roads. The setting of reversible lanes on reverse roads is its opposite during different peak hours.
When solving the model using a genetic algorithm, setting the population size to 10, the number of genetic iterations to 200, and the probability of variation to 0.05, the variation in the objective function value with the number of genetic iterations for the upper-level model in the bi-level programming model is shown in Figure 5.
When using the particle swarm algorithm to solve the optimal design model for reversible lanes under arithmetic traffic network conditions, the number of populations is set to 10, the number of iterations is 200, the learning factor is c 1 = 2 , c 2 = 2 , the maximum velocity factor is k = 0.5, and the inertia weight factor is ω m a x = 0.9, and ω m i n = 0.4. The variation in the objective function value with the number of iterations for the upper-level model in the bi-level programming model is shown in Figure 6.
When using the quantum particle swarm algorithm to solve the optimal design model for reversible lanes under arithmetic traffic network conditions, we set the population size to 60 and the number of iterations to 200. The variation in the objective function value with the number of iterations for the upper-level model in the bi-level programming model is shown in Figure 7.
When there is an Olympic lane with no tidal reversible lanes in the traffic network, the total travel cost is 10,683.
The reversible lane optimization design model used during the Winter Olympics traffic network was solved using a genetic algorithm to obtain a total system cost of 8555.28. The reversible lanes were set up as shown in Table 3.
The reversible lane optimization design model during the Winter Olympics traffic network was solved using a particle swarm algorithm to obtain a total system cost of 8796.22. The reversible lanes were set up as shown in Table 4.
The reversible lane optimization design model for the Winter Olympics traffic network was solved using a quantum particle swarm algorithm to obtain a total system cost of 8723.47. The reversible lanes were set up as shown in Table 5.
A comparison of the total minimum system cost (minZ) and the total system cost without reversible lanes (NoZ), as solved by each algorithm, is shown in Table 6.
When the bi-level planning reversible lane optimization design model based on the Olympic lane established in this paper was solved using a genetic algorithm, a particle swarm algorithm, and a quantum particle swarm algorithm, the reversible lane settings were different. Among them, the total system cost of the reversible lane setting obtained by the genetic algorithm solution was 19.92% lower than that of the no tidal variable lane setting scheme. The total system cost of the reversible lane setting obtained by the particle swarm decreased by 17.91% compared with the cost without reversible lanes. The total system cost of the reversible lane setting obtained by the quantum particle swarm decreased by 18.341% when compared with the cost without reversible lanes.
The minimum travel cost (minZ) and the minimum travel cost without reversible lanes (NoZ) solved by each algorithm are compared in Table 7.
The installation of temporary reversible lanes decreased the travel costs by 20.2%, 18.06%, and 18.72% compared with no tidal lanes.
Thus, setting a reversible lane in the opposite lane can significantly reduce the total cost of the system and the total travel time, as well as alleviating traffic congestion.
The total system cost resulting from the solution performed by the genetic algorithm is optimal. The minimum system cost was obtained after 153 iterations using the genetic algorithm. The minimum system cost was obtained after 185 iterations using the particle swarm algorithm. The minimum system cost was obtained after 149 iterations using the quantum particle swarm algorithm. By comparison, the quantum particle swarm algorithm converges slightly faster than the genetic algorithm and particle swarm algorithm.
The rationality of the reversible lane optimization design model based on bi-level programming and the effectiveness of the solution were verified through analysis of the solution algorithm.

5.2. Practical Example

Beijing Lian Shi Road, located in Beijing, was selected as an example. Lian Shi Road is 7.8 km long, as shown in Figure 8. It is an important commuter road, connecting Mentougou, Shi Jingshan, and FengTai district, passing from the W 3rd Ring Road to W 5th Ring Road. Lian Shi Road is a two-way six-lane road, where the inner lane is assumed to be the Olympic exclusive lane during peak hours. Meanwhile, the Olympic vehicles drive on the same side as private cars, in the direction of heavy traffic. The opposite Olympic exclusive lane is without vehicles during this period. Depending on the measured data as shown in Table 8, the traffic pressure is higher in the direction of the city than going out of the city. The road sections are divided between the adjacent entrances and exit.
The traffic pressure increased from west to east direction with more commuting vehicles entering the city for work. Setting up the Olympic exclusive lane significantly reduced the capacity of private cars, leading to an increase vehicle congestion. The traffic flow in the east to west direction was stable with an overall freestream condition. Therefore, reversible lane measures can be implemented to borrow the inner lane for use by west-to-east private vehicles. The bi-level programming model and genetic algorithm can be adopted to solve this. Variation of the objective function value with the number of genetic iterations for the upper-level model in the bi-level programming model is shown in Figure 9.
The reversible lane setting can be obtained by solving the genetic algorithm as shown in Table 9.
Sections 4–6, 7–9, and 10–12 should be installed for temporary reversible lanes. As 6–7 and 9–10 are relatively short distances, a temporary reversible lane should be set for Sections 4–12, with a total length of 4.6 km, considering its implementation and the driving habits of drivers. In the absence of reversible lanes, the travel time cost for travelers is 4539.5. With the installation of reversible lanes, the travel time cost for travelers was reduced to 3150.3, a 30.6% reduction. Thus, the installation of reversible lanes can significantly reduce travel time and traffic congestion.

6. Conclusions

Installing temporary reversible lanes during peak hours of the Winter Olympics can significantly reduce the commuting time for travelers. It can also alleviate the temporary tidal traffic phenomenon caused by the Olympic exclusive lanes. This paper proposes a method for setting up temporary reversible lanes in the short and medium term. The optimal regulation scheme is studied on the basis of overall government investment and congestion reduction. The research rationalizes the phenomenon of tidal traffic under temporary special circumstances, provides a theoretical foundation for future studies related to the temporary setting of reversible lanes. Moreover, it puts forth a method of investigation for reversible lane adjustments in the medium term. During the Olympic Games, policies regarding the use of Olympic exclusive lanes can be adjusted appropriately to ensure the safety and smoothness of travel for Olympic personnel and simultaneously satisfy the travel demands of private cars. The opposite lane relieves the traffic flow of the side with high traffic pressure and ensures the functioning of the Olympic exclusive lane. Meanwhile, personnel are needed to maintain the normal running of the vehicles.
The complex small network model depicted above was selected based on the harshness of the setting conditions for Olympic exclusive lanes. Subsequently, setting up temporary reversible lanes in different situations should consider large complex networks. However, whether our findings could be applied to emergency situations requires further clarification. Future work should consider the temporal index to explore options for reversible lane adjustment in an emergency. It is also possible to explore temporary reversible lanes establishing short- and medium-term options by selecting the appropriate indicators from the perspective of emissions and environmental indicators.

Author Contributions

Conceptualization, P.J., J.W. and W.H.; data curation, Z.Y.; funding acquisition, P.J.; investigation, Z.Y.; methodology, Z.Y. and W.H.; project administration, P.J.; software, Z.Y. and W.H.; writing—original draft preparation, W.H. and Z.Y.; writing—review and editing, J.W., X.S. and P.J.; supervision, P.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (52172301) and the Beijing Social Science Foundation (21GLA010).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

SymbolDefinition
Vurban transportation network
Wall nodes of the road network
Asections of a road network
a ¯ reverse section of road section
n a number of the lane
c a single-lane capacity
x a section traffic flow
u a number of additional lanes
aalternative tidal reversible lanes
p a u a investment management cost
γ conversion parameter of investment management cost and travel time
t a average travel cost
t a 0 section free travel time
α regression coefficients
β regression coefficients
R S set of origin-destination pairs of OD demands
P r s path set
q r s traffic demand
f r s k path flow of k

References

  1. Hausknecht, M.; Au, T.C.; Stone, P.; Fajardo, D.; Waller, T. Dynamic lane reversal in traffic management. In Proceedings of the 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC), Washington, DC, USA, 5–7 October 2011. [Google Scholar] [CrossRef] [Green Version]
  2. Wolshon, B.; Lambert, L. Reversible Lane Systems: Synthesis of Practice. J. Transp. Eng. 2006, 132, 933–944. [Google Scholar] [CrossRef]
  3. Soumya, D.; Ma, J.M.; Aden, Y. Reversible Lane Operation for Arterial Roadways: The Washington, DC, USA Experience. Inst. Transp. Eng. ITE J. 2011, 81, 26. [Google Scholar]
  4. Nassiri, H.; Edrissi, A.; Alibabai, H. Estimation of the Logit model for the online contraflow problem. Transport 2010, 25, 433–441. [Google Scholar] [CrossRef] [Green Version]
  5. Bede, Z.; Szabo, G.; Peter, T. Optimalization of road traffic with the applied of reversible direction lanes. Period. Polytech. Transp. Eng. 2010, 38, 3–8. [Google Scholar] [CrossRef] [Green Version]
  6. Hu, X.J.; Lin, C.; Hao, X.; Lu, R.; Liu, T. Influence of tidal lane on traffic breakdown and spatiotemporal congested patterns at moving bottleneck in the framework of Kerner’s three-phase traffic theory. Phys. A Stat. Mech. Its Appl. 2021, 584, 126335. [Google Scholar] [CrossRef]
  7. American Association of State Highway, and Transportation Officials. A Policy on Geometric Design of Highways and Streets. 2001. Available online: http://sp.design.transportation.org/Documents/TFGD03.pdf (accessed on 2 March 2022).
  8. Fuhs, C.A. High-occupancy Vehicle Facilities: A Planning, Design, and Operation Manual. 1990. Available online: https://trid.trb.org/view/369933 (accessed on 2 March 2022).
  9. Wolshon, B.; Lambert, L. Planning and operational practices for reversible roadways. Inst. Transp. Eng. ITE J. 2006, 78, 38. [Google Scholar]
  10. Wolshon, P.B.; Lambert, L. Convertible Roadways and Lanes: A Synthesis of Highway Practice; NCHRP Synthesis 340, National Cooperative Highway Research Program; Transportation Research Board: Washington, DC, USA, 2004. [Google Scholar]
  11. Waleczek, H.; Geistefeldt, J.; Cindric-Middendorf, D.; Riegelhuth, G. Traffic Flow at a Freeway Work Zone with Reversible Median Lane. Transp. Res. Procedia 2016, 15, 257–266. [Google Scholar] [CrossRef] [Green Version]
  12. Aaron, G. Perceived costs and benefits of reversible lanes in Phoenix, Arizona. Inst. Transp. Eng. ITE J. 2012, 82, 38. [Google Scholar]
  13. Asaithambi, G.; Kanagaraj, V.; Kashyap, M. Reversible Lanes: Guidelines, Operation and Control. Research Directions. Int. Encycl. Transp. 2021, 52–59. [Google Scholar] [CrossRef]
  14. Ampountolas, K.; dos Santos, J.A.; Carlson, R.C. Motorway tidal flow lane control. IEEE Trans. Intell. Transp. Syst. 2019, 21, 1687–1696. [Google Scholar] [CrossRef]
  15. Tuydes, H.; Ziliaskopoulos, A. Tabu-based heuristic approach for optimization of network evacuation contraflow. Transp. Res. Rec. 2006, 1964, 157–168. [Google Scholar] [CrossRef]
  16. Pyakurel, U.; Dhamala, T.N. Models and algorithms on contraflow evacuation planning network problems. Int. J. Oper. Res. 2015, 12, 36–46. [Google Scholar] [CrossRef]
  17. Pyakurel, U.; Dhamala, T.N. Continuous time dynamic contraflow models and algorithms. Adv. Oper. Res. 2016, 2016, 7902460. [Google Scholar] [CrossRef] [Green Version]
  18. Pyakurel, U.; Dhamala, T.N.; Dempe, S. Efficient continuous contraflow algorithms for evacuation planning problems. Ann. Oper. Res. 2017, 254, 335–364. [Google Scholar] [CrossRef]
  19. Pyakurel, U.; Nath, H.N.; Dhamala, T.N. Efficient contraflow algorithms for quickest evacuation planning. Sci. China Math. 2018, 61, 2079–2100. [Google Scholar] [CrossRef]
  20. Meng, Q.; Khoo, H.L. Optimizing contraflow scheduling problem: Model and algorithm. J. Intell. Transp. Syst. 2008, 12, 126–138. [Google Scholar] [CrossRef]
  21. Wang, J.W.; Wang, H.F.; Zhang, W.J.; Furuta, K. Evacuation Planning Based on the Contraflow Technique with Consideration of Evacuation Priorities and Traffic Setup Time. IEEE Trans. Intell. Transp. Syst. 2013, 14, 480–485. [Google Scholar] [CrossRef] [Green Version]
  22. Zhen, D.; Yang, L. Reversible lane network design for maximizing the coupling measure between demand structure and network structure. Transp. Res. Part E 2020, 141, 102021. [Google Scholar] [CrossRef]
  23. Lu, T.; Yang, Z.; Jin, S. Bi-Level Programming Model for Dynamic Reversible Lane Assignment. IEEE Access 2018, 6, 71592–71601. [Google Scholar] [CrossRef]
  24. Kotagi, P.B.; Asaithambi, G. Microsimulation approach for evaluation of reversible lane operation on urban undivided roads in mixed traffic. Transp. A Transp. Sci. 2019, 15, 1613–1636. [Google Scholar] [CrossRef]
  25. Wei, J.; Wei, L.; Cui, Y. Reversible Lane Scheme Selection Model Based on the BPR Function and Environmental Benefits. In Proceedings of the 2nd International Conference on Materials Science, Machinery and Energy Engineering, Dalian, China, 13–14 May 2017. [Google Scholar]
  26. Pyakurel, U.; Nath, H.N.; Dempe, S.; Dhamala, T.N. Efficient Dynamic Flow Algorithms for Evacuation Planning Problems with Partial Lane Reversal. Mathematics 2019, 7, 993. [Google Scholar] [CrossRef] [Green Version]
  27. Frejo, J.R.D.; Papamichail, I.; Papageorgiou, M.; Camacho, E.F. Macroscopic modeling and control of reversible lanes on freeways. IEEE Trans. Intell. Transp. Syst. 2015, 17, 948–959. [Google Scholar] [CrossRef]
  28. Wei, L.; Xu, J.; Lei, T.; Li, M.; Liu, X.; Li, H. Simulation and Experimental Analyses of Microscopic Traffic Characteristics under a Contraflow Strategy. Appl. Sci. 2019, 9, 2651. [Google Scholar] [CrossRef] [Green Version]
  29. Zhang, H.; Ge, H.; Pan, R.; Wu, Y. Multi-Objective Bi-Level Programming for the Energy-Aware Integration of Flexible Job Shop Scheduling and Multi-Row Layout. Algorithms 2018, 11, 210. [Google Scholar] [CrossRef] [Green Version]
  30. Ma, W.; Wang, M.; Zhu, X. Hybrid particle swarm optimization and differential evolution algorithm for bi-level programming problem and its application to pricing and lot-sizing decisions. J. Intell. Manuf. 2015, 26, 471–483. [Google Scholar] [CrossRef]
  31. Sun, D.; Benekohal, R.F.; Waller, S.T. Bi-level programming formulation and heuristic solution approach for dynamic traffic signal optimization. Comput.-Aided Civ. Infrastruct. Eng. 2006, 21, 321–333. [Google Scholar] [CrossRef]
  32. Yu, B.; Kong, L.; Sun, Y.; Yao, B.; Gao, Z. A bi-level programming for bus lane network design. Transp. Res. Part C Emerg. Technol. 2015, 55, 310–327. [Google Scholar] [CrossRef]
  33. Chalmardi, M.K.; Camacho-Vallejo, J.F. A bi-level programming model for sustainable supply chain network design that considers incentives for using cleaner technologies. J. Clean. Prod. 2019, 213, 1035–1050. [Google Scholar] [CrossRef]
  34. Ma, L.; Wang, G. A Solving Algorithm for Nonlinear Bilevel Programing Problems Based on Human Evolutionary Model. Algorithms 2020, 13, 260. [Google Scholar] [CrossRef]
  35. Candler, W.; Norton, R.D. Multi-Level Programming and Development Policy; The World Bank: Washington, DC, USA, 1977; p. 20. [Google Scholar]
  36. Wardrop, J.G. Some theoretical aspects of road traffic research. Proc. Inst. Civ. Eng. 1952, 1, 352–362. [Google Scholar] [CrossRef]
  37. Transportation Research Board Business Office. Highway Capacity Manual 2008; National Research Council: Ottawa, ON, Canada, 2009. [Google Scholar]
  38. Holland, J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control, and Artificial Intelligence; MIT Press: Cambridge, MA, USA, 1992. [Google Scholar]
  39. Kennedy, J.; Eberhart, R.C. Particle swarm optimization. In Proceedings of the ICNN’95-International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995. [Google Scholar] [CrossRef]
  40. Sun, J.; Feng, B.; Xu, W. Particle swarm optimization with particles having quantum behavior. In Proceedings of the 2004 Congress on Evolutionary Computation, Portland, OR, USA, 19–23 June 2004; Volume 1, pp. 325–331. [Google Scholar]
Figure 1. Genetic algorithm design process.
Figure 1. Genetic algorithm design process.
Sustainability 14 04780 g001
Figure 2. Particle swarm algorithm design process.
Figure 2. Particle swarm algorithm design process.
Sustainability 14 04780 g002
Figure 3. Quantum particle swarm algorithm design process.
Figure 3. Quantum particle swarm algorithm design process.
Sustainability 14 04780 g003
Figure 4. Transportation network structure.
Figure 4. Transportation network structure.
Sustainability 14 04780 g004
Figure 5. Solving the iterative graph with a genetic algorithm.
Figure 5. Solving the iterative graph with a genetic algorithm.
Sustainability 14 04780 g005
Figure 6. Solving the iterative graph using a particle swarm algorithm.
Figure 6. Solving the iterative graph using a particle swarm algorithm.
Sustainability 14 04780 g006
Figure 7. Solving the iterative graph using a quantum particle swarm algorithm.
Figure 7. Solving the iterative graph using a quantum particle swarm algorithm.
Sustainability 14 04780 g007
Figure 8. Overview of Lian Shi Road.
Figure 8. Overview of Lian Shi Road.
Sustainability 14 04780 g008
Figure 9. Genetic algorithm iteration diagram.
Figure 9. Genetic algorithm iteration diagram.
Sustainability 14 04780 g009
Table 1. Traffic network section situation.
Table 1. Traffic network section situation.
Section Number a Name of Road Section t a 0   ( h · 10 2 ) n a c a (100 pcu/h) d a The Number of
Exclusive Olympic Lanes
1 and 391–2 and 2–13.628.6321
2 and 401–3 and 3–12.427.821
3 and 412–6 and 6–2314.9610
4 and 423–4 and 4–32.428.5620
5 and 433–12 and 12–32.427.811
6 and 444–5 and 5–41.228.8910
38 and 7623–24 and 24–231.215.0810
Table 2. Traffic network section OD demand matrix ( 10 3   pcu / h ) .
Table 2. Traffic network section OD demand matrix ( 10 3   pcu / h ) .
12345624
1-0.110.110.550.220.330.11
20.11-0.110.220.110.440
30.110.11-0.220.110.330
40.220.220.22-0.550.440.22
50.220.110.110.55-0.220
60.330.440.330.440.22-0.11
240.11000.2200.11-
Table 3. Genetic algorithm tidal reversible lane setting scheme.
Table 3. Genetic algorithm tidal reversible lane setting scheme.
Name of Road Section1–21–33–127–1812–1316–1818–20
Number of lane settings5555555
Number of reversible lanes0101001
Table 4. Particle swarm algorithm tidal reversible lane setting scheme.
Table 4. Particle swarm algorithm tidal reversible lane setting scheme.
Name of Road Section1–21–33–127–1812–1316–1818–20
Number of lane settings5555555
Number of reversible lanes21110−11
Table 5. Quantum particle swarm algorithm tidal reversible lane setting scheme.
Table 5. Quantum particle swarm algorithm tidal reversible lane setting scheme.
Name of Road Section1–21–33–127–1812–1316–1818–20
Number of lane settings5555555
Number of reversible lanes0100−1−10
Table 6. Comparison of total system costs.
Table 6. Comparison of total system costs.
Name of the ProgramNoZGAminZPSOminZQPSOminZ
Total system cost10,6838555.288796.228723.47
Table 7. Comparison of travel time costs.
Table 7. Comparison of travel time costs.
Name of the ProgramNoZGAminZPSOminZQPSOminZ
Minimum cost10,6838526.278754.228683.46
Table 8. Lian Shi Road statistics table.
Table 8. Lian Shi Road statistics table.
West to EastEast to West
Section NumberVolume (pcu/h)Section NumberVolume (pcu/h)
0–130131–02271
1–223972–13185
2–339003–22317
3–435614–32899
4–548555–42349
5–647126–52872
6–737577–63165
7–864888–72988
8–957949–82922
9–10669210–92856
10–11647411–103184
11–12677812–112860
Table 9. Genetic algorithm tidal reversible lane setting scheme.
Table 9. Genetic algorithm tidal reversible lane setting scheme.
Name of Road Section4–55–66–77–88–99–1010–1111–12
Number of lane settings55555555
Number of reversible lanes11011011
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Hong, W.; Yang, Z.; Sun, X.; Wang, J.; Jiao, P. Temporary Reversible Lane Design Based on Bi-Level Programming Model during the Winter Olympic Games. Sustainability 2022, 14, 4780. https://doi.org/10.3390/su14084780

AMA Style

Hong W, Yang Z, Sun X, Wang J, Jiao P. Temporary Reversible Lane Design Based on Bi-Level Programming Model during the Winter Olympic Games. Sustainability. 2022; 14(8):4780. https://doi.org/10.3390/su14084780

Chicago/Turabian Style

Hong, Weiqi, Zishu Yang, Xu Sun, Jianyu Wang, and Pengpeng Jiao. 2022. "Temporary Reversible Lane Design Based on Bi-Level Programming Model during the Winter Olympic Games" Sustainability 14, no. 8: 4780. https://doi.org/10.3390/su14084780

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop