好文档 - 专业文书写作范文服务资料分享网站

2014年美国大学生数学建模MCM-A题-O奖论文29911 - 图文

天下 分享 时间: 加入收藏 我要投稿 点赞

Team#29911 Page 1 of 40

Team Control Number

For office use only T1 ________________ T2 ________________ T3 ________________ T4 ________________

29911

Problem Chosen

For office use only

F1 ________________ F2 ________________ F3 ________________ F4 ________________

A

Summary

The keep-right-except-to-pass (KRETP) rule has been adopted by many countries around the world, but does this rule actually make our transportation system more efficient? This report aims to analyze this rule along with several other traffic regulations.

Using a discrete cellular-automaton (CA) model and a continuum model, we can simulate real-life traffic situation on freeways via the Monte Carlo method and PDE system respectively. Through comparison with other two traffic rules, we obtain the conclusion that the KRETP rule is rather effective. First we define three parameters---traffic flow, safety index and average energy consumption (AEC) to evaluate the performance of the KRETP rule under various vehicle density. By calculating the optimal maximum velocities during light and heavy traffic, we obtain the influence of under-posted and over-posted speed limits. We also assert that our model can be transferred in \countries with a simple change of orientation. Then we introduce two other traffic rules----the \rule and the \three rules in terms of our pre-defined parameters, we confirm KRETP rule's superiority and provide strategic advice for future freeway construction. Next, under the control of an intelligent system, a \optimization method is proposed to improve the overall quality of freeway transportation system. According to simulation result, our optimization method does improve the performance in terms of all three parameters. Finally, we discuss upon several defects of our model that require further research.

Keywords: KRETP Rule, CA Model, Continuum Model, Monte Carlo Method, Traffic Flow, Safety Index, Average Energy Consumption (AEC), Optimization

?

Team#29911 ?

Page 2 of 40

?

?

?

?

The Keep-Right-Except-To-Pass Rule

Team#29911 Page 3 of 40

Contents

1 Introduction..................................................................................................................................4 2 Assumptions.................................................................................................................................5 3 Modeling for Right-Most Rule...............................................................................................5

3.1 Discrete Modeling for Right-Most Rule.....................................................................5

3.1.1 Model Establishment............................................................................................5 3.1.2 Parameter Evaluation.........................................................................................10 3.1.3 Model Solution and Analysis...........................................................................10

3.2 Continuum Modeling for Right-Most Rule.............................................................17

3.2.1 Model Establishment..........................................................................................17 3.2.2 Model Solution and Analysis...........................................................................18

3.3 Comparison of Discrete Model and Continuum Model....................................22 3.4 Transferability Analysis of Model in \

4 Modeling for Alternative Freeway Traffic Rules.........................................................22

4.1 \4.2 \4.3 Comparison of Different Traffic Rules......................................................................24

5 Modeling for Intelligent-System Control........................................................................26

5.1 \5.2 Possible Further Improvements…………………………………………………………29

6 Superiority and Weakness....................................................................................................29

6.1 Superiority Analysis.........................................................................................................29 6.2 Weakness Analysis............................................................................................................30 6.3 Future Research.................................................................................................................30

6.3.1 Possible Optimization of Discrete Model....................................................30 6.3.2 Possible Optimization of Continuum Model..............................................31

7 Conclusion...................................................................................................................................31 8 References...................................................................................................................................32 9 Appendix..................................................................................................................................... 32

Team#29911 Page 4 of 40

1 Introduction

Traffic rule plays an essential role in a nation's transportation system. An optimal traffic rule can dramatically enhance the capacity and efficiency of the transportation network, providing common citizens with tremendous convenience. In this report, we will mainly focus on one such rule which requires automobiles to stay in the right lane unless they have to overtake.

America first enacted the \in 1804, followed by many other countries in the following decades. [1] Up to now, most countries are \UK and Australia. On American multilane freeways, for example, drivers are required to drive in the right-most lane unless they need to overtake, in which case they move one lane to the left and then switch back to the right-most lane. See in Figure 1.

Despite the long history of this rule, there has been little scientific inquiry into the effect of this rule. In such circumstances, a systematic analysis of this rule's realistic effect, including the change in traffic flow, safety index and energy consumption.

?

More specifically, we are expected to examine the following issues in our Analyze the effect of the \rule in various terms under different vehicle densities (light and heavy traffic);

Calculate the optimized speed to maximize a weighted function of the traffic flow, safety index and average energy consumption.

Discuss the role of under-posted and over-posted speed limits and the transferability of our model in \left lane is the norm;

Propose other possible freeway traffics rules and compare them with the \

Discuss the transferability of our model in \countries where driving on the left lane is the norm;

Design optimization method to enlarge traffic flow when equipped with an intelligent system.

report:

?

?

?

?

?

Team#29911 Page 5 of 40

Figure 1. Illustration of \

2 Assumptions

? ? ?

Assuming automobile to move in straight lines;

Assuming that jams only occur because of gradual piling of automobiles; Without consideration of sudden crashes that will influence the behavior of subsequent vehicles;

Assuming that the parallel movement of a vehicle into another lane takes no time;

Assuming that all the drivers on the freeway are abide by the traffic rules;?Assuming that the vehicles have the same length and mass; Assuming that freeways have no extra entrance or exit.

?

? ? ?

3 Modeling for Right-Most Rule

In order to analyze the effect of the \rule, first we have to establish a model to simulate the traffic flow on the multilane freeway. Then we add certain driving and lane-changing rules to make sure that in our simulation the automobiles are abide by the \

3.1 Discrete Modeling for Right-Most Rule

Discrete models treat both time and the position of vehicles as discrete quantities and simulate the moving of automobiles step by step. We start out simulation with a single kind of vehicle (single maximum speed) on a double-lane freeway (right lane is slow lane and left lane is fast lane) and then extend to two kinds of vehicles, namely, fast car and slow car (two maximum speeds), which is closer to realistic situation.

3.1.1 Model Establishment

? Vehicles of a Single Kind

