scispace - formally typeset
Search or ask a question
Author

Liping Fu

Bio: Liping Fu is an academic researcher from University of Waterloo. The author has contributed to research in topics: Poison control & Snow. The author has an hindex of 35, co-authored 177 publications receiving 4405 citations. Previous affiliations of Liping Fu include Wuhan University of Technology & Wuhan Institute of Technology.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution and a heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem.
Abstract: The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the expected shortest path in a traffic network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper first identifies a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-off between solution quality and computational efficiency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta.

326 citations

Journal ArticleDOI
TL;DR: The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience of various heuristic shortest path algorithms developed in the past.

324 citations

Journal ArticleDOI
TL;DR: In this paper, a new transit operating strategy is presented in which service vehicles operate in pairs with the lead vehicle providing an all-stop local service and the following vehicle being allowed to skip some stops as an express service.
Abstract: A new transit operating strategy is presented in which service vehicles operate in pairs with the lead vehicle providing an all-stop local service and the following vehicle being allowed to skip some stops as an express service. The underlying scheduling problem is formulated as a nonlinear integer programming problem with the objective of minimizing the total costs for both operators and passengers. A sensitivity analysis using a real-life example is performed to identify the conditions under which the proposed operating strategy is most advantageous.

180 citations

Journal ArticleDOI
TL;DR: This research effort attempts to address the issue of risk segmentation within the affected grade crossing population by applying an innovative latent segmentation based ordered logit model to evaluate the effects of various factors on the injury severity of vehicle drivers.

168 citations

Journal ArticleDOI
TL;DR: This research is the first showing the empirical relationship between safety and road surface conditions at a disaggregate level (event-based), making it feasible to quantify the safety benefits of alternative maintenance goals and methods.

151 citations


Cited by
More filters
01 Jan 2002

9,314 citations

Journal ArticleDOI

1,484 citations

Journal ArticleDOI
TL;DR: The theoretical basis for modeling univariate traffic condition data streams as seasonal autoregressive integrated moving average processes as well as empirical results using actual intelligent transportation system data are presented and found to be consistent with the theoretical hypothesis.
Abstract: This article presents the theoretical basis for modeling univariate traffic condition data streams as seasonal autoregressive integrated moving average processes. This foundation rests on the Wold decomposition theorem and on the assertion that a one-week lagged first seasonal difference applied to discrete interval traffic condition data will yield a weakly stationary transformation. Moreover, empirical results using actual intelligent transportation system data are presented and found to be consistent with the theoretical hypothesis. Conclusions are given on the implications of these assertions and findings relative to ongoing intelligent transportation systems research, deployment, and operations.

1,406 citations

Journal ArticleDOI
TL;DR: Chapman and Miller as mentioned in this paper, Subset Selection in Regression (Monographs on Statistics and Applied Probability, no. 40, 1990) and Section 5.8.
Abstract: 8. Subset Selection in Regression (Monographs on Statistics and Applied Probability, no. 40). By A. J. Miller. ISBN 0 412 35380 6. Chapman and Hall, London, 1990. 240 pp. £25.00.

1,154 citations