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

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.

Grantor dc:publisher.institution

Department of Civil Engineering

Year dc:date.issued

2014

Author dc:creator

• Nnene, Obiora A

Advisors dc:contributor.advisor

• Zuidgeest, Mark
• Beukes, Edward Andrew

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/11427/13368

OAI identifier oai:identifier

oai:open.uct.ac.za:11427/13368