高速公路行车时间的估计A1(英文）

2005年全国部分高校研究生数学建模竞赛A题A: Highway Traveling time Estimate and Optimal RoutingHighway traveling time estimate is crucial to travelers. Hence, detectors are mounted on some of the US highways. For instance, detectors are mounted on every two-way six-lane highways of San Antonio city. However, since vehicles tend to change lanes from time to time, we may ignore vehicle lane change and consider just one lane traffic as shown below, in which the square boxes stand for detectors. 636 m 417 m 522 m 475 m travel direction Detector 1 Detector 2 Detector 3 Detector 4 Detector 51. Detectors are able to detect and measure the speed of individual vehicles 24 hours a day. Average vehicle speed measured within 20 seconds by detectors is reported and refreshed. The following table provides the real time data (due to the huge volume of traffic data, only traffic data of the last 20 seconds in every two minutes is in the last 20 seconds. Unit: mile/hour). Please analyze traveling characteristics on highways (for instance, congestion and its dispersion. Typically, it is not considered as congestion if traffic speed is higher than 50 mile/hr). If a vehicle passes the detector at time t, how long will it take for this vehicle to travel to the fifth sensor? Please design an algorithm for estimating such travel times. Make sure that you demonstrate the rationality and accuracy of your algorithm. If traffic data is provided every 20 seconds rather than every 2 minutes, how this information is going to affect your estimate? All the conditions stay the same as in the previous problem. If detectors can measure not only vehicle speed, but also traffic volume per unit time (see table below. The unit of Flow is the number of cars/20 seconds), does this additional information help to improve the rationality and accuracy of your algorithm? If your answer is yes, please re-design your algorithm.TimeSensor 1Sensor 2Sensor 3Sensor 4Sensor 5SpeedFlowSpeedFlowSpeedFlowSpeedFlowSpeedFlow3:40:07 PM5710549.7628.92010.7585.93:42:07 PM629.56811.46313.621105912.23:44:07 PM5611.16210.36112.91914.2608.13:46:07 PM5812.5619.1599.32314.861103:48:07 PM5311.8646.76212.34595910.13:50:07 PM589.3666.4634.563105613.83:52:07 PM5511.96313609.25511.459183:54:07 PM598625.3639.7651155113:56:07 PM529.8739.7568.365862123:58:07 PM6014.16313.75912665.16154:00:07 PM554.86412.36112.8655.159114:02:07 PM6013.7617.96012.66511.16604:04:07 PM598.7629.1604.16410.657144:06:07 PM588648.36414.545759144:08:07 PM555.46315.3631619.35774:10:07 PM6213.7619.1575.41511.56484:12:07 PM599.9636.7625646.152144:14:07 PM588.563126211.9408.760104:16:07 PM568.35896013.76111.558134:18:07 PM609.36410.3651052105194:20:07 PM5910.4669.96854514.75515.94:22:07 PM5314568.66385513.74012.74:24:07 PM57136213.5621329145411.94:26:07 PM5813.46411.5631462133012.94:28:07 PM558.36211.35812810.93311.94:30:07 PM59117886113395.15110.14:32:07 PM5917.16711.861115711.95916.94:34:07 PM547.36410.659962106011.14:36:07 PM5912667.8685.16210278.34:38:07 PM5611.76810.4608208.24913.94:40:07 PM578.46011.26514.937115111.14:42:07 PM5510.46312.3666409.94514.24:44:07 PM5912.1659.2626.9498.85114.64:46:07 PM4913.46911.5668.1547.8209.24:48:07 PM5111.866146110.22114.43012.34:50:07 PM5311.66014.76210.125.53411.94:52:07 PM5313.86212.2509.22112367.54:54:07 PM4914.35912.75910.153.83814.84:56:07 PM5313.56213.656113813.22610.14:58:07 PM5512.86212.85711238.23713.85:00:07 PM5611.962135710.1414.834115:02:07 PM567.6639.7598.9211.92811.65:04:07 PM606.66514.76414479.12910.85:06:07 PM5511.96311667.63612.9289.85:08:07 PM5910.26586094012.13714.35:10:07 PM608.26411669.22614.82912.25:12:07 PM608.7645.6647.5139.43813.25:14:07 PM5513.1628.4665.9638.234125:16:07 PM5615.55712.461106110.827135:18:07 PM5613.3635.5646.1237.9179.45:20:07 PM5713.157126511.948.814105:22:07 PM51146010.9597.549.2196.45:24:07 PM4812.5598.92791782195:26:07 PM4611.6577.428.957.8289.75:28:07 PM5212.45312268.938.5267.95:30:07 PM5712.64210.6127.838.5188.25:32:07 PM5114.43811.6108.527.9197.85:34:07 PM5111.4194.7219.2228.3335.65:36:07 PM5312.4143.712526.8429.75:38:07 PM4010.2138.327.537.44010.35:40:07 PM397.9146.427.529.3389.65:42:07 PM4210.48728.329.7449.45:44:07 PM465.846.425.637.73811.35:46:07 PM446.985.398.159.74710.75:48:07 PM388.376.777.81211.32411.15:50:07 PM458.647.72210310298.35:52:07 PM429359.42711.148.7258.15:54:07 PM427.8387.435.42211118.75:56:07 PM438.5568.6269.749166.15:58:07 PM459.4596.3238.319157.76:00:07 PM4210638.742898.6209.66:02:07 PM4010.46210.5389206.52676:04:07 PM439.7618.8144.417.1256.66:06:07 PM4210.3599.9216.128119.46:08:07 PM4110599.286.4117.9107.86:10:07 PM359.4669.5299.727.6148.46:12:07 PM535.760103910.858.623106:14:07 PM5746510.5398.819.2117.66:16:07 PM527.3648.5558.639.6410.66:18:07 PM543.3664.6516.229.64116:20:07 PM5510.6626.9624.848.9396:22:07 PM532644.8607.254.949.96:24:07 PM617.56612.16211.4726.249.56:26:07 PM586.7656.7613.8638.849.66:28:07 PM576.1696.6674457.5128.96:30:07 PM586.3646.2626.4345.2367.36:32:07 PM575.3664.8616.7586.42410.56:34:07 PM589624.4696.4455.75312.56:36:07 PM594.4712.4705.8158.96366:38:07 PM584644.9644.198.26566:40:07 PM604.6700.668267.6595.46:42:07 PM606.4624.6643.7286.9645.56:44:07 PM571.6658667.6446.6594.16:46:07 PM558.8643.6724.1556.2626.66:48:07 PM585.7669.4626.5403.2642.96:50:07 PM596.2622.4676520.56576:52:07 PM617.3663.1664581.2667.76:54:07 PM596.7696.1647641.9648.86:56:07 PM643.5694.8627595.3626.36:58:07 PM644.2683.9574.5364.4644.1 The first figure is a city map of San Antonio in Texas, the United States. The second one is a map reflecting traffic condition in San Antonio. Travelers can input their locations and destinations into an on-board in-vehicle navigation system so that the system will help to select a driving route and estimate the traveling time. Unfortunately, due to the uncertainty in traffic time of each link (road between two nodes, nodes can be treated as intersections), the existing system has a poor performance in terms of providing an optimal (fastest) route and a reliable travel time estimate. Can you improve the system based on question 1? 1. Provided link travel times are mutually independent random variables. Please design an algorithm for the system to address optimal route selec