TITLE
Abstract:
Key words:
Team # 4488 Page 2 of 9
Contents
1. Introduction...................................................................................................................................................3
1.1 Why does toll way collects toll? ………………………………………….…………………….3
1.2 Toll modes………………………………………………………………………………………………3
1.3 Toll collection methods……………………………………………………………………….……3
1.4 Annoyance in toll plazas………………………………………….………….…………………….3
1.5 The origin of the toll way problem……………………...……………………………………...3
1.6 Queuing theory…………………………………………………………………………………...…...4
2. The Description of Problem….............................................................................................................5
2.1 How do we approximate the whole course of ? ............................................5
2.2 How do we define the optimal configuration? ........................…………….………….5
2.2.1 From the perspective of …………………………………….………………….5
2.2.2 From the perspective of the …………………………………………………6
2.2.3 Compromise…………………………………...……………………………………...………..6
2.3 Overall optimization and local optimization……………………………..……………….…6
2.4 The differences in weights and sizes of ………………………………………..…7
2.5 What if there is no data available? ..............................................................................................7
3. Models……………...........................................................................................................................................7
3.1 Basic Model.............................................................................................................................................7
3.1.1 Symbols and Definitions………………………………..…...……………………………...7
3.1.2 Assumptions……………………………………………………………….……..……………..8
3.1.3 The Foundation of Model………………………………………………………………….9
3.1.4 Solution and Result……………………………………………………………….………...11
3.1.5 Analysis of the Result……………………………………………….………………………..……….….11
3.1.6 Strength and Weakness………………………………………………….…………….…..13
3.2 Improved Model.................................................................................................14
3.2.1 Extra Symbols……………………………………..………………………...…………………......................14
3.2.2 Additional Assumptions………………………………………………...…..…………………………..14
3.2.3 The Foundation of Model………………………………..…………………………………………….14
3.2.4 Solution and Result………………………………………….……………………………..……………...15
3.2.5 Analysis of the Result…………………………………………….……………………..…………….….18
3.2.6 Strength and Weakness……………………………………………….……………….…..19
4. Conclusions..................................................................................................................................................19
4.1 Conclusions of the problem……………………………………..……………..19
4.2 Methods used in our models…………………………………...……………………..…………19
4.3 Application of our models…………………………………………………..………………..….19
5. Future Work..............................................................................................................................................19
5.1 Another model………………………………………………………………………………………19
5.2 Another layout of ………………………………………………………..……………23
5.3 The newly- adopted methods………………………………………..……………23 6. References...................................................................................................................................................23 7. Appendix......................................................................................................................................................23 Programs and codes………………………………………………………………..……………………24
Team # 4488 Page 3 of 9
I. Introduction
In order to indicate the origin of problems, the following background is worth mentioning.
1.1
1.2
1.3
1.4
1.5
1.6
II. The Description of the Problem
2.1 How do we approximate the whole course of
?
?
?
?
2.2 How do we define the optimal configuration?
1) From the perspective of :
2) From the perspective of the :
3) Compromise:
?
Team # 4488 Page 4 of 9
2.3 The local optimization and the overall optimization
?
?
? Virtually:
2.4 The differences in weights and sizes of
2.5 What if there is no data available?
III. Models
3.1 Basic Model
3.1.1 Terms, Definitions and Symbols
The signs and definitions are mostly generated from queuing theory.
?
?
?
?
?
3.1.2 Assumptions
?
?
?
?
?
Team # 4488 Page 5 of 9
3.1.3 The Foundation of Model
1) The utility function
? The cost of :
? The loss of :
? The weight of each aspect:
? Compromise:
2) The integer programming
According to theory, we can calculate the statistical properties as follows.
3) The overall optimization and the local optimization
? The overall optimization:
? The local optimization:
? The optimal number of :
3.1.4 Solution and Result
1) The solution of the integer programming:
2) Results:
3.1.5 Analysis of the Result
? Local optimization and overall optimization:
? Sensitivity: The result is quite sensitive to the change of the three
parameters
? Trend:
? Comparison:
3.1.6 Strength and Weakness
? Strength: In despite of this, the model has proved that . Moreover, we
have drawn some useful conclusions about . The model is fit for, such as ? Weakness: This model just applies to . As we have stated, . That’s
just what we should do in the improved model.
3.2 Improved Model
Team # 4488 Page 6 of 9
3.2.1 Extra Symbols
Signs and definitions indicated above are still valid. Here are some extra signs and definitions.
?
?
?
?
3.2.2 Additional Assumptions
?
?
? Assumptions concerning the process are the same as the Basic Model.
3.2.3 The Foundation of Model
1) How do we determine the optimal number?
As we have concluded from the Basic Model,
3.2.4 Solution and Result
1) Simulation algorithm
Based on the analysis above, we design our simulation arithmetic as follows.
? Step1:
? Step2:
? Step3:
?
?
?
?
?
? Step9:
2) Flow chart
The figure below is the flow chart of the simulation. Step4: Step5: Step6: Step7: Step8:
Team # 4488 Page 7 of 9
3) Solution
3.2.5 Analysis of the Result
3.2.6 Strength and Weakness
? Strength: The Improved Model aims to make up for the neglect of .
The result seems to declare that this model is more reasonable than the Basic Model and much more effective than the existing design.
? Weakness: . Thus the model is still an approximate on a large scale. This
has doomed to limit the applications of it.
IV. Conclusions
4.1 Conclusions of the problem
?
?
?
4.2 Methods used in our models
?
?
?
4.3 Applications of our models
?
?
?
V. Future Work
5.1 Another model
Team # 4488 Page 8 of 9
5.1.1 The limitations of queuing theory
5.1.2
5.1.3
5.1.4
1)
?
?
?
?
2)
?
?
?
3)
?
?
?
4)
5.2 Another layout of
Team # 4488 Page 9 of 9
5.3 The newly- adopted charging methods
[1]
[2]
[3]
[4]
VI. References VII. Appendix