Font Size: a A A

Dynamic System Optimum Simultaneous Route And Departure Time Choice Problems:Formulations And Comparison

Posted on:2019-04-10Degree:MasterType:Thesis
Country:ChinaCandidate:C WangFull Text:PDF
GTID:2382330548957000Subject:Traffic and Transportation Engineering
Abstract/Summary:PDF Full Text Request
As one of the core technologies of the Intelligent Transportation System,dynamic traffic assignment theory can effectively alleviate urban road traffic congestion.Based on the link transmission model,this thesis studied the dynamic system optimum simultaneous route and departure time choice problems for general network applications.In concrete terms,the main contents of the thesis are summarized as follows:Firstly,this thesis developed link-based,intersection-movement-based,and path-based models to formulate dynamic system optimum simultaneous route and departure time choice problems without first-in-first-out constraints for general network applications.Dynamic network constraints and non-vehicle holding constraints were considered,and the problem were formulated as linear programming problems.This thesis found that existing link-based non-vehicle holding constraints cannot completely eliminate vehicle holding solutions,and proposed both intersection-movement-based and path-based nonvehicle holding constraints,which can completely eliminate vehicle holding solutions.This thesis also proved that the link-based,intersection-movement-based,and path-based formulations of dynamic system optimum simultaneous route and departure time choice problems without first-in-first-out constraints are equivalent in terms of obtaining the same optimal total system travel cost.Numerical examples were presented to illustrate the model application and to show the effectiveness of the solution method.Then,on the basis of the above research,this thesis considered the first-in-first-out constraints and formulated dynamic system optimum simultaneous route and departure time choice problems with first-in-first-out constraints for general network applications.The first-in-first-out constraints resulted in the not convex model,and the problem were formulated as non-convex non-linear programming problems,and the branch-and-bound algorithms were proposed to solve the model.This thesis showed that the three formulations of dynamic system optimum simultaneous route and departure time choice problems with first-in-first-out constraints can obtain different optimal total system travel cost.The validity of the proposed model and algorithm is verified by numerical example.Numerical examples were presented to illustrate the model application and to show the effectiveness of the solution method.
Keywords/Search Tags:dynamic traffic assignment, system optimum, link transmission model, vehicle holding problem, first-in-first-out
PDF Full Text Request
Related items