A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result...A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result in more serious congestion.On the other hand,a low-frequency bus service would increase the waiting time for passengers and would not reduce the use of private cars.It is important to strike a balance between high and low frequencies in order to minimize the total delays for all road users.It is critical to formulate the impacts of bus frequency on congestion dynamics and mode choices.However,as far as the authors know,most proposed bus frequency optimization formulations are based on static demand and the Bureau of Public Roads function,and do not properly consider the congestion dynamics and their impacts on mode choices.To fill this gap,this paper proposes a bi-level optimization model.A three-dimensional Macroscopic Fundamental Diagram based modeling approach is developed to capture the bi-modal congestion dynamics.A variational inequality model for the user equilibrium in mode choices is presented and solved using a double projection algorithm.A surrogate model-based algorithm is used to solve the bi-level programming problem.展开更多
This paper investigates the dynamical behaviour of network traffic flow. Assume that trip rates may be influenced by the level of service on the network and travellers are willing to take a faster route. A discrete dy...This paper investigates the dynamical behaviour of network traffic flow. Assume that trip rates may be influenced by the level of service on the network and travellers are willing to take a faster route. A discrete dynamical model for the day-to-day adjustment process of route choice is presented. The model is then applied to a simple network for analysing the day-to-day behaviours of network flow. It finds that equilibrium is arrived if network flow consists of travellers not very sensitive to the differences of travel cost. Oscillations and chaos of network traffic flow are also found when travellers are sensitive to the travel cost and travel demand in a simple network.展开更多
Traffic congestion is widely distributed around a network. Generally, to analyze traffic congestion, static traffic capacity is adopted. But dynamic characteristics must be studied because congestion is a dynamic proc...Traffic congestion is widely distributed around a network. Generally, to analyze traffic congestion, static traffic capacity is adopted. But dynamic characteristics must be studied because congestion is a dynamic process. A Dynamic Traffic Assignment modeling fundamental combined with an urban congestion analysis method is studied in this paper. Three methods are based on congestion analysis, and the stochastic user optimal DTA models are especially considered. Correspondingly, a dynamic system optimal model is suggested for responding congestion countermeasures and an ideal user optimal model for predicted congestion countermeasure respectively.展开更多
Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes w...Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.展开更多
A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal mult...A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment volumes.Besides,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.展开更多
The identification and selection of performance measures play an important role in any decision making process. Additionally, millions of dollars are spent on appropriate planning and identification of prospective pro...The identification and selection of performance measures play an important role in any decision making process. Additionally, millions of dollars are spent on appropriate planning and identification of prospective projects for improvements. As a result, current practitioners spend a lot of time and money in prioritizing their limited resources. This research proposes two tasks: 1) estimation of performance measures using a simulation based on dynamic traffic assignment model, and 2) development of a methodology to evaluate multiple projects based on benefit-cost analysis. The model, DynusT, is used for the Las Vegas roadway network during the morning peak time period. A comparative analysis of the results from proposed methodology with existing California Benefit-Cost (Cal-B/C) models is presented. The results indicate that the new methodology provides an accurate benefit-cost ratio of the projects. In addition, it signifies that the existing Cal-B/C models underestimate the benefits associated with the prospective project improvements. The major contribution of this research is the simultaneous estimation of the performance measures and development of a methodology to evaluate multiple projects. This is helpful to decision makers to rank and prioritize future projects in a cost-effective manner. Planning and operational policies for the transportation systems can be developed based on the gained insights from this study.展开更多
As an important role in the development of ITS, traffic assignment forecast is always the research focus. Based on the analysis of classic traffic assignment forecast models, an improved traffic assignment forecast mo...As an important role in the development of ITS, traffic assignment forecast is always the research focus. Based on the analysis of classic traffic assignment forecast models, an improved traffic assignment forecast model, multi-ways probability and capacity constraint (MPCC) is presented. Using the new traffic as- signment forecast model to forecast the traffic volume will improve the rationality and veracity of traffic as- signment forecast.展开更多
Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case wh...Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case where channels in distinct frequency bands are assigned to mesh access and backbone, but actually backbone network and access network can use the same IEEE 802.11 technology. Besides, these channel assignment schemes only utilize orthogonal channels to perform channel assignment, and the resulting network interference dramatically degrades network performance. Moreover, Internet-oriented traffic is considered only, and peerto-peer traffic is omitted, or vice versa. The traffic type does not match the practical network. In this paper, we explore how to exploit partially overlapped channels to perform endto-end channel assignment in order to achieve effective end-to-end flow transmissions. The proposed flow-based end-to-end channel assignment schemes can conquer the limitations aforementioned. Simulations reveal that loadaware channel assignment can be applied to networks with stable traffic load, and it can achieve near-optimal performance; Traffic-irrelevant channel assignment is suitable for networks with frequent change of traffic load,and it can achieve good balance between performance and overhead. Also, partially overlapped channels' capability of improving network performance is situation-dependent, they should be used carefully.展开更多
In the paper, multipeth traffic assignment model is improved, a quick aI8orithm,Nede Assignment Algorithm, of this medel is presented, and some problems such as dispolof network, arransement of assigned nodes and dete...In the paper, multipeth traffic assignment model is improved, a quick aI8orithm,Nede Assignment Algorithm, of this medel is presented, and some problems such as dispolof network, arransement of assigned nodes and determination of parameters are discussed展开更多
Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basi...Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basis of symmetrical link travel time function (or deterrence).Its uniqueness and equivalance to the Wardropian principle of UE are also proved.Finally,we give the algorithm of model.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.72201088,71871077,71925001)the Fundamental Research Funds for the Central Universities of China(Grant No.PA2022GDSK0040,JZ2023YQTD0073),which are gratefully acknowledged.
文摘A properly designed public transport system is expected to improve traffic efficiency.A high-frequency bus service would decrease the waiting time for passengers,but the interaction between buses and cars might result in more serious congestion.On the other hand,a low-frequency bus service would increase the waiting time for passengers and would not reduce the use of private cars.It is important to strike a balance between high and low frequencies in order to minimize the total delays for all road users.It is critical to formulate the impacts of bus frequency on congestion dynamics and mode choices.However,as far as the authors know,most proposed bus frequency optimization formulations are based on static demand and the Bureau of Public Roads function,and do not properly consider the congestion dynamics and their impacts on mode choices.To fill this gap,this paper proposes a bi-level optimization model.A three-dimensional Macroscopic Fundamental Diagram based modeling approach is developed to capture the bi-modal congestion dynamics.A variational inequality model for the user equilibrium in mode choices is presented and solved using a double projection algorithm.A surrogate model-based algorithm is used to solve the bi-level programming problem.
文摘This paper investigates the dynamical behaviour of network traffic flow. Assume that trip rates may be influenced by the level of service on the network and travellers are willing to take a faster route. A discrete dynamical model for the day-to-day adjustment process of route choice is presented. The model is then applied to a simple network for analysing the day-to-day behaviours of network flow. It finds that equilibrium is arrived if network flow consists of travellers not very sensitive to the differences of travel cost. Oscillations and chaos of network traffic flow are also found when travellers are sensitive to the travel cost and travel demand in a simple network.
文摘Traffic congestion is widely distributed around a network. Generally, to analyze traffic congestion, static traffic capacity is adopted. But dynamic characteristics must be studied because congestion is a dynamic process. A Dynamic Traffic Assignment modeling fundamental combined with an urban congestion analysis method is studied in this paper. Three methods are based on congestion analysis, and the stochastic user optimal DTA models are especially considered. Correspondingly, a dynamic system optimal model is suggested for responding congestion countermeasures and an ideal user optimal model for predicted congestion countermeasure respectively.
基金Projects(70631002,70701027) supported by the National Natural Science Foundation of ChinaProject(NCET-08-0406) supported by the Program for New Century Excellent Talents in Chinese University
文摘Key tactics of origin-based user equilibrium (OUE) algorithm was studied,which involved the algorithm procedure and several implementation issues.To speed up the convergence,update policies of flows,costs and bushes were proposed.The methods of step-size searching and bush construction are proved to be practical.The modified OUE algorithm procedure was also optimized to take the advantage of multi-thread process.Convergence performances were compared with those of other algorithms by different sizes of urban transportation networks.The result shows this modified OUE algorithm is more efficient and consumes less time to achieve the reasonable relative gap in practical applications.
基金The Project Supported by National Natural Science Foundation of China
文摘A “Random Shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment model.It is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment volumes.Besides,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.
文摘The identification and selection of performance measures play an important role in any decision making process. Additionally, millions of dollars are spent on appropriate planning and identification of prospective projects for improvements. As a result, current practitioners spend a lot of time and money in prioritizing their limited resources. This research proposes two tasks: 1) estimation of performance measures using a simulation based on dynamic traffic assignment model, and 2) development of a methodology to evaluate multiple projects based on benefit-cost analysis. The model, DynusT, is used for the Las Vegas roadway network during the morning peak time period. A comparative analysis of the results from proposed methodology with existing California Benefit-Cost (Cal-B/C) models is presented. The results indicate that the new methodology provides an accurate benefit-cost ratio of the projects. In addition, it signifies that the existing Cal-B/C models underestimate the benefits associated with the prospective project improvements. The major contribution of this research is the simultaneous estimation of the performance measures and development of a methodology to evaluate multiple projects. This is helpful to decision makers to rank and prioritize future projects in a cost-effective manner. Planning and operational policies for the transportation systems can be developed based on the gained insights from this study.
文摘As an important role in the development of ITS, traffic assignment forecast is always the research focus. Based on the analysis of classic traffic assignment forecast models, an improved traffic assignment forecast model, multi-ways probability and capacity constraint (MPCC) is presented. Using the new traffic as- signment forecast model to forecast the traffic volume will improve the rationality and veracity of traffic as- signment forecast.
基金supported by the National Natural Science Foundation of China under Grants No.61373124
文摘Capacity reduction is a major problem faced by wireless mesh networks. An efficient way to alleviate this problem is proper channel assignment. Current end-toend channel assignment schemes usually focus on the case where channels in distinct frequency bands are assigned to mesh access and backbone, but actually backbone network and access network can use the same IEEE 802.11 technology. Besides, these channel assignment schemes only utilize orthogonal channels to perform channel assignment, and the resulting network interference dramatically degrades network performance. Moreover, Internet-oriented traffic is considered only, and peerto-peer traffic is omitted, or vice versa. The traffic type does not match the practical network. In this paper, we explore how to exploit partially overlapped channels to perform endto-end channel assignment in order to achieve effective end-to-end flow transmissions. The proposed flow-based end-to-end channel assignment schemes can conquer the limitations aforementioned. Simulations reveal that loadaware channel assignment can be applied to networks with stable traffic load, and it can achieve near-optimal performance; Traffic-irrelevant channel assignment is suitable for networks with frequent change of traffic load,and it can achieve good balance between performance and overhead. Also, partially overlapped channels' capability of improving network performance is situation-dependent, they should be used carefully.
文摘In the paper, multipeth traffic assignment model is improved, a quick aI8orithm,Nede Assignment Algorithm, of this medel is presented, and some problems such as dispolof network, arransement of assigned nodes and determination of parameters are discussed
文摘Considering characteristics of Chinese urban mixed traffic,the author develops a combinatorial model involving the mixed deterministic traffic volume distribution and user's equilibrium (UE) assignment on the basis of symmetrical link travel time function (or deterrence).Its uniqueness and equivalance to the Wardropian principle of UE are also proved.Finally,we give the algorithm of model.