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

DOI10.1023/A:1018900128545MaRDI QIDQ1290170zbMATH OpenOpenAlexFDO

Authors Michael J. Brusco, Larry W. Jacobs, Gary M. Thompson

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)

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)

Cited in

(16)

• 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
• The robust set covering problem with interval data
• A 3-flip neighborhood local search for the set covering problem
• Solving the wire-harness design problem at a European car manufacturer
• The set covering problem revisited: an empirical study of the value of dual information
• A hybrid heuristic for the set covering problem
• The impact of a new formulation when solving the set covering problem using the ACO metaheuristic
• A set covering approach for multi-depot train driver scheduling
• A hybrid simulated annealing/linear programming approach for the cover printing problem
• 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 binary monkey search algorithm variation for solving the set covering problem
• Variable employee productivity in workforce scheduling
• An improved configuration checking-based algorithm for the unicost set covering problem
• Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities

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)