A tabu search heuristic for the equitable coloring problem

Autores
Méndez-díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
Fil: Méndez-díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Materia
Combinatorial Optimization
Equitable Coloring
Tabu Search
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/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/29979
Acceder
id CONICETDig_d501d22618e199cd67673e3df2788b1d
oai_identifier_str oai:ri.conicet.gov.ar:11336/29979
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A tabu search heuristic for the equitable coloring problemMéndez-díaz, IsabelNasini, Graciela LeonorSeverin, Daniel EstebanCombinatorial OptimizationEquitable ColoringTabu Searchhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.Fil: Méndez-díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; ArgentinaFil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaSpringer-v D I Verlag Gmbh2014-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/29979Méndez-díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A tabu search heuristic for the equitable coloring problem; Springer-v D I Verlag Gmbh; Lecture Notes in Computer Science; 8596; 3-2014; 347-3580302-9743CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-09174-7_30info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-09174-7_30info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:57:34Zoai:ri.conicet.gov.ar:11336/29979instacron: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-09-03 09:57:35.267CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A tabu search heuristic for the equitable coloring problem
title A tabu search heuristic for the equitable coloring problem
spellingShingle A tabu search heuristic for the equitable coloring problem
Méndez-díaz, Isabel
Combinatorial Optimization
Equitable Coloring
Tabu Search
title_short A tabu search heuristic for the equitable coloring problem
title_full A tabu search heuristic for the equitable coloring problem
title_fullStr A tabu search heuristic for the equitable coloring problem
title_full_unstemmed A tabu search heuristic for the equitable coloring problem
title_sort A tabu search heuristic for the equitable coloring problem
dc.creator.none.fl_str_mv Méndez-díaz, Isabel
Nasini, Graciela Leonor
Severin, Daniel Esteban
author Méndez-díaz, Isabel
author_facet Méndez-díaz, Isabel
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 Combinatorial Optimization
Equitable Coloring
Tabu Search
topic Combinatorial Optimization
Equitable Coloring
Tabu Search
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
Fil: Méndez-díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina
Fil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
Fil: Severin, Daniel Esteban. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina
description The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem, current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic methods. In this paper we present a tabu search heuristic for the Equitable Coloring Problem. This algorithm is an adaptation of the dynamic TabuCol version of Galinier and Hao. In order to satisfy equity constraints, new local search criteria are given. Computational experiments are carried out in order to find the best combination of parameters involved in the dynamic tenure of the heuristic. Finally, we show the good performance of our heuristic over known benchmark instances.
publishDate 2014
dc.date.none.fl_str_mv 2014-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/29979
Méndez-díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A tabu search heuristic for the equitable coloring problem; Springer-v D I Verlag Gmbh; Lecture Notes in Computer Science; 8596; 3-2014; 347-358
0302-9743
CONICET Digital
CONICET
url http://hdl.handle.net/11336/29979
identifier_str_mv Méndez-díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A tabu search heuristic for the equitable coloring problem; Springer-v D I Verlag Gmbh; Lecture Notes in Computer Science; 8596; 3-2014; 347-358
0302-9743
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007%2F978-3-319-09174-7_30
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-09174-7_30
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer-v D I Verlag Gmbh
publisher.none.fl_str_mv Springer-v D I Verlag Gmbh
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_ 1842269470638211072
score 13.13397

Publicaciones similares