IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v117y2002i1p165-17410.1023-a1021573507189.html
   My bibliography  Save this article

Tabu Search with Simple Ejection Chains for Coloring Graphs

Author

Listed:
  • José González-Velarde
  • Manuel Laguna

Abstract

We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical results indicate that the proposed TS implementation outperforms other metaheuristic methods, including Simulated Annealing, a previous version of Tabu Search and a recent implementation of a Greedy Randomized Adaptive Search Procedure (GRASP). Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • José González-Velarde & Manuel Laguna, 2002. "Tabu Search with Simple Ejection Chains for Coloring Graphs," Annals of Operations Research, Springer, vol. 117(1), pages 165-174, November.
    • Handle: RePEc:spr:annopr:v:117:y:2002:i:1:p:165-174:10.1023/a:1021573507189
    DOI: 10.1023/A:1021573507189
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1021573507189
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1021573507189?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xinyun Wu & Shengfeng Yan & Xin Wan & Zhipeng Lü, 2016. "Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 445-468, August.

    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:spr:annopr:v:117:y:2002:i:1:p:165-174:10.1023/a:1021573507189. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.