Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study

Bruno de Athayde Prata

Resumo


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.


Texto completo:

PDF


DOI: https://doi.org/10.7177/sg.2013.V8.N3.A5

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

 

ISSN: 1980-5160

Rua Passo da Pátria 156, bloco E, sala Sistemas & Gestão, Escola de Engenharia, São Domingos, Niterói, RJ, CEP: 24210-240

Tel.: (21) 2629-5616

Correspondência: Caixa Postal LATEC: 100175, CEP 24.020-971, Niterói, RJ