Among the various discrete models, we adopt the \which was initially formulated by Nagel and Schreckenberg (NS) to idealize the

Team#29911 Page 6 of 40

movement of vehicles as the discrete \Figure 2 is a vivid illustration of our model. We treat the double-lane freeway as a two-column lattice and each vehicle contains exactly one lattice.

Figure 2. Representation of the \

We apply the Monte Carlo method to simulate the traffic flow on the

double-lane freeway.[2] The quantities involved in the simulation are shown in Table 1. Notation ??(??) ??(??) Δ????(??) ??Δ????(??) ??Definition The position of car numbered ?? The velocity of car numbered ?? The gap in front of car numbered ?? in the present lane The gap behind car numbered ?? in the present lane The gap in front of car numbered ?? in the other lane The gap behind car numbered ?? in the other lane The maximum velocity the kth car can achieve on the freeway The traffic flow(number of cars passed per lane per unit time) The safety index The length of the lane during simulation* The duration of the simulation* Δ????(??) ??Δ????(??) ??????????(??) ?? ?????????? ?? ?? Team#29911 Page 7 of 40

???? ???? ?? ?? The probability of a car decelerating* The probability of a car changing lane* The density of vehicles * The number of car during simulation ??=2???? Table 1. Definition of Notation in \

(Terms marked with an asterisk (*) require pre-evaluation before the simulation begins)

Before the simulation begins, we need to evaluate the following five

parameters: number of cars ??, the length of lane ??, the duration of the simulation ??, the maximum velocity vehicles can achieve ????????, the probability for a driver to decelerate during each unit time ???? and the probability for a driver to change lane ???? if the current situation qualifies the rule of changing lanes.

After these parameters have been evaluated, we set the position of each car ??(??) randomly in the double-lane freeway with half cars on the left (fast) lane and the other half on the right (slow) lane and the velocity of each car ??(??)randomly between [????????/2,????????]. We set the entire freeway to be a loophole so that once a car reaches the last lattices it will re-enter the double-lane freeway in the first lattices. Under such conditions, the density of the vehicles remain unchanged throughout the simulation.

After the simulation begins, at each time unit the driver will either remain in the same lane or change lane if situation permits. The rule of acceleration and deceleration is as follows: (??) ???? ??(??)

where ?????? ?? is a random number between 0 and 1 generated at each time unit.

The permission rule for changing lane is much more complex and comprised of several basic rules. It is derived from Wagner’s according to the statistics gathered from a Germany freeway where \[3]

Team#29911 Page 8 of 40

