Go to:
Logótipo
Você está em: Start > Publications > View > Validation of both number and coverage of bus schedules using AVL data
Map of Premises
Principal
Publication

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

Title
Validation of both number and coverage of bus schedules using AVL data
Type
Article in International Conference Proceedings Book
Year
2010
Authors
Matias, L
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Gama, J
(Author)
FEP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Mendes Moreira, J
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
De Sousa, JF
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Conference proceedings International
Pages: 131-136
13th International IEEE Conference on Intelligent Transportation Systems, ITSC 2010
Funchal, 19 September 2010 through 22 September 2010
Indexing
Publicação em ISI Proceedings ISI Proceedings
Publicação em ISI Web of Knowledge ISI Web of Knowledge
INSPEC
Scientific classification
CORDIS: Physical sciences > Computer science
Other information
Authenticus ID: P-007-WS6
Abstract (EN): 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. ©2010 IEEE.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 6
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same scientific areas

On Applying Linear Tabling to Logic Programs (2010)
Thesis
MIGUEL AREIAS; Ricardo Rocha
APRIORI Algorithm for Label Ranking (2010)
Thesis
Cláudio Sá; Carlos Soares; Joaquim Costa
On the average size of pd automata: an analytic combinatorics approach (2010)
Technical Report
Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis
On Covering Path Orthogonal Polygons (preliminary version) (2016)
Technical Report
Ana Paula Tomás; Catarina Lobo Ferreira
Introdução ao método dos elementos finitos (1998)
Technical Report
João Manuel Ribeiro Silva Tavares; Armando Jorge Monteiro Neves Padilha

See all (192)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-16 at 17:12:53 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book