### Abstract

The shortest path query problem in large scale time-varying transit network is NP-hard. Approximate search algorithm is not satisfactory, and the exact search algorithm is inefficient. In this paper, a time-varying mathematical model for transit network is formulated according to the time-varying and uncertainty characteristic of public transport network. The choice of the optimal path for transit network is decomposed into transfer times and transfer line query problem. A query algorithm for transfer times is proposed based on the line mapping network and an algorithm for both transfer site and travel distance is proposed based on site mapping network. Both of them are polynomial. Finally we use a numerical example to illustrate the solution process of the proposed method.

Original language | English (US) |
---|---|

Pages (from-to) | 1-6 |

Number of pages | 6 |

Journal | Complex Systems and Complexity Science |

Volume | 12 |

Issue number | 3 |

DOIs | |

State | Published - Sep 1 2015 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering

### Cite this

*Complex Systems and Complexity Science*,

*12*(3), 1-6. https://doi.org/10.13306/j.1672-3813.2015.03.001

}

*Complex Systems and Complexity Science*, vol. 12, no. 3, pp. 1-6. https://doi.org/10.13306/j.1672-3813.2015.03.001

**Mathematical programming model and algorithm for time-varying transit network.** / Xu, Yong; Li, Jie; An, Liping; Wang, Ping; Chu, Chao Hsien.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Mathematical programming model and algorithm for time-varying transit network

AU - Xu, Yong

AU - Li, Jie

AU - An, Liping

AU - Wang, Ping

AU - Chu, Chao Hsien

PY - 2015/9/1

Y1 - 2015/9/1

N2 - The shortest path query problem in large scale time-varying transit network is NP-hard. Approximate search algorithm is not satisfactory, and the exact search algorithm is inefficient. In this paper, a time-varying mathematical model for transit network is formulated according to the time-varying and uncertainty characteristic of public transport network. The choice of the optimal path for transit network is decomposed into transfer times and transfer line query problem. A query algorithm for transfer times is proposed based on the line mapping network and an algorithm for both transfer site and travel distance is proposed based on site mapping network. Both of them are polynomial. Finally we use a numerical example to illustrate the solution process of the proposed method.

AB - The shortest path query problem in large scale time-varying transit network is NP-hard. Approximate search algorithm is not satisfactory, and the exact search algorithm is inefficient. In this paper, a time-varying mathematical model for transit network is formulated according to the time-varying and uncertainty characteristic of public transport network. The choice of the optimal path for transit network is decomposed into transfer times and transfer line query problem. A query algorithm for transfer times is proposed based on the line mapping network and an algorithm for both transfer site and travel distance is proposed based on site mapping network. Both of them are polynomial. Finally we use a numerical example to illustrate the solution process of the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=84945281929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945281929&partnerID=8YFLogxK

U2 - 10.13306/j.1672-3813.2015.03.001

DO - 10.13306/j.1672-3813.2015.03.001

M3 - Article

AN - SCOPUS:84945281929

VL - 12

SP - 1

EP - 6

JO - Complex Systems and Complexity Science

JF - Complex Systems and Complexity Science

SN - 1672-3813

IS - 3

ER -