Planning the workday of bus drivers by a graph list-coloring model

Autores
Lucci, Mauro; Nasini, Graciela Leonor; Severin, Daniel Esteban
Año de publicación
2018
Idioma
español castellano
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fil: Lucci, Mauro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Materia
INTEGER PROGRAMMING MODELS
GRAPH COLORING
HEURISTICS
PLANNING WORKDAY OF BUS DRIVERS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/99612
Acceder
id CONICETDig_c82170b1c25d18104496bfe83f4778f9
oai_identifier_str oai:ri.conicet.gov.ar:11336/99612
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Planning the workday of bus drivers by a graph list-coloring modelLucci, MauroNasini, Graciela LeonorSeverin, Daniel EstebanINTEGER PROGRAMMING MODELSGRAPH COLORINGHEURISTICSPLANNING WORKDAY OF BUS DRIVERShttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In 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.Fil: Lucci, Mauro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Nasini, Graciela Leonor. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaSociedad Argentina de Informática E Investigación Operativa2018-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/99612Lucci, Mauro; Nasini, Graciela Leonor; Severin, Daniel Esteban; Planning the workday of bus drivers by a graph list-coloring model; Sociedad Argentina de Informática E Investigación Operativa; SADIO Electronic Journal of Informatic and Operation Research; 17; 1; 3-2018; 77-911514-6774CONICET DigitalCONICETspainfo:eu-repo/semantics/altIdentifier/url/https://sadio.org.ar/index.php/EJS/article/view/47info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:52:30Zoai:ri.conicet.gov.ar:11336/99612instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:52:31.252CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
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, Mauro
INTEGER PROGRAMMING MODELS
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, Mauro
Nasini, Graciela Leonor
Severin, Daniel Esteban
author Lucci, Mauro
author_facet Lucci, Mauro
Nasini, Graciela Leonor
Severin, Daniel Esteban
author_role author
author2 Nasini, Graciela Leonor
Severin, Daniel Esteban
author2_role author
author
dc.subject.none.fl_str_mv INTEGER PROGRAMMING MODELS
GRAPH COLORING
HEURISTICS
PLANNING WORKDAY OF BUS DRIVERS
topic INTEGER PROGRAMMING MODELS
GRAPH COLORING
HEURISTICS
PLANNING WORKDAY OF BUS DRIVERS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Lucci, Mauro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Nasini, Graciela Leonor. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
Fil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina
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-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
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://hdl.handle.net/11336/99612
Lucci, Mauro; Nasini, Graciela Leonor; Severin, Daniel Esteban; Planning the workday of bus drivers by a graph list-coloring model; Sociedad Argentina de Informática E Investigación Operativa; SADIO Electronic Journal of Informatic and Operation Research; 17; 1; 3-2018; 77-91
1514-6774
CONICET Digital
CONICET
url http://hdl.handle.net/11336/99612
identifier_str_mv Lucci, Mauro; Nasini, Graciela Leonor; Severin, Daniel Esteban; Planning the workday of bus drivers by a graph list-coloring model; Sociedad Argentina de Informática E Investigación Operativa; SADIO Electronic Journal of Informatic and Operation Research; 17; 1; 3-2018; 77-91
1514-6774
CONICET Digital
CONICET
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://sadio.org.ar/index.php/EJS/article/view/47
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Sociedad Argentina de Informática E Investigación Operativa
publisher.none.fl_str_mv Sociedad Argentina de Informática E Investigación Operativa
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846083053697368064
score 13.22299

Publicaciones similares