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

A Reactive Tabu Search algorithm with variable clustering for the Unicost Set Covering Problem

Author

Listed:
  • Gary W. Kinney
  • J. Wesley Barnes
  • Bruce W. Colletti

Abstract

We develop a Reactive Tabu Search (RTS) algorithm for solving the Unicost Set Covering Problem (SCP) – USCP-TS. We solve a Linear Programming (LP) relaxation of the problem and use the LP optimum to construct a quality solution profile. We cluster the problem variables based on this profile and partition the solution space into orbits. We tested our algorithm on 65 benchmark problems and compared the results against the previous best-known solutions and those obtained by CPLEX 9.0 under varied settings. USCP-TS outperforms CPLEX in solution quality for 32 of the problems and achieves the same solution as CPLEX faster on 21 of the remaining problems.

Suggested Citation

  • Gary W. Kinney & J. Wesley Barnes & Bruce W. Colletti, 2007. "A Reactive Tabu Search algorithm with variable clustering for the Unicost Set Covering Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(2), pages 156-172.
    • Handle: RePEc:ids:ijores:v:2:y:2007:i:2:p:156-172
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=12458
    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.

    Citations

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


    Cited by:

    1. Chih-Wei Lin & Yu Hong & Weihao Tu & Jinfu Liu, 2022. "Multiperiod Dynamic Programming Algorithm for Optimizing a Nature Reserve," Sustainability, MDPI, vol. 14(6), pages 1-17, March.

    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:2:y:2007:i:2:p:156-172. 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.