A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
From MaRDI portal
Publication:1290170
DOI10.1023/A:1018900128545zbMath0922.90112OpenAlexW257818446MaRDI QIDQ1290170
Gary M. Thompson, Larry W. Jacobs, Michael J. Brusco
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018900128545
Related Items (15)
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ The robust set covering problem with interval data ⋮ A hybrid heuristic for the set covering problem ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ A binary monkey search algorithm variation for solving the set covering problem ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ Solving the non-unicost set covering problem by using cuckoo search and black hole optimization ⋮ Variable employee productivity in workforce scheduling ⋮ A set covering approach for multi-depot train driver scheduling
This page was built for publication: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
