Scatter search for the soft graph colouring problem

Hugo Eduardo Vásquez-Calderón, Pedro Lara-Velázquez, Sergio Gerardo De-los-Cobos-Silva, Miguel A. Gutiérrez-Andrade, Eric Alfredo Rincón-García, Roman Anselmo Mora-Gutiérrez and Antonin Ponsich

International Journal of Business Continuity and Risk Management, 2018, vol. 8, issue 3, 200-218

Abstract: The soft graph colouring problem is a model that has been used to solve problems such as scheduling under uncertainty, assignment of frequencies in the radioelectric spectrum, and pattern recognition that in certain problems can deal with risky items susceptible of error I or error II. This problem is NP-hard and requires efficient metaheuristic algorithms in order to solve it. In this paper, a scatter search algorithm is proposed and developed. This algorithm gives the best solutions in the test instances used to this day.

Keywords: scatter search; graph colouring; heuristic; optimisation. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=94169 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbcrm:v:8:y:2018:i:3:p:200-218

Access Statistics for this article

More articles in International Journal of Business Continuity and Risk Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().