Please use this identifier to cite or link to this item:
Title in Portuguese: Using a maximal covering approach for the vehicle and crew scheduling: a case of study
Author: Prata, Bruno de Athayde
Keywords: Agendamento de problemas
Programação mista
Cobertura de problemas
Agendamento de trocas de veículos
Issue Date: 2013
Publisher: Sistemas & Gestão
Citation: PRATA, B. A. (2013)
Abstract: Nowadays, the vehicle and crew scheduling is a hard and widely studied Combinatorial Optimization problem. Several studies have shown that exact approaches for resolution of the above mentioned problem are prohibitive due to high computational cost involved. This paper describes a new approach for vehicle and crew scheduling without changeovers (the change of a vehicle of a driver are forbidden) based on a maximum covering problem formulation. Computational results with bus and crew scheduling problems from companies of Fortaleza, located in Northeast of Brazil, are presented and discussed. The results indicate the applicability of the proposed approach.
Description: PRATA, B. A. Using a maximal covering approach for the vehicle and crew scheduling: a case of study. Sistemas & Gestão, v. 8, n. 3, p. 266-275, 2013.
metadata.dc.type: Artigo de Periódico
Appears in Collections:GESLOG - Artigos publicados em revistas científicas

Files in This Item:
File Description SizeFormat 
2013_art_baprata_using.pdf675,23 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.