A general meta-heuristic based solver for combinatorial optimisation problems

DOI10.1023/A:1011211220465MaRDI QIDQ5947150zbMATH OpenOpenAlexFDO

Authors Marcus Randall, D. Abramson

Publication date 7 April 2002

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011211220465

zbMATH Keywords

combinatorial optimizationlinked listsmeta-heuristicsimulated annealingtabu search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Metaheuristics in combinatorial optimization
• scientific article; zbMATH DE number 2156299
• scientific article; zbMATH DE number 1487609
• Hybrid simulated annealing with memory: an evolution-based diversification approach
• Algorithmes génétiques hybrides pour l'optimisation combinatoire

Cited in

(8)

• A meta-control algorithm for generating approximate solutions to binary integer programming problems
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• New variable-length data compression scheme for solution representation of meta-heuristics
• An architecture for solving sequencing and resource allocation problems using approximation methods
• scientific article; zbMATH DE number 2084750 (Why is no real title available?)
• scientific article; zbMATH DE number 1488101 (Why is no real title available?)
• A computational study of local search algorithms for Italian high-school timetabling

Describes a project that uses

Uses Software

• TSPLIB
• QAPLIB
• OR-Library
• LOLIB
• ASA

This page was built for publication: A general meta-heuristic based solver for combinatorial optimisation problems

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