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

Detalhes bibliográficos
Autor(a) principal: Prata, Bruno de Athayde
Data de Publicação: 2013
Tipo de documento: Artigo
Idioma: por
Título da fonte: Sistemas & Gestão
Texto Completo: https://www.revistasg.uff.br/sg/article/view/V8N3A5
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.
id UFF-13_7c91bb89dc614a0f092fd12ed68bd8ff
oai_identifier_str oai:ojs.www.revistasg.uff.br:article/357
network_acronym_str UFF-13
network_name_str Sistemas & Gestão
repository_id_str
spelling Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of StudyNowadays, 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.ABEC2013-09-30info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://www.revistasg.uff.br/sg/article/view/V8N3A510.7177/sg.2013.V8.N3.A5Sistemas & Gestão; v. 8 n. 3 (2013): Setembro/2013; 266-2751980-516010.7177/sg.2013.v8.n3reponame:Sistemas & Gestãoinstname:Universidade Federal Fluminense (UFF)instacron:UFFporhttps://www.revistasg.uff.br/sg/article/view/V8N3A5/V8N3A5Copyright (c) 2015 Sistemas & Gestãoinfo:eu-repo/semantics/openAccessPrata, Bruno de Athayde2023-01-09T18:18:58Zoai:ojs.www.revistasg.uff.br:article/357Revistahttps://www.revistasg.uff.br/sgPUBhttps://www.revistasg.uff.br/sg/oai||sg.revista@gmail.com|| periodicos@proppi.uff.br1980-51601980-5160opendoar:2023-01-09T18:18:58Sistemas & Gestão - Universidade Federal Fluminense (UFF)false
dc.title.none.fl_str_mv Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
title Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
spellingShingle Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
Prata, Bruno de Athayde
title_short Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
title_full Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
title_fullStr Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
title_full_unstemmed Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
title_sort Using a Maximal Covering Approach for the Vehicle and Crew Scheduling: A Case of Study
author Prata, Bruno de Athayde
author_facet Prata, Bruno de Athayde
author_role author
dc.contributor.author.fl_str_mv Prata, Bruno de Athayde
description 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.
publishDate 2013
dc.date.none.fl_str_mv 2013-09-30
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://www.revistasg.uff.br/sg/article/view/V8N3A5
10.7177/sg.2013.V8.N3.A5
url https://www.revistasg.uff.br/sg/article/view/V8N3A5
identifier_str_mv 10.7177/sg.2013.V8.N3.A5
dc.language.iso.fl_str_mv por
language por
dc.relation.none.fl_str_mv https://www.revistasg.uff.br/sg/article/view/V8N3A5/V8N3A5
dc.rights.driver.fl_str_mv Copyright (c) 2015 Sistemas & Gestão
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2015 Sistemas & Gestão
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv ABEC
publisher.none.fl_str_mv ABEC
dc.source.none.fl_str_mv Sistemas & Gestão; v. 8 n. 3 (2013): Setembro/2013; 266-275
1980-5160
10.7177/sg.2013.v8.n3
reponame:Sistemas & Gestão
instname:Universidade Federal Fluminense (UFF)
instacron:UFF
instname_str Universidade Federal Fluminense (UFF)
instacron_str UFF
institution UFF
reponame_str Sistemas & Gestão
collection Sistemas & Gestão
repository.name.fl_str_mv Sistemas & Gestão - Universidade Federal Fluminense (UFF)
repository.mail.fl_str_mv ||sg.revista@gmail.com|| periodicos@proppi.uff.br
_version_ 1798320142954790912

Registros relacionados