DATA-DRIVEN FRAMEWORK FOR OPTIMIZING PUBLIC TRANSPORTATION ROUTES
Notice: This is a sample project for study and reference. Submitting it as your own work violates most universities' academic integrity policies.
Abstract
About This Research Topic
Efficient public transport is the backbone of urban productivity, yet in many fast-growing Nigerian cities, route networks were never formally designed. In Lagos, danfo minibuses, shared taxis and okada services dominate daily trips, with routes that emerged organically through driver habit and incremental demand rather than systematic planning. While this organic growth shows adaptability, it creates structural inefficiencies: overlapping corridors, excessive transfers, long passenger wait times, and unbalanced vehicle loads. Explore recent transport planning research topics This article presents a rewritten and expanded version of an undergraduate project on a data-driven framework for optimizing public transportation routes, retaining the original aim and methodology while adding academic depth, SEO clarity, and practical interpretation for transit authorities and researchers.
Main Abstract
Public transportation route networks in rapidly urbanizing cities, particularly in paratransit-dominated systems such as Nigerian minibus, shared taxi, and motorcycle taxi services, have often evolved incrementally without systematic optimization against current ridership demand. This leads to measurable inefficiencies including long wait times, uneven loading, and poor coverage. This study designs, implements, and evaluates a data-driven framework for route optimization that integrates ridership demand analysis with graph-based network optimization. The research adopts a Design Science Research methodology, organized into demand analysis, road network graph construction, genetic algorithm-based route design, and comparative evaluation. A synthetic transportation network modeled on a mid-sized Nigerian city district was built from OpenStreetMap data, supplemented with validation using the publicly available Chicago Transit Authority ridership dataset. The optimization uses a genetic algorithm with a multi-objective fitness function weighting total passenger travel time, vehicle operating cost proxied by total route distance and fleet size, and demand coverage defined as the proportion of origin-destination pairs served within an acceptable transfer threshold. An agent-based passenger simulation compared the optimized network against the baseline. Results indicate an 18.3% reduction in average passenger travel time from 42.6 to 34.8 minutes, a 24.1% improvement in average vehicle load factor, and a 9.7% reduction in total fleet-distance operating cost, while demand coverage increased from 89.6% to 94.2% within the transfer threshold. Sensitivity analysis characterizes the trade-off frontier between travel time and operating cost as fitness weights vary. The study concludes that genetic algorithm-based optimization can produce substantially more efficient configurations than incrementally evolved networks and recommends a phased pilot beginning with highest-impact routes.
Chapter One Preview
Background to the Study
Urban mobility in Nigeria sits at the intersection of formal and informal systems. Bus Rapid Transit and the Lagos Rail Mass Transit represent formal investments, but daily mobility still relies heavily on paratransit. According to U.S. Department of Transportation research on transit network design and operations research literature, an efficient transit network must simultaneously minimize passenger-centric costs such as travel time and transfers, and operator-centric costs such as fleet mileage, while ensuring equitable demand coverage.
The Transit Network Design Problem (TNDP) formalizes this challenge. TNDP is NP-hard, meaning exact optimal solutions are computationally intractable for real city scales. Consequently, metaheuristics, particularly genetic algorithms, are widely used. A genetic algorithm maintains a population of candidate route sets, iteratively applying selection, crossover, and mutation to evolve higher-quality solutions as measured by a fitness function. When combined with a road network graph where intersections are nodes and road segments are edges, the approach enables systematic exploration of a vast combinatorial space that manual planning cannot cover.
Recent advances in smart-card and mobile ticketing data have made demand-driven design feasible, yet many Nigerian authorities lack access to such data pipelines. This study addresses that gap by constructing a synthetic origin-destination demand model calibrated to realistic urban patterns and validating the pipeline against real-world data. For broader context on data-driven urban systems, see our guide on geospatial analysis project topics using OpenStreetMap and engineering project materials on smart mobility
Statement of the Problem
1. Incremental Evolution Without Optimization: Route networks in many Nigerian districts evolved through operator choice rather than data-driven design, leading to redundancy and poor connectivity.
2. Tooling Gap: Transit regulators and paratransit associations lack affordable optimization frameworks, relying on intuition for route changes.
3. Computational Complexity: Because TNDP is NP-hard, manual improvements cannot reliably approximate metaheuristic solutions that search thousands of configurations.
4. Geographic Research Gap: Published optimization studies focus on North American, European, and East Asian cities, with limited application to West African paratransit-dominated contexts.
5. Single-Objective Reporting: Many studies present one optimal network without exposing the trade-off between passenger time and operating cost, reducing usefulness for policy decisions where budgets are constrained.
Aim and Objectives of the Study
Aim:
To design, implement, and evaluate a data-driven framework for public transportation route optimization combining ridership demand analysis with genetic algorithm-based network design.
Objectives:
1. Review TNDP formulations and genetic algorithm approaches.
2. Construct a road network graph and synthetic demand model for a representative Nigerian city district using OpenStreetMap data.
3. Design and implement a genetic algorithm with multi-objective fitness weighting travel time, operating cost, and coverage.
4. Implement agent-based passenger simulation to compare optimized vs baseline networks.
5. Conduct sensitivity analysis on fitness weighting to map travel time vs cost trade-offs.
6. Validate methodology against the Chicago Transit Authority ridership dataset.
Research Questions
1. How does the optimized network compare to the baseline in average travel time, load factor, and operating cost?
2. What demand coverage does the optimized network achieve within acceptable transfers versus baseline?
3. What trade-off frontier emerges between travel time and operating cost as fitness weights vary?
4. Does the framework produce plausible results when applied to the CTA ridership dataset?
Significance of the Study
For transit authorities, the framework provides a low-cost, transparent decision-support tool that does not require enterprise software licenses. For the operations research community, it contributes a documented case combining graph construction from OpenStreetMap, genetic algorithm optimization, and agent-based evaluation in a Nigerian context. For urban policymakers, it quantifies the potential gains from data-driven redesign: 18.3% travel time savings and improved load balancing translate directly into economic productivity and passenger satisfaction. Students seeking methodology references can review our research methodology guides for Design Science Research
Scope of the Study
Limited to fixed-route network design for a single Nigerian district case study using OpenStreetMap and synthetic demand calibrated to realistic patterns, due to unavailability of live smart-card data within academic scope. Supplemented with validation on Chicago Transit Authority public data. Does not address dynamic on-demand routing, detailed frequency scheduling, crew rostering, or fare policy, nor does it include field pilot implementation, which would require regulatory partnership.
Limitations of the Study
Use of synthetic demand means results are illustrative of achievable magnitude, not a ready-to-implement redesign. Genetic algorithms are metaheuristics and do not guarantee global optimality. Agent-based simulation assumes passengers choose minimum travel time paths, simplifying real behavioural factors. Focus is on fixed routes only.
Operational Definition of Terms
Transit Network Design Problem (TNDP): The problem of designing transit routes and frequencies to optimize objectives subject to constraints. See Federal Transit Administration research on transit planning.
Genetic Algorithm: Evolutionary metaheuristic improving candidate solutions via selection, crossover, and mutation.
Road Network Graph: Graph model where nodes are intersections/stops and edges are road segments, often derived from OpenStreetMap.
Origin-Destination Demand: Volume of trips between origin and destination in a time period.
Load Factor: Ratio of passengers carried to capacity, measuring utilization.
Fitness Function: Objective function ranking candidate solutions in genetic algorithm.
Agent-Based Simulation: Modelling individual passenger agents to estimate system metrics.
Paratransit: Informal/semi-formal services like minibuses and shared taxis operating outside fully scheduled systems.
NIST definition of genetic algorithms and optimization | OpenStreetMap data for transport research | Chicago Transit Authority ridership data | Bureau of Transportation Statistics on transit efficiency
Conclusion
The framework reduced average passenger travel time by 18.3%, improved load factor by 24.1%, cut operating cost by 9.7%, and increased coverage to 94.2% within transfer limits. This demonstrates that even resource-constrained authorities can benefit from data-driven optimization. Rather than wholesale redesign, the study recommends phased pilot implementation starting with corridors showing largest simulated gains, allowing stakeholder engagement and risk mitigation. Future work should integrate live AFC data, frequency optimization, and behavioural choice modelling. For implementation templates, see our complete collection of transportation engineering projects
FAQs
1. What is the Transit Network Design Problem?
TNDP is the optimization problem of designing transit routes and frequencies to balance passenger travel time, operator cost, and coverage under network constraints.
2. Why use genetic algorithms for route optimization?
TNDP is NP-hard, so exact methods are intractable. Genetic algorithms efficiently explore large combinatorial spaces to find high-quality solutions.
3. What data does the framework require?
A road network graph from OpenStreetMap and origin-destination demand. This study used synthetic demand calibrated to realistic patterns plus CTA data for validation.
4. How much improvement did the optimized network achieve?
18.3% lower travel time, 24.1% better load factor, 9.7% lower fleet-distance cost, and coverage increase from 89.6% to 94.2%.
5. What is demand coverage?
Proportion of origin-destination pairs served within an acceptable number of transfers, a key accessibility metric.
6. What is agent-based passenger simulation?
Simulating individual passengers choosing routes to estimate system metrics like average travel time and vehicle loading.
7. Can this framework be used in Nigerian cities like Lagos?
Yes, it was designed for paratransit-dominated Nigerian contexts and can be adapted using local road data and demand estimates.
8. What is the trade-off between travel time and operating cost?
Weighting travel time more produces faster trips but may need larger fleets. Sensitivity analysis helps authorities choose based on policy priorities.
9. What are limitations of the current study?
Uses synthetic demand not live data, metaheuristic does not guarantee global optimum, and does not include field pilot or detailed scheduling.
10. What is the recommended adoption pathway?
Phased pilot implementation beginning with routes showing largest simulated improvement, before city-wide rollout.
Purchase to unlock the full material.