Hybrid Metaheuristics: An Introduction
From MaRDI portal
Publication:2950517
DOI10.1007/978-3-540-78295-7_1zbMath1415.90150OpenAlexW1505338788MaRDI QIDQ2950517
Publication date: 9 October 2015
Published in: Hybrid Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78295-7_1
Related Items (9)
A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ Recent Advances of Nature-Inspired Metaheuristic Optimization ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ Human urbanization algorithm: a novel metaheuristic approach ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ On the performance of scatter search for post-enrolment course timetabling problems ⋮ A New Nature-Inspired Hybrid Algorithm with a Penalty Method to Solve Constrained Problem ⋮ A new hybrid algorithm for continuous optimization problem
Uses Software
Cites Work
- Optimization by Simulated Annealing
- An improved annealing scheme for the QAP
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- A framework for the description of evolutionary algorithms
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Greedy randomized adaptive search procedures
- Solution of the cumulative assignment problem with a well-structured tabu search method
- Guided local search and its application to the traveling salesman problem
- Future paths for integer programming and links to artificial intelligence
- Combining the scalability of local search with the pruning techniques of systematic search
- Genetic algorithms: Principles and perpectives. A guide to GA theory
- Optimization software class libraries
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
- Combining simulated annealing with local search heuristics
- Metaheuristics: A bibliography
- A taxonomy of evolutionary algorithms in combinatorial optimization
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part II
- Variable neighborhood search for the p-median
- The Reactive Tabu Search
- A GRASP for graph planarization
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Local Search and Constraint Programming
- Parallel Strategies for Meta-Heuristics
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Cut Size Statistics of Graph Bisection Heuristics
- Symmetry Breaking and Local Search Spaces
- Algorithmic aspects in speech recognition
- Parallel Metaheuristics
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hybrid Metaheuristics: An Introduction
