Back to results list
Please use this identifier to cite or link to this item:
|Title:||Stochastic transport network model and optimization for reliability and vulnerability analysis||Authors:||Luathep, Paramet||Keywords:||Transportation -- Planning.
Transport theory -- Mathematical models.
Hong Kong Polytechnic University -- Dissertations
|Issue Date:||2011||Publisher:||The Hong Kong Polytechnic University||Abstract:||This thesis aims to contribute to the rapidly growing research area of transport network reliability and vulnerability by introducing the concept of stochastic network (SN) into the reliability and vulnerability analyses. The thesis also aims to develop advanced methods for evaluating network reliability and vulnerability and solving network design problem (NDP) with reliability consideration. The thesis first derives closed-form expressions of SN flow and cost models. Three static SN traffic assignment models are also formulated, including user equilibrium (SN-UE), system optimum (SN-SO), and stochastic user equilibrium (SN-SUE). The SN-SUE model is then used to propose an evaluation and design model for network capacity reliability assessment/enhancement under travel demand variability. The implicit programming approach is applied to solve the proposed optimization problem. Sensitivity analysis (SA) is adopted to provide all necessary derivatives. For vulnerability analysis, the thesis proposes a SA-based approach to improve computational efficiency and allow for large-scale road networks. With the road networks of Sioux Falls City and Bangkok metropolitan area, the proposed method can significantly reduce computation time compared with the traditional approach. For integrated analysis, the thesis proposes an integrated scenario tree model for road network design under both recurrent day-to-day traffic congestion (evaluated by SN-SUE model) and non-recurrent events, e.g. disasters, (assessed by SN-SO model). Finally, the thesis focuses on developing a global optimization method for solving a mixed network design problem (MNDP). The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting-constraint algorithm (CCA) is developed for solving the MILP problem. The proposed method and algorithm is also applied to solve a discrete stochastic network design problem and to evaluate stochastic network vulnerability.||Description:||215 p. : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P CSE 2011 Luathep
|URI:||http://hdl.handle.net/10397/4652||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|b24562348_link.htm||For PolyU Users||162 B||HTML||View/Open|
|b24562348_ir.pdf||For All Users (Non-printable)||4.59 MB||Adobe PDF||View/Open|
Citations as of May 21, 2018
Citations as of May 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.