IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v11y2011i2p136-159.html
   My bibliography  Save this article

A hybrid algorithm of simulated annealing and tabu search for graph colouring problem

Author

Listed:
  • Ali Pahlavani
  • Kourosh Eshghi

Abstract

The graph colouring problem, as an important NP-complete problem, is considered in this paper and a hybrid meta-heuristic approach is developed to solve it. The initial solution of the algorithm, generated by a heuristic method, is used by a simulated annealing (SA) approach to generate new solutions until no progress in a number of solutions reported. At this stage, the algorithm will use a tabu search routine and this local search operator will be followed for some iterations. After finding a better solution, the algorithm is again followed through SA. Efficiency of the algorithm is showed through various experiments on well-known benchmark problems of DIMACS. Comparison with the available algorithms shows considerable performance in terms of solution quality and computational time.

Suggested Citation

  • Ali Pahlavani & Kourosh Eshghi, 2011. "A hybrid algorithm of simulated annealing and tabu search for graph colouring problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 11(2), pages 136-159.
    • Handle: RePEc:ids:ijores:v:11:y:2011:i:2:p:136-159
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=40694
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:11:y:2011:i:2:p:136-159. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.