Rule safety ??(i)ΔX??(??)>0, Rule stay except blocked (Rule #0) (i)ΔX??(??)ΔX??(??)(more space on the other lane) or ΔX??(??)>??(??)(enough space on the other lane) ??????enough space in front (ii) The nearest (ii) ΔX??(??)>ΔX??(??) neighbor site in the , more space on the (ii) ran f < Pc other lane is empty. other lane b(iii)ΔXo(n)>Vmax, enough space to the next car on the other lane (iii) ran f < Pc Table 3. The Basic Rules

??????????→???????? Rule safety Rule #0 ????????→?????????? Rule safety Rule #1 (i) (ii) (i) (ii) Table 4. The Rule of Lane Changing corresponding to the “rightmost” rule Our Monte Carlo simulation has three outputs: traffic flow ?? and safety index ?????????? and the energy cost E0. For traffic flow ??, we choose a fixed point (in our simulation we choose the end point of the lattices since the freeway is a loop) to count the total number of cars passing that point denoted as ???????????? within the duration of the simulation ??, then we use the following equation to calculate ??:

??????????????=.

??

As for ??????????, we make the assumption that safety index is proportionate to the reaction time of all the drivers on the freeway throughout the entire simulation. We take the proportionate coefficient to be 1 for convenience:

??????????=

??

∑??∑??[exp(?ΔX1??(??)/??(??))]

?????

.

In Table 5, we present the specific steps of our Monte Carlo simulation:

Input Length of the lane, ??. Duration of the simulation ??. Team#29911 Page 9 of 40

Output

Step 1 Step 2 Step 3 Step 4 Step 5

Vehicle density ??. Deceleration probability ????. Lane changing probability ????. Traffic flow ??. Safety index ??????????. Energy cost ??0

Randomly generate the initial position, speed and max speed of vehicle ?? ??(??), ??(??) and ????????(??). Repeat Step 3 ~ 16 ?? times. Repeat Step 4~5 for each vehicle

Apply the safety rule to vehicle ??, skip Step 5 if vehicle ?? doesn’t pass the rule

Apply either change lane rule #0 or change lane rule #1 to vehicle i based on which lane it is on, its current speed and the current model, then decide whether it should change its lane. Update each vehicle to its new lane.

Repeat Step 8~16 for each vehicle number ??. Let the expected new speed ??′(??)=??(??)+1 If Δ????(??)

If ??′(??)>0, generate a random number in [0, 1] and check whether it is smaller than ????, let ??′(??)=??′(??)?1 if so. Let ??′(??)=??(??)+??′(??)

??????????

??

Δ????′(??)

=??????????+exp (?)

??′(??)

??

??

Step 6 Step 7 Step 8 Step 9 Step 10

Step 11 Step 13

Step 14 Step 15 Step 16 Step 17 Step 18

If ??′(??)≥??, then ??′(??)?=??, ??=??+1 If ??(??)

??0

????????????

??

, ??????????=??, ??=??

Output and halt.

Table 5. Monte Carlo Procedures

? Vehicles of Two Kinds (Fast Cars & Slow Cars)

Next, we consider a more complex situation in which cars are classified into

??

??

fast cars and slow cars with respective maximum speed ????????, with ?????? and ??

other conditions and rules unchanged.

Team#29911 Page 10 of 40

Next, we apply a similar Monte Carlo algorithm to simulate the traffic flow

with two kinds of vehicles and output corresponding flow ?? and safe index ????????.

3.1.2 Parameter Evaluation

? The length of the lattices ??=2048;

? The vehicle density ??=0.02,0.04,0.06,0.08,0.1,0.13,0.16,0.2,0.25,0.3; ? The number of the total vehicles ??=2????; ? The duration of the simulation ??=4096; ? The deceleration probability ????=0.1; ? The change lane probability ????=0.7;

? In the case of vehicles of single kind, set maximum velocity ????????=5; ? In the case of vehicles of two kinds, set maximum velocity of fast car ????????=

??

5, set maximum velocity for slow car ????????=3;

??

? The ratio of fast car to slow car is 4:1, the initial number of vehicle in each

lane is 1:1.

3.1.3 Model Solution and Analysis

We mainly analyze the influence of the right-most rule on three parameters:

Traffic flow ??, safety index ?????????? and average energy consumption ??0. Then we assign a relative weight to each parameter to calculate an optimal velocity during light traffic and heavy traffic. We will only present the simulation result of the two-kind vehicle model.

? Traffic Flow

As we have discussed before, we define the traffic flow ?? as the number of

cars passing a fixed point per unit time, or

????????????

??=

??

In Figure 3, we present the value of traffic flow ?? under different vehicle

density ??.

Team#29911 Page 11 of 40

Figure 3. Relationship of Traffic Flow ?? and Vehicle Density ??

Apparently, the pattern in Figure 3 accords with realistic situation

qualitatively. When the vehicle density on a freeway is relatively low, slight increase of vehicle, or in other words, vehicle density will cause traffic flow to rise dramatically because according to our rules vehicles accelerate very easily. In our simulation, the peak value of flow ?? occurs when density is around 0.2. After the climax, the traffic flow will tend to drop as vehicle density continues to rise because more likely car jams will obstruct vehicles from accelerating freely. Finally, when the density approaches 1, in other words, the freeway is almost \

? Safety Index

Notice that the longer reaction time is, the safer the situation will be. Thus

according to our definition of the safety index

??????????

??

∑??∑??1[exp(?Δ????(??)/??(??))]=

?????

a larger value of ?????????? indicates a more dangerous situation. We again plot safety index ?????????? against vehicle density ??. The result is shown in Figure 4.

Team#29911 Page 12 of 40

Figure 4. Relationship of Safety Index ?????????? and Vehicle Density ?? (lower is safer)

It is easy to understand the pattern in Figure 4. When the vehicle density is

relatively small, accidental risk rises as the number of car increases because vehicles are likely to attain high velocities. After the peak value, the risk drops as density rises because though the number of vehicle rises, the average velocity decreases dramatically. Since most vehicles drive much slower, the overall situation becomes actually safer. Finally, when all the vehicles cannot move at all (when ??=1), the situation is absolutely safe. Notice that the climax vehicle density are nearly the same in traffic flow and safety index because both quantities are closely related to average velocity.

? Average Energy Consumption

Now we define another important parameter called the average energy

consumption denoted ??0. We use it to measure the energy consumed during each acceleration. We approximate the quantity as proportionate to change of kinetic energy. For a particular vehicle ??, we denote its velocity at time ?? and ??+1 as ??(??)(??) and ??(??+1)(??). Furthermore, we make the assumption that each vehicle has unit mass. Now we can derive the formula for ??0:

??1(??)2(???1)∑??(??))2]??=1∑??=12??[(??(??))?(??

??0∝

??

??1(??)(???1)∑??∑(??)][??(??)(??)+??(???1)(??)]??=1??=12??[??(??)???

∝ ??

Team#29911 Page 13 of 40

??(??)(???1)∑??(??)]??=1∑??=1[??(??)+??

∝ ??

In order for convenience, we evaluate the proportionate coefficient as 1. So

that

??(??)(???1)∑??(??)]??=1∑??=1[??(??)+??

??0= ??

We again plot the average energy consumption against vehicle density in

Figure 5.

Figure 5. Relationship of Energy Consumption ??0

and Vehicle Density ?? (lower is better)

In the first half of the figure, the increase of ??0 could be explained by the

frequent lane changing and acceleration due to a low vehicle density. In the latter half, although vehicles are much less likely to accelerate, notice that traffic flow also falls dramatically, therefore the average energy consumption still increases.

? Optimal Maximum Velocity Estimation (Weighted)

In this section, we will design a weighted function ?? dependent on the three

key variables---traffic flow ??, safety index ?????????? and average energy consumption ??0. Then we will calculate an optimal speed limit to maximize the value of ?? under light traffic and heavy traffic respectively.

We define the weighted function as follows:

??(??,??????????,??0)=??1

??????????3????03

+??2(1?)+??3√1?() 1.2 8000.4

Team#29911 Page 14 of 40

to design our function:

?

??.??. ??1+??2+??3=1 where ??1,??2,??3 are weight coefficient. We base on the following four rules

When ?? reaches its peak value, we define the corresponding ???????? to be the optimal maximum velocity;

Since the three variables ??,??????????,??0 are independent of each other, ?? should be expressed in the form of simple sums. ?? and ??0 should appear in linear forms in ??;

The value of ?? should drop sharply when the safety index is rather high Hence ?????????? should appear in the form of an upward-convex-function in ??. Now under light traffic where ??=0.1 and heavy traffic where ??=0.2

?????????

?????????

?

? ?

respectively we can calculate the corresponding ???????????????? and ????????????????. We plot ?? against different values of ???????? under the condition (??1=0.5,??2=0.2,??3=0.3) in Figure 6 and Figure 7.

?????????????

Figure 6. Optimal Maximum Velocity (Light Traffic)

Team#29911 Page 15 of 40

Figure 7. Optimal Maximum Velocity (Heavy Traffic)

Considering the duration of light traffic and heavy traffic in a given time

period, we set the ratio 4:1 (light :heavy) to obtain the result for a \situation. See in Figure 8.

?????????????

Figure 8. Optimal Maximum Velocity (combined)

As shown in Figure 8, the global maximum value of ?? locates at ????????=5,

therefore the optimal maximum velocity ????????????????=5. In other words, when we set the speed limit at 5, we achieve a weighted optimization of traffic flow, safety index and energy consumption.

? Analysis of Under-Posted and Over-Posted Speed Limits

In the section above, we have calculated the optimal maximum velocity

????????????????=5. We will discuss the influence of under-posted and over-posted speed limits in light and heavy traffic respectively.

Team#29911 ?

Page 16 of 40

Light Traffic

If a speed limit is over-posted, say, ????????=7, traffic flow, safety index and

average energy consumption all increase. In other words, we sacrifice energy and safety for larger traffic flow.

If a speed limit is under-posted, say, ????????=3, traffic flow, safety index and average energy consumption all decrease. In other words, we sacrifice traffic flow for lower energy consumption and a safer condition.

?

Heavy Traffic

If a speed limit is over-posted, say, ????????=7, traffic flow will remain almost the same while energy consumption and safety index will rise. This is highly unwelcome. If a speed limit is under-posted, say, ????????=3, situation will be similar to that of light traffic. Still, we will be sacrificing traffic flow for lower energy consumption and a safer condition.

? Visualization

To make our simulation results more intuitive, we use MATLAB to visualize

our simulation. In the figures below, each row signifies the distribution of vehicles with black dots representing vehicles occupation and margin representing empty space. Time increases from bottom to top and vehicles move from left to right. We visualize our simulation at low vehicle density (??=0.05) and high density (??=0.2) respectively in Figure 9 and Figure 10. Subfigure on the left represents the left lane and the subfigure on the right represents the right lane.

Figure 9. Visualization at Low Density

Team#29911 Page 17 of 40

Figure 10. Visualization at High Density

3.2 Continuum Modeling for Right-Most Rule

Apart from the discrete, microscopic cellular automaton (CA) models we have adopted above, in this section we will establish a continuum, macroscopic model to describe the vehicle flow on the freeway.

3.2.1 Model Establishment

Our ultimate goal is to make a continuum model for the traffic flow on a

freeway.

We

start

our

work

from

the

single-lane

double-lane

situation.?According to [4], we can use partial-derivative equations (PDE) system to describe the traffic flow on a single-lane freeway. There are two variables in the equation system: the average speed of vehicles ??(??,??) and the density of vehicles ??(??,??). The PDE system contains two parts:

??

Continuity equation:

??????(????)+=0 ????????

??

Dynamic equation:

????????????(??)???????+??=+??0 ??????????????

In the second equation, the right side contains a relaxation term (????(??)?

??)/??, which reflects the process when a driver tries to adjust his velocity to the equilibrium velocity ????(??) in the time interval ?? and an anticipation term ??0????/????, which represents the process when the driver reacts to the traffic condition ahead with the propagation speed of small disturbance ??0.

Team#29911 Page 18 of 40

Now we extend that model to accommodate the double-lane situation to

accommodate the \rule. We will establish the equations for the two lanes separately. In order to describe lane-changing between the right (driving) lane and the left (overtaking) lane, we will introduce two variables ?????? and ??????, which represent the lane changing rate. In particular, ?????? denotes the changing rate from lane ?? to lane ??(??,??∈{1,2}). The overtaking lane is denoted by Lane 1 and the driving lane is denoted by Lane 2. Thus, the net lane change into lane ?? is ?????? ???????.

Hence the continuity equation could be written as:

????????(????????)

+=?????? ??????? ????????

For the dynamic equation, we introduce two constant parameters ??1, ??2 to

??????????????????(????)???????????

+????=+??0??+??1?????????2?????? (??=1,2) ????????????????

According to [5], we assume:

??

??

be the coefficients of ??????, ??????. The equation should be:

??12=??????1(???)??1(1???2 )

??21=??(1+??(????1(???)?????2(???)))????2(???)??2(1???1 )

??

??

where ????1 denotes the equilibrium flow ????1=??1????1(??1)

??? denotes the average density of Lane 1 and Lane 2 ???=(??1+??2)/2 ???? denotes the density in a jam ??,?? are two constant parameters.

Such assumption is reasonable. Firstly, notice that the expression of ??12 and ??21 is not symmetric because of the asymmetricity of the double-lane freeway. Secondly, if Lane 2 is suffering from a traffic jam, then ??2=????; if there are no vehicles in overtaking lane 1,then ??1=0. Under both circumstances, we can derive ??12=0, which implies that no car can change into the driving lane when it has a traffic jam or when there are no vehicles on the overtaking lane.

3.2.2 Model Solution and Analysis

??Study of Steady State

According to theories of PDE, we can obtain a steady state solution of our

Team#29911 Page 19 of 40

model by setting the derivative terms to zero. Then we can derive the following two equations:

????1(???)??1(1?

??2??1

)=(1+??(????1(???)?????2(???)))????2(???)??2(1? ) ????????

??????(????)???????????

+??0??+??1?????????2??????=0 (??=1,2) ????????

Plugging in 2???= ??1+??2, we can derive the expression of ????1(??) and

????2(??) from the equations above according to [6]: ????1(??)=????(1?

??????

)/(1+??(

??????

)4)

1

??

??????

????2(??)={ ????4

????(1???)/(1+??(??)) (??≥????)

??

??

????(1???)/(1+??(??)4)(2+2??) (??

????

where ???? denotes the free flow speed and ?? is a constant parameter.

Using the relationship given above, we can derive the relationship between ???? and ???. Then we use the definition ????=???????? to express the flow on each lane with the average density ???.

According to [7], we assign the following values to the parameters: ??1=??2=10??,????=30 ??/??,??=0.01,??=5,??01=??02=10??/??

????= 0.14 ?????/??,??1=150??2/??,??2=50??2/??,????=0.05 ?????/??,??=100.

Since we have established the traffic flow function of average density on both lane, we can plot the relationship as shown in Figure 11.

Figure 11. The Relationship of Traffic Flow ?? and Average Density ???

In Figure 11, we can discover that all three kinds of flows experience a

Team#29911 Page 20 of 40

similar changing pattern---when the average density is relatively small, traffic flow experiences a monotonic increase as the density gets larger. After reaching its climax, the flow drops gradually to 0 as the density keeps rising. This changing pattern is identical to the results we have obtained in the discrete model. We can also discover that the overtaking (fast) lane reaches its climax sooner than that of the driving (slow) lane. Due to difference of the maximum velocity, the peak value of fast lane's traffic flow is larger than that of the slow lane. In addition, the curves of fast lane and slow lane almost overlap when ??>????=0.05. The overlapping part of curves actually indicates that the utility rate of both lanes is almost the same when ?? is relatively large.

? Study of Numerical Simulation?

In this section, we mainly study the density function ????(??,??)(??=1,2) as a

solution of the PDE system. In order to simulate the two-lane traffic movement, we assume that ?? = 32.2 ????. The following initial variation of the average density ??? proposed in [8] can be used on either the fast or the slow lane:

11

??(??,0)=???+Δ???[?] 4011??1605??22???????((???))4???????(??(???32))??16

Then, our model (the PDE system) can be solved by the numerical scheme

given in reference [9]. Here we just provide the figures of the solution under three different conditions. (All of these three figures are dynamic traffic images of an asymmetric double-lane system with curve (a) representing the fast lane and curve (b) representing the slow lane.)

? ? At Low Average Density ??

According to Figure 12, any perturbations on the fast lane or the slow lane

will quickly dissipate. Because of the lane-changing tendency, a cluster appeared in the fast lane may cause a small hump in slow lane.

On the opposite side, as shown in Figure 13, a cluster in slow lane may quickly dissipate because people trapped by the cluster in slow (driving) lane may choose the fast (overtaking) lane for passing.

Team#29911 Page 21 of 40

Figure 12. Low Density(Jam First Appeared on Fast Lane)

Figure 13. Low Density(Jam First Appeared on Slow Lane)

? ? At Normal (or Higher) Average Density ??

As average density continues to rise, free space for vehicles decreases and it

becomes less likely for the double-lane system to maintain stability. Correspondingly, serious traffic jams and “stop-and-go” waves become more probable. See in Figure 14.

Team#29911 Page 22 of 40

Figure 14. Normal or Higher Density

Parameter evaluation of the three figures:

Figure 12: ??1=0.047?????/??,??2=0.021 ?????/??,???=0.06 ?????/??; Figure 13: ??1=0.047?????/??,??2=0.021 ?????/??,???=0.06 ?????/??; Figure 14: ??1=0.053?????/??,??2=0.053 ?????/??,???=0.06 ?????/??.

3.3 Comparison of Discrete Model and Continuum Model

In the discrete (CA) model, we focus on the relationship between traffic flow

and vehicle density and obtain the following fact: when density is relatively small, flow rises as density increases; after reaching its peak value, flow then decreases gradually to 0. This coincides with the conclusion derived in the continuum model as shown in Figure 9. More intuitively, the visualization images of both models also convey the same conclusion.

3.4 Transferability Analysis of Model in Left-Handed Countries

According to our research, the difference between the left-most and right-most tradition is mainly historical. In addition, our model has no partiality for either left orientation or right orientation. In other words, orientation is symmetric in our model. Therefore our model could be transferred in left-handed countries with a single change of orientation.

4 Modeling for Alternative Freeway Traffic Rules

In this section, we will use similar Monte Carlo method to simulate the traffic flow under two alternative traffic rules: \& free overtaking\

4.1 \

? Model Explanation

In the \the fast cars are designated among the left and right lanes and no lane changing is allowed. In other words, this is a model of two disconnected single lanes. We run two simulations. First, test a lane with only fast cars and calculate

Team#29911

??

??

Page 23 of 40

corresponding ????, ??????????, ??0; then test a lane with 60% fast cars and calculate

????

corresponding ????, ??????????, ??0. The overall fast car percentage is 80% matching

previous simulations. The final result is a mixture of previous results with weight (1:1).

??=0.5?????+0.5?????

??

??????????=0.5???????????+0.5??????????? ??

??0=0.5???0+0.5???0

????

Parameter evaluation before the simulation is as follows:

The length of the lattices ??=2048;

The vehicle density ??=0.02,0.04,0.06,0.08,0.1,0.13,0.16,0.2,0.25,0.3; The number of the total vehicles ??=2????; The duration of the simulation ??=4096; The deceleration probability ????=0.1; The change lane probability ????=0.7;

The maximum velocity of fast car ????????=5, maximum velocity for slow car

??

????????=3.

??

? Model Solution and Analysis

Using computer simulation, we plot traffic flow ??, safety index ?????????? and average energy consumption ??0 respectively against vehicle density ??. The results will be shown in Section 4.3.

4.2 \

? Model Explanation

Under the \

??

overtake with no specific requirement. The two lanes are symmetric and the only

??limitation is the respective maximum velocity ???????? for fast vehicles ?????? and ??

and slow vehicles. Parameters and their evaluation are still the same as in the \

? Model Solution and Analysis

Again, we consider the influence of this traffic through measuring of the three key factors---traffic flow ??, safety index ?????????? and average energy consumption ??0. Further comparison of the three traffic rules will be shown in the Section 4.3.

Team#29911 Page 24 of 40

4.3 Comparison of Different Traffic Rules

Same as that in the slow-cars-to-right rule, we will mainly focus on the first half of the figures to analyze the difference of the three rules.

? Traffic Flow

We plot traffic flow ?? against vehicle density ?? in Figure 15.

Figure 15. Traffic Flow under Different Traffic Rules

As shown in Figure 15, during light-traffic situation, traffic flow under the

\rule and \rule are larger, traffic flow under the \

During heavy-traffic situation, flow under three rules tends to be the same,

which is easy to understand because the more probable jams make the advantages of the last two traffic rule hard to discern.

? Safety Index

We plot safety index ?????????? against vehicle density ?? in Figure 16.

Team#29911 Page 25 of 40

Figure 16. Safety Index under Different Traffic Rules (lower is safer)

During light-traffic situation, the condition under the \

-to-pass\rule and \rule is much safer than that under the \

During heavy-traffic situation, same as that of traffic flow, safety index under three traffic rules tend to be the same because vehicle tend to drive at a much lower speed which make the overall condition much safer.

?

? Average Energy Consumption

Figure 17. Average Energy Consumption under

Different Traffic Rules (lower is better)

We plot average energy consumption ??0 against vehicle density ?? in

Figure 17.

Team#29911 Page 26 of 40

Since a large portion of energy consumption comes from traffic jams, and

unstable lane changing easily result in traffic jams, the \driving & free overtaking\rule will definitely be more energy-costly. Such trend is manifest during light traffic when acceleration is fairly easy.

During heavy traffic however, lane changing and acceleration become much more difficult, most of the energy consumption is from the accelerations and decelerations in traffic jams, therefore the average energy consumption under three rules tends to be the same.

? Summary & Suggestions

From the figures above, we can discover that \rule is inferior to the \rule and \rule. This accords with real life situation because most countries adopt a combinational policy of \

Meanwhile, it is unrealistic to adopt the \because total forbidding of lane changing and overtaking is unreasonable. Our suggestion is that maintain the policy of \rule and meanwhile construct separate fast and slow lanes for those freeways frequently suffered from car jams and obstructions.

5 Modeling for Intelligent-System Control

In this section, we make the general assumption that equipped with an intelligent system. The intelligent system knows about the exact velocity and location of all the vehicles on the freeway and controls them together. We aim to propose a new traffic rule such that the overall traffic flow of the freeway could be even larger.

5.1 \

? Model Explanation

We now introduce a rule called “median” rule. The basic idea is to let vehicles with higher speed stay on the left lane more, while vehicles with lower speed stay on the right lane, reducing the possibility of fast cars following slow cars. The separation point is the median speed, which is known easily by a system that controls all the vehicles. The advantage of median speed is that it is automatically

Team#29911 Page 27 of 40

adjusted according to the current average speed, then exactly demand half of the cars go to the left lane and vice versa. Therefore this rule will not let the left lane and right lane become unbalanced both in light and heavy traffic comparing to the usage of a fixed speed cap. The rule is as stated in Figure 18.

Determine the speed of the kth carTV(k)=Vmedian?FGenerate a random number in [0, 1]V(k)>Vmedian<0.5>0.5Apply rule: Stay on left lane except blocked, return to left lane if possible.Apply rule: Stay on right lane except blocked, return to right lane if possible.End

Figure 18. \?

? Model Solution and Analysis

Under the same maximum velocity, we plot traffic flow, safety index and

average energy consumption against different vehicle density. See in Figure 19-21.

Team#29911 Page 28 of 40

TrafficFlowQagainstVehicleDensitynTrafficFlowQ1.510.50EquippedNot Equipped00.10.20.30.4VehicleDensitynFigure 19. Relationship of Traffic Flow and Vehicle Density

0.350.30.250.20.150.10.05000.10.20.3SafetyIndexasafeagainstVehicleDensitynSafetyIndexasafeEquippedNot Equipped0.4VehicleDensitynFigure 20. Relationship of Safety Index and Vehicle Density (lower is safer)

AverageEnergyConsumptionE0againstVehicleDensitynAverageEnergyConsumptionE0200015001000500000.050.10.150.20.250.30.35EquippedNot EquippedVehicleDensitynFigure 21. Relationship of Average Energy Consumption

and Vehicle Density (lower is better)

Team#29911 Page 29 of 40

From the above Figures, we can discover that the \optimization

does perform better in terms of traffic flow, safety condition and energy consumption, even though such optimization is not very dramatic. This also indicates that the current \rule is already a pretty mature one.

5.2 Possible Further Improvements

The “median” rule is only a simple rule, more advantages of the intelligent systems can be utilized. In the discrete (CA) model, a driver can only change his speed according to the distance of cars closely in front or behind because he doesn't know about the location of other cars and intentions of their drivers. Therefore when he is in a car flow without any gaps as shown in Figure 22, the only thing he can do is stop and wait for the front car to move. That's why we only compare his current velocity ?? with Δ???? and Δ????.

Figure 22. Illustration of Online Algorithm

But with an intelligent system, it controls all the cars at the same time. Under

??

??

such circumstances, it can optimize traffic flow by accelerating the three cars together with the same acceleration. This approach is extremely effective in traffic jams.

6 Superiority and Weakness

6.1 Superiority Analysis

??

By reasonable discretization and Monte Carlo method, CA model properly simulates normal driving and overtaking on real-life double-lane freeways; The solution of the CA model could be presented via various forms and standards, visualization technique makes the result even more intuitive;

??

Team#29911 Page 30 of 40

??

Our model has robust flexibility, only minor modification could realize simulation under different traffic rules and parameters;

By comparing with other traffic rules, we can fully realize the influence of keep-right-except-to-pass rule from various aspects;

By designing algorithms under an intelligent system, our model has reference value in terms of future freeway construction; Our continuum model assigns realistic values to parameters, confirming the results derived from the discrete model from a macroscopic perspective.

??

??

?

6.2 Weakness Analysis

??

Due to the restriction of computer simulation, some of our assumptions are highly ideal, such as the length of vehicles and the value of acceleration. The core of our system depends on computer simulation, therefore the calculation of key quantities such as traffic flow and safety index is time-costly.

??

6.3 Future Research

6.3.1 Possible Optimization of Discrete Model

??

If technique permits, we strive to make computer simulation as similar as possible to realistic situations. One possible measures is that we can use 1 minute as the basic time unit and assign realistic values to lattice length (such as 0.5km). Since most vehicles travel at velocity between 60 ????/? and 120 ????/?, within one time unit (1 min), a vehicle is expected to pass 2-4 lattices within one minute.

For more accurate approximation, vehicle profile should be taken into consideration. For example, limousines, sedans, jeeps are usually small but relatively fast, we can assign them with one-lattice length and larger maximum velocity; trucks, on the other hand, could be assigned with length of multiple lattices and a smaller maximum velocity.

Finally, we add a more professional factor in the transportation field---stopping sight distance and its limit. The stopping sight distance is used to measure several secure distances in driving. We can assign an integer to the stopping sight distance, denoted as ??0. When the front gap is larger than the stopping sight distance (Δ????>??0), we compare ??+1 with

??

??

??

Team#29911

??

??

Page 31 of 40

??0 instead of with Δ???? or Δ???? to determine the vehicle's velocity at next time interval. We can further combine weather conditions to evaluate the stopping sight distance. Such model is of great importance in deciding whether to close freeways under severe weather conditions.

6.3.2 Possible Optimization of Continuum Model

??

In many countries around the world, the number of freeways are dramatically increasing. We can continue to develop multi-lane(more than two lanes) models. Speed limits could also be incorporated in the continuum model.

Construct a systematic theory to analyze the graphic form of ??(??,??) and look for accurate analytical expressions.

??

7 Conclusion

We use a discrete model and a continuum model research upon the influence of \rule on traffic flow, safety index and average energy consumption respectively. Furthermore, to fully determine the pros and cons of the rule, we continue to build models to analyze two alternative traffic rules---the \rule and the \Driving & Free Overtaking\rule. Finally, we propose two possible rules to optimize traffic flow when equipped with an intelligent system. The results of our models are as follows:

??“Keep-Right-Except-to-Pass” Rule

According to our model, traffic flow and safety index first rise to peak value then decrease to zero with increasing vehicle density, while energy flow keeps rising but with a bating speed. Furthermore, under-posted and over-posted speed limits relative to our calculated optimal maximum velocity have different influences during light and heavy traffic. In addition, our model could be transferred in left-handed countries with a single change of orientation.

??Alternative Traffic Rules

The \superior (to the \ these two rules will have strengthening effects especially on heavy-traffic freeways.

Team#29911 Page 32 of 40

??Intelligent System Control

An ideal online algorithm is discussed, and a \is simulated and proves to be beneficial to enlarge traffic flow.

8 References

[1] Peilin Li, \Globalization and the 'Left-Most' Policy of Automobiles\ Financial Introduction, Vol.8, 2004.

[2] Chowdhury, D., Wolf, D. E., & Schreckenberg, M. (1997). Particle hopping models for two-lane traffic with two kinds of vehicles: Effects of lane-changing rules. Physica A: Statistical Mechanics and its Applications, 235 (3), 417-439.

[3] Giordano, Frank R. A first course in mathematical modeling. Cengage Learning, 2013. [4] Haijun Huang · Tieqiao Tang · Ziyou Gao:Continuum modeling for two-lane traffic flow, Acta Mech Sinica (2006) 22: 131–137.

[5] Tang Chang-Fu, Jiang Rui, Wu Qing-Song:Extended speed gradient model for traffic flow on two-lane freeways. Chinese Physics, 2007/16(06) [6] Lee H Y, Lee H W and Kim D 1999 Phys. Rev. E 59 5101 [7] Nagel K and Schreckenberg M 1992 J. Phys. I 2 2221 [8] Kerner B S and Konsh ?auser P 1993 Phys. Rev. E 48 2335

[9] Fu C J, Wang B H, Yin C Y and Gao K 2006 Acta Phys.Sin. 55 4032

9 Appendix

C++ Source Code for Monte Carlo Simulation: gen.h: ??#ifndef __GEN #define __GEN #include #include #include #include #include #include using namespace std; /* #define RATIO 0.3 #define L 512 #define VMAX 7 Team#29911 Page 33 of 40

#define VBASE 2 */ int random(int low, int high){ return (rand()%(high-low+1)+low); } void gen(const char *fpath, int L, double den, int Vmax0, int Vmax1, double Pv){ FILE *fp = fopen(fpath, \); int n=den*L; vector a; for (int i = 0; i < L && a.size() < n; i ++) if (R((n-a.size())*1.0/(L-i)) || a.size()+L-i <= n) a.push_back(i); assert(a.size() == n); fprintf(fp, \, L, n); int v; for (int i = 0; i < n; i ++){ v=R(Pv)?Vmax0:Vmax1; fprintf(fp, \, a[i], v, random(v/2, v)); } fclose(fp); } #endif // __GEN SaveBMP.h: #ifndef __BMP #define __BMP FILE *SaveBmp(const char* filename,int height,int width){ unsigned int w = ((width+7)/8+3)/4*4; unsigned int size = w*height+0x3E; unsigned short head[]={ 0x4D42,size&0xffff,size>>16,0,0,0x3E,0,0x28, 0,width&0xffff,width>>16,height&0xffff,height>>16,1,1,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0xffff, 0x00ff }; FILE* fp=fopen(filename,\); if(!fp)return NULL; fwrite(head,1,sizeof(head),fp); return fp; } #endif lane.h: #ifndef __LANE Team#29911 Page 34 of 40

#define __LANE #include #include #include #include #include #include #include #include #include #define out(x) cout<<(#x)<<\<=n?(i)-n:((i)<0?(i)+n:(i))) #define fm(i) ((i)>=m?(i)-m:((i)<0?(i)+m:(i))) #define fL(x) ((x)>=L?(x)-L:((x)<0?(x)+L:(x))) #define takemin(x, y) x=(x)<(y)?(x):(y) unsigned char buf[10000]; struct lane{ vector c; int cnt[7]; int tot() const { int tot=0; for(int i=0; i<7; i++) Team#29911 Page 35 of 40

tot+=cnt[i]; return tot; } car &operator[](int i){return c[i];} lane(const char *fpath){ memset(cnt, 0, sizeof cnt); FILE *fp = fopen(fpath, \); int n, t; fscanf(fp, \, &L, &n, &t); c.resize(n); for(int i=0; i= c[i].v); cnt[c[i].v]++; } fclose(fp); } lane(){} bool OK() const { for(int i=0; i=L)return false; for(int i=0; i+1= c[i+1].x)return false; if (tot() != c.size()) return false; return true; } int size() const { return c.size(); } int advance(vector &t){ int n; t.resize(n = c.size()); if(n==0)return 0; for(int i=0; i DXf) t[i].v = DXf; if (t[i].v > 0 && R(Pd)) t[i].v--; t[i].x = fL(t[i].x + t[i].v); if (t[i].v > c[i].v) ECost += t[i].v+c[i].v; } if(t[n-1].x

for(int i=1; i>1); if(i&0xff)buf[i>>3]=tmp; } fwrite(buf, 1, ll/8, fp); } }; #endif CA.cpp: #include #include \ #include \ #include \ lane l[2]; int cnt[2]; char VPATH[200]; bool rule_s(lane &l0, lane &l1, int i, int j, int DXf) { int m = l1.size(); if (m==0) return DXf > 1; int k = fm(j-1); if(DXf > 1 && l1[j].x != l0[i].x && //! no parralel car fL(l0[i].x - l1[k].x) > min(l1[k].v+1, l1[k].vmax)) //! no accident in the other lane return 1; Team#29911 Page 37 of 40

return 0; } bool rule0(lane &l0, lane &l1, int i, int j, int DXf) { int m = l1.size(); if (m==0) return DXf < l0[i].vmax; if(DXf < l0[i].vmax){ //! Not enough space in this lane int k = fm(j-1); if(fL(l1[j].x - l0[i].x) > DXf) //! More space in the other lane if (R(Pc)) return 1; } return 0; } bool rule1(lane &l0, lane &l1, int i, int j, int DXf) { if (l1.size() == 0) return R(Pc); return R(Pc) && (fL(l1[j].x - l0[i].x)> min(l0[i].v+1, DXf)); //! Enough or more space in the other lane } int median(int *c0, int *c1){ int cnt[7]; for(int i=0; i<7; i++) cnt[i] = c0[i] + c1[i]; int tot = 0; for(int i=0; i<7; i++) tot += cnt[i]; tot /= 2; for(int i=0; tot>0 && i<7; i++){ tot -= cnt[i]; if (tot<=0) return i; } return 6; } void chLaneSim(lane &l0, lane &l1, vector &t0, vector &t1, int dir){ int n=l0.size(), m=l1.size(), j=0; t0.clear(); t1.clear(); bool flag = 1; if(!n){ swap(t0, l0.c); return; } for(int i=0; i

for(; flag && jVmedian ? 1 : (l0[i].v==Vmedian?R(0.5):0); rule = (dir<<1) + ((RULE&32) ? ff : (l0[i].vmax==Vmax0)); //! 0: l->r slow, 1: l->r fast rule = (RULE>>rule) & 1; //! 2: r->l slow, 3: r->l fast switch(rule){ //! two_car: 1001=9, sym: 0000, sym_two_lane: 1100=12 case 0: chLane = chLane && rule0(l0, l1, i, j, DXf); break; case 1: chLane = chLane && rule1(l0, l1, i, j, DXf); break; default: break; } if(chLane)t1.push_back(l0[i]); else t0.push_back(l0[i]); } } void sim(lane &l0, lane &l1){ vector t00, t01, t10, t11; chLaneSim(l0, l1, t00, t01, 0); chLaneSim(l1, l0, t11, t10, 1); vector t0, t1; t0.resize(t00.size() + t10.size()); t1.resize(t01.size() + t11.size()); merge(t00.begin(), t00.end(), t10.begin(), t10.end(), t0.begin()); merge(t01.begin(), t01.end(), t11.begin(), t11.end(), t1.begin()); swap(t0, l0.c); swap(t1, l1.c); cnt[0] += l0.advance(t0); cnt[1] += l1.advance(t1); } double func(int dx, int v){ if(v==0)return 0; else return exp(-dx/v); } double cal_safety(lane &l){ double res=0; if(l.size()==0)return 0; for(int i=0; i+1

void gao() { l[0] = lane(\); l[1] = lane(\); FILE *fout0, *fout1; if(VISUALIZE){ fout0 = SaveBmp((string(VPATH)+\).c_str(), T, L); fout1 = SaveBmp((string(VPATH)+\).c_str(), T, L); } int t; if(VISUALIZE) t=0; else t=T/5; while (t--) sim(l[0], l[1]); t = T; cnt[0] = cnt[1] = 0; AlphaSafety = 0; ECost = 0; while (t--) { sim(l[0], l[1]); l[0].OK(); l[1].OK(); if(VISUALIZE){ l[0].pos(fout0); l[1].pos(fout1); } AlphaSafety+=cal_safety(l[0])+cal_safety(l[1]); } AlphaSafety/=l[0].size()+l[1].size(); AlphaSafety/=T; //printf(\ if(VISUALIZE){ fclose(fout0); fclose(fout1); } } pair stat(vector &a){ assert(a.size()>=2); double mean=0; for(int i=0; i

} int main() { srand(time(0)); FILE *fin = fopen(\, \); FILE *fout = fopen(\, \); if (fin == NULL || fout == NULL) return -1; int sum=0; double den=0; fgets((char *)buf, 10000, fin); while(1){ if(fscanf(fin, \, &L, &T, &den, &Pd, &Pc, &Pv, &Vmax0, &Vmax1, &VISUALIZE, &RULE, VPATH)!=11){ break; } fprintf(fout, \, L, T, den, Pd, Pc, Pv, Vmax0, Vmax1, RULE); vector q[2], AlphaS, EC; int REP = VISUALIZE?2:20; for(int i=0; i t0 = stat(q[0]), t1 = stat(q[1]), t2 = stat(AlphaS), t3 = stat(EC); fprintf(fout, \, t0.first, t0.second, t1.first, t1.second, t2.first, t2.second, t3.first, t3.second); } fclose(fout); fclose(fin); }

2014年美国大学生数学建模MCM-A题-O奖论文29911 - 图文

Team#29911Page1of40TeamControlNumberForofficeuseonlyT1________________T2________________T3________________T4________________29911ProblemC
推荐度:
点击下载文档文档为doc格式
0r40a0d5mn7s7tu43p391qw0b8cv4600t2b
领取福利

微信扫码领取福利

微信扫码分享