D. E. Urueta-Hinojosa, Pedro Lara-Velázquez, M. Gutiérrez-Ándrade, S. De-Los-Cobos-Silva, E. Rincón-García, R. Mora-Gutiérrez, Antonin Ponsich
{"title":"Classic colouring problems as special cases of the soft graph colouring model","authors":"D. E. Urueta-Hinojosa, Pedro Lara-Velázquez, M. Gutiérrez-Ándrade, S. De-Los-Cobos-Silva, E. Rincón-García, R. Mora-Gutiérrez, Antonin Ponsich","doi":"10.1504/IJTPM.2019.10022279","DOIUrl":null,"url":null,"abstract":"Colouring problems can model different problems in the real world. Among the problems of colouring we have the Soft Graph Colouring, in which, given an undirected complete graph with weights on its edges (penalisations), we search to reduce the sum of the penalisations between two vertices painted with the same colour. Also, we have the classic colouring problems, which includes: minimal, weak, equitable and robust colouring. The objective of this work is to develop an integrative model that solves the classic colouring problems through the Soft Graph Colouring model and GRASP metaheuristic algorithm, using particular instances to each colouring problem that allow to compare how efficient the proposed model is; so will be possible to observe the behaviour of Soft Graph Colouring solving other types of colouring problems.","PeriodicalId":55889,"journal":{"name":"International Journal of Technology, Policy and Management","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Technology, Policy and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJTPM.2019.10022279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 0
Abstract
Colouring problems can model different problems in the real world. Among the problems of colouring we have the Soft Graph Colouring, in which, given an undirected complete graph with weights on its edges (penalisations), we search to reduce the sum of the penalisations between two vertices painted with the same colour. Also, we have the classic colouring problems, which includes: minimal, weak, equitable and robust colouring. The objective of this work is to develop an integrative model that solves the classic colouring problems through the Soft Graph Colouring model and GRASP metaheuristic algorithm, using particular instances to each colouring problem that allow to compare how efficient the proposed model is; so will be possible to observe the behaviour of Soft Graph Colouring solving other types of colouring problems.
期刊介绍:
IJTPM is a refereed international journal that provides a professional and scholarly forum in the emerging field of decision making and problem solving in the integrated area of technology policy and management at the operational, organisational and public policy levels.