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

A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families

Author

Listed:
  • Jose Torres-Jimenez
  • Idelfonso Izquierdo-Marquez

Abstract

Covering perfect hash families (CPHFs) are combinatorial designs that represent certain covering arrays in a compact way. In previous works, CPHFs have been constructed using backtracking, tabu search, and greedy algorithms. Backtracking is convenient for small CPHFs, greedy algorithms are appropriate for large CPHFs, and metaheuristic algorithms provide a balance between execution time and quality of solution for small and medium-size CPHFs. This work explores the construction of CPHFs by means of a simulated annealing algorithm. The neighborhood function of this algorithm is composed of three perturbation operators which together provide exploration and exploitation capabilities to the algorithm. As main computational results we have the generation of 64 CPHFs whose derived covering arrays improve the best-known ones. In addition, we use the simulated annealing algorithm to construct quasi-CPHFs from which quasi covering arrays are derived that are then completed and postoptimized; in this case the number of new covering arrays is 183. Together, the 247 new covering arrays improved the upper bound of 683 covering array numbers.

Suggested Citation

  • Jose Torres-Jimenez & Idelfonso Izquierdo-Marquez, 2018. "A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-14, July.
    • Handle: RePEc:hin:jnlmpe:1860673
    DOI: 10.1155/2018/1860673
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Wagner, Michael & Colbourn, Charles J. & Simos, Dimitris E., 2022. "In-Parameter-Order strategies for covering perfect hash families," Applied Mathematics and Computation, Elsevier, vol. 421(C).
    2. Jose Torres-Jimenez & Idelfonso Izquierdo-Marquez, 2024. "New Upper Bounds for Covering Arrays of Order Seven," Mathematics, MDPI, vol. 12(12), pages 1-15, June.

    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:1860673. 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.