Sharif Digital Repository

Shipment of hazardous materials has got an important role in the world of today. Nowadays, sustainable development has got serious attention, and human health and environment are one of the sustainable development bases. The risk of hazardous materials for human health and environment, and also importance of this kind of materials in the industrial economy, make necessity of programming for shipment of hazardous materials more serious. This thesis, presents an optimiziation model for routing and scheduling for shipment of hazardous materials. This model is a multi criteria time varing mixed integer programming (MIP). The presented model, finds the optimal routs and scheduling of movement... 

The toll pricing problem has been investigated in the literature for the cases of link, cordon, and facility (bridge, tunnel and etc.) pricing. Taking advantages of new technologies, nowadays it is possible to track the path of individual vehicles and collect the tolls by means of electronic devices. In this regard, we concerned the problem of path pricing. In this thesis, a variety of models for path pricing is proposed, the models are solved for the Hearn network and the results are compared to the results of link pricing models. In addition to the models, one exact solution method and two heuristic methods are proposed for the model of path pricing with the minimum total toll.... 

In recent years, traffic assignment problem with side constraints has been considered because of the importance of transportation supply management. Side constraints which are appeared due to imposing the traffic control policies are usually represented in form of link, node or district capacity constraints. Although link capacity constraint has been extensively studied, only a few papers on the other types of constraints such as capacity constraint on inflow to a district of city exist in the literature. In this research a method based on dynamic penalty function (DPF) is presented to solve traffic assignment problem with side constraints. Solution algorithm has been coded in a programming... 

Discrete network design problem is selecting a set of feasible projects among a set of candidate projects, considering a budget constraint in which user's cost is being minimized. Network design problem is one of the complicated problems in transportation science, since it is a bi-level problem in which the lower level is a traffic assignment problem and the upper level is finding the best set of arcs. Meta-heuristic algorithms can be used to solve this problem. Although, there is no guarantee to find the optimal solution by Meta-heuristic algorithms, but they find good solutions in short times. The purpose of this study is comparing the efficiency of three Meta-heuristic algorithms for... 

Improving synchronization in a bus network has a profound effect on reducung waiting times and increasing satisfaction of system’s users. By doing so, the scheduler create a more attractive transit system that generates the opportunity for increasing the number of riders. In this research, the problem of creating timetables with maximum synchronization is modeled as a mixed integer programing (MIP) problem. The objective of this model is to minimize the total waiting times of passengers at transfer nodes. For this purpose, the model take advantage of uneven headways. Some of features that distinguish this research are more realistic objective function, and considering adjacent departures... 

In this dissertation, transportation networks with two classes of vehicles, including conventional vehicles and autonomous vehicles, have been studied. Four problems, including traffic assignment problem with two classes, congestion pricing problem for conventional vehicles, network design problem for autonomous vehicles, and simultaneous congestion pricing and network design problem, have been modeled and algorithms to solve them are presented. In this study, a dynamic penalty function algorithm is used to solve the congestion pricing problem, and a heuristic algorithm is used to solve the network design problem. Besides, the two-class traffic assignment problem is solved using the... 

Control and managing of fuel consumption is one of the most important issues facing man kind today. Locating gas stations has a great effect on fuel consumption. The gas station locating problem consists of selecting the optimal choice between the candidate nodes for constructing gas stations in such a way that minimizes the excess travel time that results from the gas station not being located on daily travel paths. The gas station locating model is presented for two conditions of either considering and not considering the gas station capacity. In the case of not considering the gas station capacity, a compact model is presented, too. Softwares for medium sized networks and the Simulated... 

Signal Coordination is one of the appropriate methods for delay reduction in intersections. Static Traffic Assignment is unable to reflect the impacts of Signal Coordination in a network. One proper way to overcome this difficulty is to use Dynamic Traffic Assignment (DTA) that can model complex properties of traffic flow. This thesis presents a method to apply Signal Coordination in Cell Transmission Model. Neguin network is tested for different intersection's green start times. The results show that Signal Coordination has great influence on total travel time and route choice in this network. Finally, the results have been checked with AIMSUN NG, a microsimulator software.

 

The goal of this research is to solve the traffic assignment of electric vehicles with considering trip chains. Limited driving range of electric vehicles is considered as one the most important obstacles for the development of these cars. The worry that the battery will run out of power before the destination is an important issue regarding the electric cars and people usually experience it more in trip chains. In this research, a complementary model and a linearization method is used for traffic assignment. In determining shortest paths in the traffic assignment, in addition to considering the travel time and the distance limit, the constraint of passing through activity nodes is... 

The trip demand information in the form of the origin-destination (OD) matrix is of significant importance in the transportation studies. Obtaining such a matrix by conventional methods requires a considerable amount of time, cost, and human resources. Traffic count and cellphone network data are two relatively inexpensive data that can be used for estimation of OD matrices as well as correction of prior matrices. The trip demand estimation problem is a bi-level model, and the gradient algorithm is one way to solve it. This study, by generalizing the gradient algorithm, attempts to a better use of the available data. In this algorithm, a complementary algorithm is used to solve the traffic... 

Nowadays, with the advent of Autonomous Vehicles(AV), Researchers in different areas focused more on this type of vehicle. Research shows that autonomous vehicles are faster and more precise than Human-driven vehicles(HDV). So if all the users in a road use autonomous Vehicles, the road’s capacity increases; this Thesis develops a mathematical approach for designing AV exclusive lanes for a time horizon in which there are two types of AVs and HDVs on the road. Considering each type of vehicle’s relative performance for an OD pair in the given year, the demand for that OD pair for the next year calculates with a diffusion model. Designing AV exclusive lanes problem is formulated in a bi-level... 

It is assumed in many traffic assignment models that people choose their path based on shortest travel time. Few empirical studies of revealed route characteristics have been reported in the literature. In this study, first, an innovative internet-based survey using Google map has been designed and implemented. The sample includes the people who commute to Sharif University of Technology in the morning peak hours. Next, observed routes in 134 valid questionnaires have been analyzed by using Tehran network database and VBA programming. Besides the length and travel time of each path, other characteristics of the observed route such as the number of right, left, and U-turns, number of...