1、队员3： 参赛队教练员 （签名）： 无编 号 专 用 页参赛队伍的参赛队号：（请各个参赛队提前填写好）：竞赛统一编号（由竞赛组委会送至评委团前编号）：竞赛评阅编号（由竞赛评委团评阅前进行编号）：TITLEAbstract: Key words:Contents1. Introduction.3 1.1 Why does toll way collects toll? .3 1.2 Toll modes3 1.3 Toll collection methods.3 1.4 Annoyance in toll plazas.31.5 The origin of the toll way probl
2、em.31.6 Queuing theory.42. The Description of Problem.5 2.1 How do we approximate the whole course of ? .52.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.62.3 Overall optimization and local optimization.62.4 The
3、 differences in weights and sizes of .72.5 What if there is no data available? .73. Models.73.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.133.2 Improved Mo
4、del.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.194. Conclusions.19 4.1 Conclusions of the problem.194.2 Methods used in our models.19 4.3 Application of our models
5、.195. Future Work.19 5.1 Another model19 5.2 Another layout of .23 5.3 The newly- adopted methods.236. References.237. Appendix.23 Programs and codes.24I. IntroductionIn 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
6、 of the Problem2.1 How do we approximate the whole course of ? 1） From the perspective of :2） From the perspective of the :3） Compromise:2.3 The local optimization and the overall optimization Virtually:2.4 The differences in weights and sizes of III. Models3.1 Basic Model3.1.1 Terms, Definitions an
7、d SymbolsThe signs and definitions are mostly generated from queuing theory. 3.1.2 Assumptions3.1.3 The Foundation of Model1） The utility function The cost of : The loss of : The weight of each aspect: Compromise: 2） The integer programmingAccording to theory, we can calculate the statistical proper
8、ties 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 Result1） The solution of the integer programming:2） Results:3.1.5 Analysis of the Result Local optimization and overall optimization: Sen
9、sitivity: 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 applie
10、s to . As we have stated, . Thats just what we should do in the improved model.3.2 Improved Model3.2.1 Extra SymbolsSigns 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 Bas
11、ic Model.3.2.3 The Foundation of Model1） How do we determine the optimal number?As we have concluded from the Basic Model, 3.2.4 Solution and Result1） Simulation algorithmBased on the analysis above, we design our simulation arithmetic as follows. Step1: Step2: Step3: Step4: Step5: Step6: Step7: Ste
12、p8: Step9:2） Flow chartThe figure below is the flow chart of the simulation.3） Solution3.2.5 Analysis of the Result3.2.6 Strength and Weakness 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 eff
13、ective than the existing design. . Thus the model is still an approximate on a large scale. This has doomed to limit the applications of it. IV. Conclusions4.1 Conclusions of the problem4.2 Methods used in our models4.3 Applications of our modelsV. Future Work5.1 Another model5.1.1 The limitations of queuing theory5.1.2 5.1.3 5.1.4 1） 2） 3） 4） 5.2 Another layout of 5.3 The newly- adopted charging methodsVI. References1 2 3 4 VII. Appendix
