Validation of both number and coverage of bus schedules using AVL data

It is well known that the definition of bus schedules is critical for the service reliability of public transports. Several proposals have been suggested, using data from Automatic Vehicle Location (AVL) systems, in order to enhance the reliability of public transports. In this paper we study the optimum number of schedules and the days covered by each one of them, in order to increase reliability. We use the Dynamic Time Warping distance in order to calculate the similarities between two different dimensioned irregularly spaced data sequences before the use of data clustering techniques. The application of this methodology with the K-Means for a specific bus route demonstrated that a new schedule for the weekends in non-scholar periods could be considered due to its distinct profile from the remaining days. For future work, we propose to apply this methodology to larger data sets in time and in number, corresponding to different bus routes, in order to find a consensual cluster between all the routes.

[1]  Geoffrey H. Ball,et al.  ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION , 1965 .

[2]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[3]  David Griffin,et al.  AUTOMATED BUS DISPATCHING, OPERATIONS CONTROL, AND SERVICE RELIABILITY: ANALYSIS OF TRI-MET BASELINE SERVICE DATA , 1998 .

[4]  Golam Ashraf,et al.  Dynamic Time Warp Based Framespace Interpolation for Motion Editing , 2000, Graphics Interface.

[5]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[6]  Georges Hébrail,et al.  Interactive Interpretation of Kohonen Maps Applied to Curves , 1998, KDD.

[7]  P. Sopp Cluster analysis. , 1996, Veterinary immunology and immunopathology.

[8]  Kyuseok Shim,et al.  Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.

[9]  Eamonn J. Keogh,et al.  Iterative Deepening Dynamic Time Warping for Time Series , 2002, SDM.

[10]  Brian Everitt,et al.  Cluster analysis , 1974 .

[11]  Setsuo Ohsuga,et al.  INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .

[12]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[13]  Anil K. Jain Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[14]  Stefan Euler,et al.  Design and implementation of a speech server for unix based multimedia applications , 1993, EUROSPEECH.

[15]  H. D. Cheng,et al.  VLSI architectures for string matching and pattern matching , 1987, Pattern Recognit..

[16]  Henri Maître,et al.  Unsupervised feature selection applied to SPOT5 satellite images indexing , 2008, FSDM.

[17]  Vladimir Pavlovic,et al.  Discovering clusters in motion time-series data , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[18]  Bruno Agard,et al.  Measuring transit use variability with smart-card data , 2007 .

[19]  Heikki Mannila,et al.  Rule Discovery from Time Series , 1998, KDD.

[20]  Alicia Troncoso,et al.  Discovering patterns in electricity price using clustering techniques , 2007 .

[21]  N. Shibuhisa,et al.  Accurate Vehicle Localization using DTW between Range Data Map and Laser Scanner Data Sequences , 2007, 2007 IEEE Intelligent Vehicles Symposium.