道路两点间最优化行驶方案管理(国外英文资料).docVIP

道路两点间最优化行驶方案管理(国外英文资料) 1. problem description A road network in a region, shown in Figure 1, is exactly the same for each road class. For a certain period of time, there are N vehicles from node 1, and the destination is node 0 (assuming that there are no other vehicles in the network in that time period). During this time period, the more vehicles passing through the road section, the slower the vehicle will travel in the road. (1) determine the effective travel path and its algorithm; (2) determine the number of vehicles passing on each path, so that the total travel time of the N vehicle from node 1 to node 0 is minimal. Fig. 1 road network diagram of a region Note: the length of the transverse section is 2 times longer than the length of the longitudinal section 2.. A preliminary analysis of the problem The problem is a single objective nonlinear programming problem. We need to consider the whole road network system to find the minimum total travel time. The main difficulties are the following: (1) the vehicle flow and the vehicle speed influence each other, and the traffic on each road will also be affected by the road ahead. Therefore, it is difficult to determine the maximum flow on each road. The network maximum flow model can not be used to solve the problem. (2) how to determine the influence of speed and traffic flow on the trip time of the whole system, thus obtaining the constraint conditions. (3) it is very complicated to solve nonlinear programming. Can the computer give the exact optimal solution?. We first consider the nonlinear programming model of the problem and try to solve it with Lingo programming. 3. model hypothesis Based on the problem solving process, the following assumptions are made: The maximum speed of the vehicle is 120km/h. The length of the longitudinal section is 10km. The maximum vehicle density per kilometer is 200 /km. Source 1 is the maximum traffic to the two road departure. No overtaking is allowed on the road without cross