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