Combining heristic and utility function for fair train crew rostering

Página do item simplificado
dc.contributor.authorConstantino, Ademir Aparecido
dc.contributor.authorDe Mendonça, Candido Ferreira Xavier
dc.contributor.authorNovaes, Antonio Galvão
dc.contributor.authorDos Santos, Allainclair Flausino
dc.contributor.institutionUniversidade de São Paulo (USP)
dc.contributor.institutionUniversidade Federal de Santa Catarina (UFSC)
dc.date.accessioned2022-04-28T19:01:30Z
dc.date.available2022-04-28T19:01:30Z
dc.date.issued2015-01-01
dc.description.abstractIn this paper we address the problem of defining a work assignment for train drivers within a monthly planning horizon with even distribution of satisfaction based on a real-would problem. We propose an utility function, in order to measure the individual satisfaction, and a heuristic approach to construct and assign the rosters. In the first phase we apply stated preference methods to devise a utility function. The second phase we apply a heuristic algorithm which constructs and assigns the rosters based on the previous utility function. The heuristic algorithm constructs a cyclic roster in order to find out a minimum number of train drivers required for the job. The cyclic roster generated is divided into different truncated rosters and assigned to each driver in such way the satisfactions should be evenly distributed among all drivers as much as possible. Computational tests are carried out using real data instance of a Brazilian railway company. Our experiments indicated that the proposed method is feasible to reusing the discrepancies between the individual rosters.en
dc.description.affiliationDepartment of Computer Science, State University of Maringá
dc.description.affiliationSchool of Arts, Science and Humanities, State University of São Paulo
dc.description.affiliationDepartment of Production Engineering, Federal University of Santa Catarina
dc.format.extent593-602
dc.identifier.citationICEIS 2015 - 17th International Conference on Enterprise Information Systems, Proceedings, v. 1, p. 593-602.
dc.identifier.scopus2-s2.0-84939553155
dc.identifier.urihttp://hdl.handle.net/11449/220432
dc.language.isoeng
dc.relation.ispartofICEIS 2015 - 17th International Conference on Enterprise Information Systems, Proceedings
dc.sourceScopus
dc.subjectBottleneck assignment problem
dc.subjectCrew rostering problem
dc.subjectFair rostering
dc.subjectStated preferences
dc.titleCombining heristic and utility function for fair train crew rosteringen
dc.typeTrabalho apresentado em evento

Arquivos

Coleções

Artigos