Hybrid simulated annealing with memory: an evolution-based diversification approach

DOI10.1080/00207540903055685MaRDI QIDQ3163188zbMATH OpenOpenAlexFDO

Authors

Publication date 25 October 2010

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540903055685

zbMATH Keywords

simulated annealinggenetic algorithmjob shop schedulingtabu searchevolution-based diversification

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1487516
• Foundations of Genetic Algorithms
• scientific article; zbMATH DE number 1424341
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem
• scientific article; zbMATH DE number 2068261
• A new hybrid differential evolution with simulated annealing and self-adaptive immune operation
• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report

Cites work

• scientific article; zbMATH DE number 2209652 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
• A genetic algorithm for the job shop problem
• A hybrid genetic algorithm for the job shop scheduling problem
• A new adaptive multi-start technique for combinatorial global optimizations
• A very fast TS/SA algorithm for the job shop scheduling problem
• Adaptive memory programming: a unified view of metaheuristics
• Adaptive temperature control for simulated annealing: a comparative study
• An effective hybrid optimization strategy for job-shop scheduling problems
• Applying tabu search to the job-shop scheduling problem
• Benchmarks for basic scheduling problems
• Future paths for integer programming and links to artificial intelligence
• Greedy randomized adaptive search procedures
• Job Shop Scheduling by Simulated Annealing
• Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Optimization by simulated annealing
• Some new results on simulated annealing applied to the job shop scheduling problem
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

Cited in

(4)

• scientific article; zbMATH DE number 1700039 (Why is no real title available?)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
• A proposal for a hybrid meta-strategy for combinatorial optimization problems
• A general meta-heuristic based solver for combinatorial optimisation problems

This page was built for publication: Hybrid simulated annealing with memory: an evolution-based diversification approach

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