Inglés (pdf)
Articulo en XML
Referencias del artículo
Traducción automática
Enviar articulo por email
Permalink
Ver contenido completo en pdf.
Servicios Personalizados
Revista
Articulo
Indicadores
-
Citado por SciELO -
Accesos
Links relacionados
-
Similares en
SciELO
Compartir
Revista de Matemática Teoría y Aplicaciones
versión impresa ISSN 1409-2433
Rev. Mat vol.23 no.2 San José jul./dic. 2016
Artículos
A hybrid algorithm for the robust graph coloring problem
Un algoritmo híbrido para el problema de coloración robusta de gráficas
1Universidad Autónoma Metropolitana-Azcapotzalco, Departamento de Sistemas, Av. San Pablo 180, Colonia Reynosa Tamaulipas, Ciudad de México, C.P. 02200, México. E-Mail:ing.romanmora@gmail.com
2Universidad Autónoma Metropolitana-Azcapotzalco, Departamento de Sistemas, Av. San Pablo 180, Colonia Reynosa Tamaulipas, Ciudad de México, C.P. 02200, México. E-Mail: jararo@correo.azc.uam.mx
3Universidad Autónoma Metropolitana-Azcapotzalco, Departamento de Sistemas, Av. San Pablo 180, Colonia Reynosa Tamaulipas, Ciudad de México, C.P. 02200, Mexico. E-Mail: rigaeral@correo.azc.uam.mx
4Universidad Autónoma Metropolitana-Azcapotzalco, Departamento de Sistemas, Av. San Pablo 180, Colonia Reynosa Tamaulipas, Ciudad de México, C.P. 02200, Mexico. E-Mail: aspo@correo.azc.uam.mx
5Universidad Autónoma Metropolitana-Azcapotzalco, Departamento de Sistemas, Av. San Pablo 180, Colonia Reynosa Tamaulipas, Ciudad de México, C.P. 02200, Mexico. E-Mail: clc@azc.uam.mx
A hybrid algorithm which combines mathematical programming techniques (Kruskal's algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem "CSP") and heuristic methods (musical composition method and DSATUR) to resolve the robust graph coloring problem (RGCP) is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.
Keywords: metaheuristics; combinatorial optimization; integer programming
En este artículo se propone un algoritmo híbrido que combina técnicas de programación matemática (algoritmo de Kruskal y la estrategia de mantener consistencia de arcos para resolver el problema de satisfacción de restricciones) y métodos heurísticos (método de composición musical y DSATUR) para resolver el problema de coloración robusta de gráficas (RGCP). Resultados experimentales muestran que este algorimo da mejores resultados que otros presentados en la literatura.
Palabras clave: metaheurísticas; optimización combinatoria; programación entera
References
Archetti, C.; Bianchessi, N.; Hertz, A. (2014) "A branch-and-price algorithm for the robust graph coloring problem", Discrete Applied Mathematics165(11): 49-59. [ Links ]
Berge, C.(1973) Graphes et Hypergraphes. Dunod, Paris. [ Links ]
Birattari, M.(2009) Tuning Metaheuristics: A Machine Learning Perspective. Springer, Berlin. [ Links ]
Brailsford, S.C.; Potts, C.N.; Smith, B.M.(1999) "Constraint satisfaction problems: Algorithms and applications", European Journal of Operational Research119(3): 557-581. [ Links ]
Brélaz, D.(1979) "New methods to color the vertices of a graph", Communications of the ACM22(4): 251-256. [ Links ]
Burke, E.; Jackson, K.; Kingston, J H.; Weare, R. (1997) "Automated university timetabling the state of the art", The Computer Journal40(9): 565-571. [ Links ]
Chams, M.; Hertz, A.; de Werra, D. (1987) "Some experiments with simulated annealing for coloring graphs", European Journal of Operational Research32(2): 260-266. [ Links ]
Feo, T.A.; Resende, M.G.C.(1995) "Greedy randomized adaptive search procedures", J. of Global Optimization6(2): 109-133. [ Links ]
Glover, F.(1986) "Future paths for integer programming and links to artificial intelligence", Computers and Operations Research13(5): 533-549. [ Links ]
Glover, F.; Laguna, M.: Martí, R. (2003) "Scatter search", in Advances in Evolutionary Computing, Springer Berlin Heidelberg: 519-537. [ Links ]
Guo, S.; Ying, K.; Lim, A.; Wang, F. (2004) "A new neighborhood based on improvement graph for robust graph coloring problem", in: G.I.Webb&X.Yu (Eds.) AI 2004: Advances in Artificial Intelligence, LNAI 3339, Springer, Berlin: 636-645. [ Links ]
Gutiérrez-Andrade, M.A.; Lara-Velázquez, P.; López-Bracho, R.; Ramírez-Rodríguez, J.(2010) "Heuristics for the robust coloring problem", Revista de Matemática: Teoría y Aplicaciones18(1): 137-147. [ Links ]
Gómez, D.; Montero, J.; Yáñez, J.; Poidomani, C.(2007) "A graph coloring approach for image segmentation", Omega 35(2): 173-183. [ Links ]
Kong, Y.; Wang, F.; Lim, A.; Guo, S. (2003) "A new hybrid genetic algorithm for the robust graph coloring problem", in: T.D.Gedeon&L.C.C.Fung (Eds.) Lecture Notes in Artificial Intelligence, Vol. 2903, Springer: 125-136. [ Links ]
Kruskal, J.B.(1956) "On the shortest spanning subtree of a graph and the traveling salesman problem", Proceedings of the American Mathematical Society7(1): 48-50. [ Links ]
Kumar, V.(1992) "Algorithms for constraint-satisfaction problems: A survey", AI magazine13(1): 32-44. [ Links ]
Lara-Velázquez, P.; Gutiérrez-Andrade, M.A.; Ramírez-Rodríguez, J.; López-Bracho, R. (2005) "Un algoritmo evolutivo para resolver el problema de coloración robusta", Revista de Matemática: Teoría y Aplicaciones 12(1-2): 111-120. [ Links ]
Laureano-Cruces, A.L.; Ramírez-Rodríguez, J.; Hernández-González, D.E.; Méndez-Gurrola, I.I. (2011) "An ant colony algorithm for the robust graph coloring problem", ICGST AIML-11 Conference, Dubai: 57-60. [ Links ]
Leus, R.; Herroelen, W.(2007) "Scheduling for stability in single-machine production systems", Journal of Scheduling10: 223-235. [ Links ]
Lim, A.; Wang, F. (2004) "Metaheuristics for robust graph coloring problem", Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004): 514-518. [ Links ]
Lim, A.; Wang, F.(2005) "Robust graph coloring for uncertain supply chain management", Proceedings of the 38th Hawaii International Conference on System Sciences: 1-10. [ Links ]
Liu, Z.(1998) Algorithms for Constraint Satisfaction Problems (CSPs). Master of Mathematics in Computer Science, University of Waterloo, Canada. [ Links ]
Maniezzo, V.; St´'utzle, T.; Voβ, S.(Editors) (2009) Matheuristics. Hybridizing Metaheuristics and Mathematical Programming, Volume 10. Springer, New York. [ Links ]
Martí, R.; Laguna, M. (2003) "Scatter search: Diseño básico y estrategias avanzadas", Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial7(19): 123-130. [ Links ]
Mora-Gutiérrez, R.A.; Ramírez-Rodríguez, J.; Rincón-García, E. (2012) "An optimization algorithm inspired by musical composition", Artificial Intelligence Review: 1-15. [ Links ]
Mora-Gutiérrez, R.A.; Ramírez-Rodríguez, J.; Rincón-García, E.; Ponsich, A.; Herrera, O. (2012) "An optimization algorithm inspired by social creativity systems", Computing 94(11): 887-914. [ Links ]
Mora-Gutiérrez, R.A. (2013) Diseño y Desarrollo de un Método Heurístico Basado en un Sistema Socio-Cultural de Creatividad para la Resolución de Problemas de Optimización Continuos no Lineales y Diseño de Zonas Electorales. Tesis de Doctorado, Universidad Nacional Autónoma de México, México. [ Links ]
Mora-GutiérrezR.A.; Rincón-García, E.A.; Ramírez-Rodríguez, J.; Ponsich, A.; Herrera-Alcántara, O.; Lara-Velázquez, P. (2013) "An optimization algorithm inspired by musical composition in constrained optimization problems", Revista de Matemática: Teoría y Aplicaciones 20(2): 183-202. [ Links ]
Mora-Gutiérrez, R.A.; Rincón-García, E.A.; Ramírez-Rodríguez, J.; Ponsich, A.; Herrera-Alcántara, O.; Lara-Velázquez, P. (2013) "Adaptation of the musical composition method for solving constrained optimization problems", Soft Computing18(10): 1931-1948. [ Links ]
Pardalos, P.; Mavridou, T.; Xue, J.(1998) "The graph coloring problem: A bibliographic survey", in: D.Z.Du&P.M.Pardalos(Eds.) Handbook of Combinatorial Optimization, Vol 2, Kluwer, New York: 331-395. [ Links ]
Ramírez-Rodríguez, J.(2001) Extensiones del Problema de Coloración de GrafosTesis de Doctorado, Universidad Complutense, Madrid, España. http://eprints.ucm.es/4479/ , accessed March 26, 2014. [ Links ]
Régin, J.C.(1994) "A filtering algorithm for constraints of difference in CSPs", Proceedings of AAAI, Vol. 1: 362-367. [ Links ]
Yáñez, J.; Ramírez, J. (2003) "The robust coloring problem", European Journal of Operational Research148(3): 546-558. [ Links ]
Wang, F.; Xu, Z.(2013) "Metaheuristics for robust graph coloring", Journal of Heuristics19(4): 529-548. [ Links ]
de Werra, D.(1996) "Extensions of coloring models for scheduling purposes", European Journal of Operations Research92(3): 474-492. [ Links ]
de Werra, D.(1996) "Some combinatorial models for course scheduling", in: E.Burke&P.Ross (Eds.) Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science 1153, Springer: 296-308. [ Links ]
Received: September 30, 2014; Revised: April 12, 2016; Accepted: April 28, 2016
This is an open-access article distributed under the terms of the Creative Commons Attribution License
