Title

Designing Multiple Short-Turn Routes to Mitigate the Crowding on a Bus Network

Document Type

Journal Article

Publication Date

2021

Subject Area

mode - bus, place - asia, place - urban, infrastructure - fleet management, infrastructure - vehicle, operations - crowding, operations - frequency, operations - scheduling, ridership - demand, ridership - mode choice, ridership - modelling, economics - capital costs, economics - operating costs, economics - revenue, literature review, planning - service level, planning - route design

Keywords

Bus, Crowding, transit network, short-turn services

Abstract

On a transit route, initiating a trip beyond a transit route’s departure terminus and terminating the trip before its arrival is called “short-turn.” This study develops a method to design short-turn services to alleviate crowding on a transit network consisting of multiple overlapping routes. The proposed method consists of two processes: (i) optimizing routes, turn-back points, and fleet sizes of short-turn services by a genetic algorithm to minimize the sum of waiting, in-vehicle, operation, and social costs; (ii) assigning passenger trip demands to short-turn and existing services. These processes are performed iteratively to design multiple short-turn routes. The proposed method is applied to a real-world transit network in Seoul, Republic of Korea, to design 10 short-turn routes. The results are compared with two naïve methods that introduce short-turn services to sections with the maximum occupancy and the maximum demand divided by the section length, respectively. The comparison results show the proposed method is much superior to both of the naïve methods in reducing total costs. The result of the sensitivity analysis suggests that the value of in-vehicle time needs to be estimated accurately and site-specifically. The proposed model contributes to enhancing the convenience of transit users by effectively mitigating the crowding under budget constraints.

Rights

Permission to publish the abstract has been given by SAGE, copyright remains with them.

Share

COinS