Abstract

In this study, the Transit Network Design Problem (TNDP) is studied to determine the set of routes and frequency on each route for public transportation systems. To ensure the important concerns of planners like route length, route configuration, demand satisfaction, and attractiveness of the transit routes, the TNDP is solved to generate a set of routes by proposing an initial route set generation (IRSG) procedure embedded into the NSGA-II algorithm. The proposed IRSG algorithm aims to produce high-quality initial route set solutions to reach better optimization procedures. Moreover, the Multi-Objective Mixed-Integer Non-Linear Programming (MOMINLP) model is proposed to formulate the frequency setting problem on each route by minimizing the total travel time of passengers (user costs) and operator costs simultaneously, while maximizing the service coverage area near all the bus stops. The MOMINLP model is solved by applying the NSGA-II algorithm to produce a Pareto front between the first and the second objective functions. The model was applied to the Fargo-Moorhead Area (FMA), a small urban area. Results were compared with the existing transit network to measure the efficiency of the NSGA-II solution methodology. The proposed algorithm was found to considerably decrease the total travel time of passengers.

Highlights

  • Today, cities are growing faster than in the past in terms of population, congestion, and land use

  • The proposed initial route set generation (IRSG) algorithm procedure starts with generating the initial route by an origin-destination matrix which is calculated by the demand matrix and the number of required transit routes

  • The performance of the proposed Nondominated Sorting Genetic Algorithm II (NSGA-II) algorithm depends on the parameters defined in Table 1, which include the number of populations, number of generations, number of existing bus stops, probability of crossover and mutation, minimum and maximum length of each transit route, number or routes the planner decides to generate, the average speed of existing buses operating, minimum and maximum bus headway, and maximum number of available buses in the network

Read more

Summary

Introduction

Cities are growing faster than in the past in terms of population, congestion, and land use. The Transit Network Design Problem (TNDP) model attempts to design an optimal transit network, given the constraints, that addresses many of the urban transportation problems while providing useful services to travelers and commuters. The TNDP is designed to consider multiple objectives including maximizing the number of travelers in the network [1,2], service coverage [3,4], demand density of the route including direct trips, one transfer, and two transfers [5], while considering social. The bus route network is designed to improve the existing routes with predetermined bus stops to achieve an efficient transit network, minimizing the total travel time of passengers (user costs) and the number of operating buses (operator costs), while maximizing the service coverage in the network.

Literature Review
Optimization Objectives
Solution Technique
Research Gaps
Proposed Model
Problem Statement
Mathematical Model
Parameters
Variables
Objective Functions
Constraints
The Proposed Solution Methodology
Fitness Evaluation
Tournament
12: If CH2 is not Feasible
The NSGA-II Algorithm
Case Study
Existing route theFMA
Results and Discussions
Defining Parameters Value
Result of the Proposed IRSG Algorithm
Result of the Proposed NSGA-II Algorithm
Comparing
Sensitivity Analysis
12. Convergence
14. Impacts
Conclusions
Solution Methodology
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call