Hybrid simulated annealing with memory: an evolution-based diversification approach
From MaRDI portal
Publication:3163188
DOI10.1080/00207540903055685zbMath1197.90193OpenAlexW2091706292MaRDI QIDQ3163188
No author found.
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- A new adaptive multi-start technique for combinatorial global optimizations
- A genetic algorithm for the job shop problem
- Greedy randomized adaptive search procedures
- Some new results on simulated annealing applied to the job shop scheduling problem
- Future paths for integer programming and links to artificial intelligence
- Adaptive temperature control for simulated annealing: a comparative study
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach
- The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
- An effective hybrid optimization strategy for job-shop scheduling problems
- Adaptive memory programming: a unified view of metaheuristics
