2008•Wuhan Daxue xuebao. Xinxi kexue banRequires access

Complete Route Computing for Traveling by Public Transport

Yue‐Feng Liu

Open publisher page 1 citations

Abstract

It is important for cities to develop public transport system in order to solve existing traffic problems.In this paper,we propose a solution for complete route computing: first we build two models-the bi-level public transport network model and the pedestrian network model,and then connect the two networks as one unified mixed transportation network based on which we compute the complete route.In complete route computing,first route is planned on the upper part of the transport network(Level2),then transport transfer solution is calculated on the lower part of the transport network(Level1),in the end pedestrian network model is employed for walking path guidance in the transfer area.Thus we can realize the complete route computing for traveling by public transport.

About this research paper

What this paper is about

It is important for cities to develop public transport system in order to solve existing traffic problems.In this paper,we propose a solution for complete route computing: first we build two models-the bi-level public transport network model and the pedestrian network model,and then connect the two networks as one unified mixed transportation network based on which we compute the complete route.In complete route computing,first route is planned on the upper part of the transport network(Level2),then transport transfer solution is calculated on the lower part of the transport network(Level1),in the end pedestrian network model is employed for walking path guidance in the transfer area.Thus we can realize the complete route computing for traveling by public transport.

Why it matters

OpenAlex reports 1 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

It is important for cities to develop public transport system in order to solve existing traffic problems.In this paper,we propose a solution for complete route computing: first we build two models-the bi-level public transport network model and the pedestrian network model,and then connect the two networks as one unified mixed transportation network based on which we compute the complete route.In complete route computing,first route is planned on the upper part of the transport network(Level2),then transport transfer solution is calculated on the lower part of the transport network(Level1),in the end pedestrian network model is employed for walking path guidance in the transfer area.Thus we can realize the complete route computing for traveling by public transport.

Key concepts: Public transport, Computer science, Pedestrian, Path (computing), Transport network, Transfer (computing), Flow network, Order (exchange)

Related papers

Back to paper searchBrowse research topicsOriginal source
Complete Route Computing for Traveling by Public Transport — Research Paper | ScholarLens