The design of public transit networks with heuristic algorithms : case study Cape Town

Simple item page
dc.contributor.advisorZuidgeest, Marken_ZA
dc.contributor.advisorBeukes, Edward Andrewen_ZA
dc.contributor.authorNnene, Obiora Aen_ZA
dc.date.accessioned2015-07-03T10:31:23Z
dc.date.available2015-07-03T10:31:23Z
dc.date.issued2014en_ZA
dc.descriptionIncludes bibliographical references.en_ZA
dc.description.abstractThe Transit Network Design Problem (TNDP) is well-researched in the field of transportation planning. It deals with the design of optimized public transportation networks and systems, and belongs to the class of non-linear optimization problems. In solving the problem, attempts are made to balance the tradeoffs between utility maximization and cost minimization given some resource constraints, within the context of a transportation network. In this dissertation, the design of a public transit network is undertaken and tested for Cape Town. The focus of the research is on obtaining an optimal network configuration that minimizes cost for both users and operators of the network. In doing so, heuristic solution algorithms are implemented in the design process, since they are known to generate better results for non-linear optimization problems than analytical ones. This algorithm which is named a Bus Route Network Design Algorithm (BRNDA) is based on genetic algorithms. Furthermore, it has three key components namely: 1) Bus Route Network Generation Algorithm (BRNGA) - which generates the potential network solutions; 2) Bus Route Network Analysis Procedure (BRNAP) - which evaluates the generated solutions; 3) Bus Route Network Search Algorithm (BRNSA) - which searches for an optimal or near optimal network option, among the feasible ones. The solution approach is tested first on a small scale network to demonstrate its numerical results, then it is applied to a large scale network, namely the Cape Town road network.en_ZA
dc.identifier.apacitationNnene, O. A. (2014). <i>The design of public transit networks with heuristic algorithms : case study Cape Town</i>. (Thesis). University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Civil Engineering. Retrieved from http://hdl.handle.net/11427/13368en_ZA
dc.identifier.chicagocitationNnene, Obiora A. <i>"The design of public transit networks with heuristic algorithms : case study Cape Town."</i> Thesis., University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Civil Engineering, 2014. http://hdl.handle.net/11427/13368en_ZA
dc.identifier.citationNnene, O. 2014. The design of public transit networks with heuristic algorithms : case study Cape Town. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Nnene, Obiora A AB - The Transit Network Design Problem (TNDP) is well-researched in the field of transportation planning. It deals with the design of optimized public transportation networks and systems, and belongs to the class of non-linear optimization problems. In solving the problem, attempts are made to balance the tradeoffs between utility maximization and cost minimization given some resource constraints, within the context of a transportation network. In this dissertation, the design of a public transit network is undertaken and tested for Cape Town. The focus of the research is on obtaining an optimal network configuration that minimizes cost for both users and operators of the network. In doing so, heuristic solution algorithms are implemented in the design process, since they are known to generate better results for non-linear optimization problems than analytical ones. This algorithm which is named a Bus Route Network Design Algorithm (BRNDA) is based on genetic algorithms. Furthermore, it has three key components namely: 1) Bus Route Network Generation Algorithm (BRNGA) - which generates the potential network solutions; 2) Bus Route Network Analysis Procedure (BRNAP) - which evaluates the generated solutions; 3) Bus Route Network Search Algorithm (BRNSA) - which searches for an optimal or near optimal network option, among the feasible ones. The solution approach is tested first on a small scale network to demonstrate its numerical results, then it is applied to a large scale network, namely the Cape Town road network. DA - 2014 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 2014 T1 - The design of public transit networks with heuristic algorithms : case study Cape Town TI - The design of public transit networks with heuristic algorithms : case study Cape Town UR - http://hdl.handle.net/11427/13368 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/13368
dc.identifier.vancouvercitationNnene OA. The design of public transit networks with heuristic algorithms : case study Cape Town. [Thesis]. University of Cape Town ,Faculty of Engineering & the Built Environment ,Department of Civil Engineering, 2014 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/13368en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Civil Engineeringen_ZA
dc.publisher.facultyFaculty of Engineering and the Built Environment
dc.publisher.institutionUniversity of Cape Town
dc.subject.otherCivil Engineeringen_ZA
dc.titleThe design of public transit networks with heuristic algorithms : case study Cape Townen_ZA
dc.typeMaster Thesis
dc.type.qualificationlevelMasters
dc.type.qualificationnameMScen_ZA
uct.type.filetypeText
uct.type.filetypeImage
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
thesis_ebe_2014_nnene_o (2).pdf
Size:
2.01 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Masters