Planning the Workday of Bus Drivers by a Graph List-Coloring Model

In this work, we address the problem of planning the workday of bus drivers in argentinian intercity bus transport companies. In particular, we focus on a company which needs to fulfill roughly 800 trips per day between 3 cities of the Province of Buenos Aires with a stuff of around 200 drivers and...

ver descrição completa

Detalhes bibliográficos
Autores: Lucci, M., Nasini, G., Severín, D.
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:2018
País:Argentina
Recursos:Universidad Nacional de La Plata
Repositório:SEDICI (UNLP)
Idioma:espanhol
OAI Identifier:oai:sedici.unlp.edu.ar:10915/135196
Acesso em linha:http://sedici.unlp.edu.ar/handle/10915/135196
Access Level:Acceso aberto
Palavra-chave:Ciencias Informáticas
Integer programming model
Graph coloring
Heuristics
Planning workday of bus drivers
id AR_8b9f17d4cf566442e7791ada124ff8f4
oai_identifier_str oai:sedici.unlp.edu.ar:10915/135196
network_acronym_str AR
network_name_str Argentina
repository_id_str
spelling Planning the Workday of Bus Drivers by a Graph List-Coloring ModelLucci, M.Nasini, G.Severín, D.Ciencias InformáticasInteger programming modelGraph coloringHeuristicsPlanning workday of bus driversIn this work, we address the problem of planning the workday of bus drivers in argentinian intercity bus transport companies. In particular, we focus on a company which needs to fulfill roughly 800 trips per day between 3 cities of the Province of Buenos Aires with a stuff of around 200 drivers and 100 buses. Planning consists of assigning one driver to each trip in a way the driver performs all the trips without scheduling conflicts and minimizing the overall amount of overtime among all bus drivers. We model the problem as a particular Graph Coloring Problem and we propose an Integer Linear Programming formulation. Computations experiments show that this formulation outperforms other ones given in the literature for the same problem. In order to address large instances as the one given by the company, we also propose a heuristic algorithm that delivers better solutions than the company actually uses in a reasonably amount of time. The heuristic has two phases where the first one constructs an initial solution and the second one improves the solution iteratively.Sociedad Argentina de Informática e Investigación Operativa2018-04-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf77-91http://sedici.unlp.edu.ar/handle/10915/135196spainfo:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/47info:eu-repo/semantics/altIdentifier/issn/1514-6774info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2024-05-08T13:12:27Zoai:sedici.unlp.edu.ar:10915/135196Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292024-05-08 13:12:28.037SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Planning the Workday of Bus Drivers by a Graph List-Coloring Model
title Planning the Workday of Bus Drivers by a Graph List-Coloring Model
spellingShingle Planning the Workday of Bus Drivers by a Graph List-Coloring Model
Lucci, M.
Ciencias Informáticas
Integer programming model
Graph coloring
Heuristics
Planning workday of bus drivers
title_short Planning the Workday of Bus Drivers by a Graph List-Coloring Model
title_full Planning the Workday of Bus Drivers by a Graph List-Coloring Model
title_fullStr Planning the Workday of Bus Drivers by a Graph List-Coloring Model
title_full_unstemmed Planning the Workday of Bus Drivers by a Graph List-Coloring Model
title_sort Planning the Workday of Bus Drivers by a Graph List-Coloring Model
dc.creator.none.fl_str_mv Lucci, M.
Nasini, G.
Severín, D.
author Lucci, M.
author_facet Lucci, M.
Nasini, G.
Severín, D.
author_role author
author2 Nasini, G.
Severín, D.
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Integer programming model
Graph coloring
Heuristics
Planning workday of bus drivers
topic Ciencias Informáticas
Integer programming model
Graph coloring
Heuristics
Planning workday of bus drivers
description In this work, we address the problem of planning the workday of bus drivers in argentinian intercity bus transport companies. In particular, we focus on a company which needs to fulfill roughly 800 trips per day between 3 cities of the Province of Buenos Aires with a stuff of around 200 drivers and 100 buses. Planning consists of assigning one driver to each trip in a way the driver performs all the trips without scheduling conflicts and minimizing the overall amount of overtime among all bus drivers. We model the problem as a particular Graph Coloring Problem and we propose an Integer Linear Programming formulation. Computations experiments show that this formulation outperforms other ones given in the literature for the same problem. In order to address large instances as the one given by the company, we also propose a heuristic algorithm that delivers better solutions than the company actually uses in a reasonably amount of time. The heuristic has two phases where the first one constructs an initial solution and the second one improves the solution iteratively.
publishDate 2018
dc.date.none.fl_str_mv 2018-04-04
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/135196
url http://sedici.unlp.edu.ar/handle/10915/135196
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://publicaciones.sadio.org.ar/index.php/EJS/article/view/47
info:eu-repo/semantics/altIdentifier/issn/1514-6774
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
Creative Commons Attribution 4.0 International (CC BY 4.0)
dc.format.none.fl_str_mv application/pdf
77-91
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1799194458841939968
score 15,228081

Registros relacionados