Revisiting simulated annealing: a component-based analysis (Q1725612): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ranger / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: emili / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMAC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Paramils / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: irace / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATenstein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903754058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to MCMC for machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Producing School Timetables on a Computer and their Application to other Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing and tabu search in the long run: A comparison on QAP tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3064527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Simulated Annealing for Function Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The late acceptance hill-climbing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing: Searching for an Optimal Temperature Schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Annealing With An Optimal Fixed Temperature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Ideas for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5527536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating and accelerating tabu search, simulated annealing, and genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manufacturing Scheduling Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooling Schedules for Optimal Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing - to cool or not / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Practice of Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: ParamILS: An Automatic Algorithm Configuration Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: CLASS: Computerized LAyout Solutions using Simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques Elude the Metropolis Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of generalized hill climbing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATenstein: automatically building local search SAT solvers from components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified ant colony optimization algorithm for continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically improving the anytime behaviour of optimisation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of static simulated annealing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search methods for the flowshop scheduling problem with flowtime minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics—the metaphor exposed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for manufacturing systems layout design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of finite length annealing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing algorithm for allocating space to manufacturing cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank

Latest revision as of 07:06, 18 July 2024

scientific article
Language Label Description Also known as
English
Revisiting simulated annealing: a component-based analysis
scientific article

    Statements

    Revisiting simulated annealing: a component-based analysis (English)
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    simulated annealing
    0 references
    metaheuristics
    0 references
    stochastic local search
    0 references
    automatic algorithm design
    0 references
    experimental analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references