2007Journal of Advanced TransportationOpen access

Dispatching control at transfer stations in multi‐hub transit networks

Ching‐Jung Ting, Paul Schonfeld

Open full text 20 citations

Abstract

Abstract Among dispatching control approaches, the holding option has attracted the most attention in bus control. However, holding a vehicle at a transfer station may exacerbate the delays because more passengers might accumulate at downstream stations and may also affect other connecting routes at other transfer stations. Our problem is to minimize the total costs of dispatching ready vehicles at each transfer station along coordinated routes in a multi‐hub transit network. The total costs include the waiting cost for on‐board passengers, the missed connection costs for late arrival passengers at the subject transfer station and possible transfer costs at downstream transfer stations. We develop a heuristic algorithm to optimize the holding times based on real time information about late vehicles. The results show that ready vehicles should be held longer when the arrival variances of late vehicles are small or when many late connecting passengers are expected.

Open-access reader

About this research paper

What this paper is about

Abstract Among dispatching control approaches, the holding option has attracted the most attention in bus control. However, holding a vehicle at a transfer station may exacerbate the delays because more passengers might accumulate at downstream stations and may also affect other connecting routes at other transfer stations. Our problem is to minimize the total costs of dispatching ready vehicles at each transfer station along coordinated routes in a multi‐hub transit network. The total costs include the waiting cost for on‐board passengers, the missed connection costs for late arrival passengers at the subject transfer station and possible transfer costs at downstream transfer stations. We develop a heuristic algorithm to optimize the holding times based on real time information about late vehicles. The results show that ready vehicles should be held longer when the arrival variances of late vehicles are small or when many late connecting passengers are expected.

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Among dispatching control approaches, the holding option has attracted the most attention in bus control. However, holding a vehicle at a transfer station may exacerbate the delays because more passengers might accumulate at downstream stations and may also affect other connecting routes at other transfer stations. Our problem is to minimize the total costs of dispatching ready vehicles at each transfer station along coordinated routes in a multi‐hub transit network. The total costs include the waiting cost for on‐board passengers, the missed connection costs for late arrival passengers at the subject transfer station and possible transfer costs at downstream transfer stations. We develop a heuristic algorithm to optimize the holding times based on real time information about late vehicles. The results show that ready vehicles should be held longer when the arrival variances of late vehicles are small or when many late connecting passengers are expected.

Key concepts: Transfer station, Transfer (computing), Transit (satellite), Control (management), Transport engineering, Downstream (manufacturing), Heuristic, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Dispatching control at transfer stations in multi‐hub transit networks — Research Paper | ScholarLens