Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | , , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://hdl.handle.net/11449/220887 |
Resumo: | The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the algorithm constructs an initial feasible solution by solving a number of assignment problems. In the second phase, the algorithm attempts to improve the solution by two different procedures. One procedure takes the whole set of duties and divides them in a set of partial duties which are recombined. The other procedure seeks to improve single long duties by eliminating the overtime time and inserting it into another duty. Computational tests are performed using large-scale real-world data with more than 2,300 tasks and random instances extracted from real data. Three different objective functions are analyzed. The overall results indicate that the proposed approach is competitive to solve large BDSP. |
id |
UNSP_a1b52c0e84efb7da5c4356e4c9d14191 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/220887 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithmBus driver schedulingCrew managementHeuristicLarge real-world instancesTransportationThe bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the algorithm constructs an initial feasible solution by solving a number of assignment problems. In the second phase, the algorithm attempts to improve the solution by two different procedures. One procedure takes the whole set of duties and divides them in a set of partial duties which are recombined. The other procedure seeks to improve single long duties by eliminating the overtime time and inserting it into another duty. Computational tests are performed using large-scale real-world data with more than 2,300 tasks and random instances extracted from real data. Three different objective functions are analyzed. The overall results indicate that the proposed approach is competitive to solve large BDSP.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação AraucáriaUniversidade Estadual de MaringáUniversidade Estadual de São PauloUniversidade Estadual PaulistaUniversity of NottinghamUniversidade Estadual de São PauloUniversidade Estadual PaulistaCNPq: 306754/2015-0Universidade Estadual de Maringá (UEM)Universidade Estadual Paulista (UNESP)University of NottinghamConstantino, Ademir Aparecidode Mendonça Neto, Candido Ferreira Xavier [UNESP]de Araujo, Silvio Alexandre [UNESP]Landa-Silva, DarioCalvi, Rogériodos Santos, Allainclair Flausino2022-04-28T19:06:39Z2022-04-28T19:06:39Z2017-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article479-504Journal of Universal Computer Science, v. 23, n. 5, p. 479-504, 2017.0948-69680948-695Xhttp://hdl.handle.net/11449/2208872-s2.0-85025830248Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengJournal of Universal Computer Scienceinfo:eu-repo/semantics/openAccess2022-04-28T19:06:39Zoai:repositorio.unesp.br:11449/220887Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T19:06:39Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
title |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
spellingShingle |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm Constantino, Ademir Aparecido Bus driver scheduling Crew management Heuristic Large real-world instances Transportation |
title_short |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
title_full |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
title_fullStr |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
title_full_unstemmed |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
title_sort |
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm |
author |
Constantino, Ademir Aparecido |
author_facet |
Constantino, Ademir Aparecido de Mendonça Neto, Candido Ferreira Xavier [UNESP] de Araujo, Silvio Alexandre [UNESP] Landa-Silva, Dario Calvi, Rogério dos Santos, Allainclair Flausino |
author_role |
author |
author2 |
de Mendonça Neto, Candido Ferreira Xavier [UNESP] de Araujo, Silvio Alexandre [UNESP] Landa-Silva, Dario Calvi, Rogério dos Santos, Allainclair Flausino |
author2_role |
author author author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual de Maringá (UEM) Universidade Estadual Paulista (UNESP) University of Nottingham |
dc.contributor.author.fl_str_mv |
Constantino, Ademir Aparecido de Mendonça Neto, Candido Ferreira Xavier [UNESP] de Araujo, Silvio Alexandre [UNESP] Landa-Silva, Dario Calvi, Rogério dos Santos, Allainclair Flausino |
dc.subject.por.fl_str_mv |
Bus driver scheduling Crew management Heuristic Large real-world instances Transportation |
topic |
Bus driver scheduling Crew management Heuristic Large real-world instances Transportation |
description |
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A deterministic 2-phase heuristic algorithm is proposed using multiple assignment problems that arise from a model based on a weighted multipartite graph. In the first phase, the algorithm constructs an initial feasible solution by solving a number of assignment problems. In the second phase, the algorithm attempts to improve the solution by two different procedures. One procedure takes the whole set of duties and divides them in a set of partial duties which are recombined. The other procedure seeks to improve single long duties by eliminating the overtime time and inserting it into another duty. Computational tests are performed using large-scale real-world data with more than 2,300 tasks and random instances extracted from real data. Three different objective functions are analyzed. The overall results indicate that the proposed approach is competitive to solve large BDSP. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-01-01 2022-04-28T19:06:39Z 2022-04-28T19:06:39Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
Journal of Universal Computer Science, v. 23, n. 5, p. 479-504, 2017. 0948-6968 0948-695X http://hdl.handle.net/11449/220887 2-s2.0-85025830248 |
identifier_str_mv |
Journal of Universal Computer Science, v. 23, n. 5, p. 479-504, 2017. 0948-6968 0948-695X 2-s2.0-85025830248 |
url |
http://hdl.handle.net/11449/220887 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Journal of Universal Computer Science |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
479-504 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1803046384552640512 |