Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A TSP Approach to the Bus Driver Rostering Problem
Publication

Publications

A TSP Approach to the Bus Driver Rostering Problem

Title
A TSP Approach to the Bus Driver Rostering Problem
Type
Article in International Conference Proceedings Book
Year
1992
Authors
José Vasconcelos Ferreira
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications Without AUTHENTICUS Without ORCID
Rui Guimarães
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications Without AUTHENTICUS Without ORCID
Conference proceedings International
Other information
Resumo (PT): In Public Transport Companies the Rostering Problem consists of finding a work assignment for drivers in a given time horizon. This leads to the formation of individual work schedules. In order to distribute the work load evenly among the drivers, these schedules must be nearly equal. A simple approach to this problem considers different sets of daily dudes each one consisting a rotable schedule. The sequence in which the duties of one set are executed must respect mini-mum rest period and should be established in accordance with a particular optimizing criterium. In this paper the authors formulate the problem as a TSP in order to minimize the variation between the amplitudes of rest periods. Computational results obtained from five sets of real life duties for three alliterative algorithms are presented.
Abstract (EN): In Public Transport Companies the Rostering Problem consists of finding a work assignment for drivers in a given time horizon. This leads to the formation of individual work schedules. In order to distribute the work load evenly among the drivers, these schedules must be nearly equal. A simple approach to this problem considers different sets of daily dudes each one consisting a rotable schedule. The sequence in which the duties of one set are executed must respect mini-mum rest period and should be established in accordance with a particular optimizing criterium. In this paper the authors formulate the problem as a TSP in order to minimize the variation between the amplitudes of rest periods. Computational results obtained from five sets of real life duties for three alliterative algorithms are presented.
Language: Portuguese
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Previsão da procura de um novo serviço de telefone móvel : metodologia e modelização (1993)
Article in National Scientific Journal
Gaspar Coutinho; José Ferreira; Rui Guimarães
A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas (1995)
Article in International Scientific Journal
José Vasconcelos Ferreira; Rui Guimarães
Previsão da Procura de um Novo Serviço de Telefone Móvel: Metodologia e Modelização (1992)
Article in International Conference Proceedings Book
Rui Guimarães; Gaspar Coutinho; José Vasconcelos Ferreira
Planeamento de Meios de Comunicação: O Rei Vai Nu? (1994)
Article in International Conference Proceedings Book
José Vasconcelos Ferreira; Rui Guimarães
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-16 at 04:53:25 | Privacy Policy | Personal Data Protection Policy | Whistleblowing