loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ademir Aparecido Constantino 1 ; Candido Ferreira Xavier de Mendonça 2 ; Antonio Galvão Novaes 3 and Allainclair Flausino dos Santos 1

Affiliations: 1 State University of Maringá, Brazil ; 2 State University of São Paulo, Brazil ; 3 Federal University of Santa Catarina, Brazil

Keyword(s): Crew Rostering Problem, Stated Preferences, Fair Rostering, Bottleneck Assignment Problem.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Enterprise Information Systems ; Group Decision Support Systems ; Industrial Applications of Artificial Intelligence ; Intelligent Transportation System ; Operational Research ; Scheduling and Planning

Abstract: In 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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.44.22

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Aparecido Constantino, A.; Ferreira Xavier de Mendonça, C.; Galvão Novaes, A. and Flausino dos Santos, A. (2015). Combining Heuristic and Utility Function for Fair Train Crew Rostering. In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS; ISBN 978-989-758-096-3; ISSN 2184-4992, SciTePress, pages 593-602. DOI: 10.5220/0005364505930602

@conference{iceis15,
author={Ademir {Aparecido Constantino}. and Candido {Ferreira Xavier de Mendon\c{C}a}. and Antonio {Galvão Novaes}. and Allainclair {Flausino dos Santos}.},
title={Combining Heuristic and Utility Function for Fair Train Crew Rostering},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS},
year={2015},
pages={593-602},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005364505930602},
isbn={978-989-758-096-3},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS
TI - Combining Heuristic and Utility Function for Fair Train Crew Rostering
SN - 978-989-758-096-3
IS - 2184-4992
AU - Aparecido Constantino, A.
AU - Ferreira Xavier de Mendonça, C.
AU - Galvão Novaes, A.
AU - Flausino dos Santos, A.
PY - 2015
SP - 593
EP - 602
DO - 10.5220/0005364505930602
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic