Scatter search for the soft graph colouring problem
by 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; Antonin Ponsich
International Journal of Business Continuity and Risk Management (IJBCRM), Vol. 8, No. 3, 2018

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.

Online publication date: Mon, 20-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Continuity and Risk Management (IJBCRM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com