AI-ordlista
Den kompletta ordlistan över AI
Local-Global Hybridization
Optimization strategy combining global exploration of the search space with intensive local exploitation to balance diversification and intensification.
Tabu Search with Learning
Enhanced variant of tabu search integrating adaptive learning mechanisms to dynamically adjust parameters and the tabu list.
GRASP with Path-Relinking
Hybrid algorithm combining greedy randomized adaptive construction with intensification through recombination of elite solutions to generate new high-quality solutions.
Variable Neighborhood Search Algorithm
Systematic metaheuristic exploring different neighborhood structures to escape local optima, often combined with other optimization techniques.
Ant Colony Optimization with Local Search
Hybridization of ant colony optimization with local search heuristics applied to constructed solutions to improve their quality.
Adaptive Simulated Annealing
Variant of simulated annealing integrating automatic adjustment mechanisms for temperature and acceptance criteria based on search history.
Hybrid Particle Swarm Optimization
Combination of PSO algorithm with evolutionary operators or local search to improve exploration-exploitation balance and avoid premature convergence.
Hybrid Multi-Objective Evolutionary Algorithm
Multi-objective optimization approach integrating local search mechanisms or decision preferences to guide convergence toward the Pareto front.
Branch and Bound with Heuristics
Exact algorithm enhanced by integrating heuristics to generate more efficient upper and lower bounds and accelerate the pruning of the search tree.
Hybrid Adaptive Randomized Greedy Algorithm
Extension of GRASP incorporating learning and memory mechanisms to dynamically adapt the restricted candidate list and construction parameters.
Hybrid Differential Optimization
Variant of the differential optimization algorithm combining mutation and crossover operators with local search techniques to accelerate convergence.
Hybrid Artificial Bee Colony Algorithm
Extension of ABC integrating adaptive local search strategies and improved information sharing mechanisms to optimize exploration.
Hybrid Iterated Local Search
Metaheuristic combining systematic solution perturbation with advanced acceptance heuristics and intelligent diversification strategies.
Simulated Annealing with Tabu Search
Synergistic hybridization combining the probabilistic acceptance mechanism of simulated annealing with the short-term memory of tabu search to avoid cycles.
Hybrid Neighborhood-Based Metaheuristic
Unified optimization framework combining different neighborhood structures and exploration strategies with learning mechanisms to adapt the search.
Hybrid Parallel Genetic Algorithm
Distributed approach integrating adaptive genetic operators and solution migration strategies between subpopulations to maintain genetic diversity.
Max-Min Hybrid Ant Colony
Advanced variant of ACO incorporating pheromone bounds and intelligent initialization mechanisms combined with post-optimization heuristics.