A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems

DOI10.1023/A:1018900128545zbMATH Open0922.90112OpenAlexW257818446MaRDI QIDQ1290170FDOQ1290170

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

zbMATH Keywords

simulated annealingset-coveringmorphing procedure

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (16)

• Solving the wire-harness design problem at a European car manufacturer
• 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
• A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• The robust set covering problem with interval data
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic
• An improved configuration checking-based algorithm for the unicost set covering problem
• A binary monkey search algorithm variation for solving the set covering problem
• A hybrid heuristic for the set covering problem
• A set covering approach for multi-depot train driver scheduling
• Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
• 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
• Variable employee productivity in workforce scheduling

   Recommendations

• Note: A local-search heuristic for large set-covering problems 👍 👎
• A heuristic algorithm for the set covering problem 👍 👎
• A morph-based simulated annealing heuristic for a modified bin-packing problem 👍 👎
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) 👍 👎

This page was built for publication: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290170)