Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search

DOI10.1016/j.endm.2014.11.015zbMath1362.68259OpenAlexW2056882555MaRDI QIDQ2631238

Jose Torres-Jimenez, W. C. A. Pereira, Arturo Rodriguez-Cristerna, Walter Gómez Bofill

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.015

zbMATH Keywords

simulated annealingvariable neighborhood searchmixed covering arrays

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Optimization by Simulated Annealing
• A survey of binary covering arrays
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• Variable neighborhood search
• A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays
• Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
• CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
• Variable Neighborhood Search
• Unnamed Item

This page was built for publication: Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search