IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/578541.html
   My bibliography  Save this article

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Author

Listed:
  • Broderick Crawford
  • Ricardo Soto
  • Natalia Berríos
  • Franklin Johnson
  • Fernando Paredes
  • Carlos Castro
  • Enrique Norero

Abstract

The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

Suggested Citation

  • Broderick Crawford & Ricardo Soto & Natalia Berríos & Franklin Johnson & Fernando Paredes & Carlos Castro & Enrique Norero, 2015. "A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-8, July.
    • Handle: RePEc:hin:jnlmpe:578541
    DOI: 10.1155/2015/578541
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/578541.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/578541.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/578541?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:578541. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.