نتایج جستجو برای: based traffic assignment

تعداد نتایج: 3023915  

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

Journal: :CoRR 2018
Paul Waddell Geoff Boeing Max Gardner Emily Porter

Integrating land use, travel demand, and traffic models represents a gold standard for regional planning, but is rarely achieved in a meaningful way, especially at the scale of disaggregate data. In this report, we present a new pipeline architecture for integrated modeling of urban land use, travel demand, and traffic assignment. Our land use model, UrbanSim, is an open-source microsimulation ...

Journal: :international journal of architecture and urban development 2014
arash emami saleh amir yavari yasaman anbari hananeh derakhshani

concerning the population growth and urban development, significant growth in the rate of personal car usage has caused more transportation and thus growth in occupying the street areas for parking vehicles. this has caused much transporting problems and traffic. hence concerning the parking issue is crucial in traffic and municipal management.the important issue is the suitable place for the p...

2002
Antony Stathopoulos Theodore Tsekeris

The present paper provides an empirical investigation of the potential impacts of advanced traffic control measures, such as route guidance information, on traffic flow patterns. The simulation-based quasi-dynamic traffic assignment model (DNA) used appears to be an efficient tool for capturing the demand profile changes of drivers under the presence of information-based control measures. The r...

2005
M. van den Berg T. Bellemans B. De Schutter B. De Moor J. Hellendoorn

When there are different routes from origin to destination in a network, the traffic divides itself over these routes. The resulting assignment is often determined by the travel times on the different routes. When control measures are implemented the travel times for some routes change, which can lead to a change in the assignment. This change in assignment can effect the performance of the who...

Journal: :international journal of environmental research 2012
sh. afandizadeh n. kalantari h. rezaeestakhruie

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in...

Journal: :J. Parallel Distrib. Comput. 2012
Xiaoguang Li Jie Wu Shan Lin Xiaojiang Du

Dynamic channel assignment algorithms allow wireless nodes to switch channels when their traffic loads exceed certain thresholds. These thresholds represent estimations of their throughput capacities. Unfortunately, the threshold estimation may not be accurate due to co-channel interference (CCI) and adjacent-channel interference (ACI), especially with high traffic loads in dense networks. When...

2005
Xun Liang

In this paper, we probe into the traffic assignment problem by the chromosome-learning-based path finding method in simulation, which is to model the driver' behavior in the with-in-a-day process. By simply making a combination and a change of the traffic route chromosomes, the driver at the intersection chooses his next route. The various crossover and mutation rules are proposed with extensiv...

Journal: :Transportation Research Record: Journal of the Transportation Research Board 2009

2009
Carlos Melo

The Transit Assignment Problem for congested public transport systems based on the formulation of De Cea and Fernandez (1993) has asymmetric cost functions that can be solved, among others methods, by the diagonalización procedure. In this work, an implementation of the origin based algorithm proposed by Bar-Gera (1999) is used to solve the convex problems generated by the diagonalización proce...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید