In order to solve the system optimum dynamic traffic assignment problem, the whole link model with physical queue is used to formulate the single destination system optimum dynamic traffic assignment problem as a mixed linear program. A relationship between the cumulative curves and the wave speed presented by Newell (1993) is used to present a dynamic network model in considering spillback que...

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...

probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. the problem of path overlapping in network modelling has been one of the main issues to be tackled. due to its flexible covariance structure, probit model can adequately address the pro...

One of the actions usually conducted to limit exposure a hazardous event is evacuation area that subject effects itself. This involves modifications both demand (a large number users all want move together) and supply (the transport network may experience changes in capacity, unusable roads, etc.). In order forecast traffic evolution during an evacuation, natural choice adopt approach based on ...

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...

I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...