Useful Links
Systems Science
Optimization Theory
1. Foundations of Optimization
2. Mathematical Foundations
3. Unconstrained Optimization
4. Constrained Optimization Theory
5. Linear Programming
6. Nonlinear Programming
7. Integer and Combinatorial Optimization
8. Dynamic Programming
9. Stochastic Optimization
10. Heuristic and Metaheuristic Methods
11. Multi-Objective Optimization
12. Specialized Optimization Topics
13. Applications and Case Studies
14. Computational Aspects and Software
Heuristic and Metaheuristic Methods
Local Search Algorithms
Hill Climbing
Steepest Ascent
First Improvement
Random Restart
Simulated Annealing
Cooling Schedules
Acceptance Probability
Parameter Tuning
Tabu Search
Tabu List Management
Aspiration Criteria
Intensification and Diversification
Variable Neighborhood Search
Population-Based Metaheuristics
Genetic Algorithms
Representation and Encoding
Selection Mechanisms
Tournament Selection
Roulette Wheel Selection
Rank-Based Selection
Crossover Operators
Single-Point Crossover
Multi-Point Crossover
Uniform Crossover
Mutation Operators
Replacement Strategies
Evolution Strategies
(μ + λ) and (μ, λ) Strategies
Self-Adaptation
Covariance Matrix Adaptation
Particle Swarm Optimization
Velocity and Position Updates
Inertia Weight
Acceleration Coefficients
Topology and Neighborhoods
Ant Colony Optimization
Pheromone Trail Updates
Heuristic Information
Ant System Variants
Differential Evolution
Mutation and Crossover
Parameter Control
Hybrid Approaches
Memetic Algorithms
Matheuristics
Large Neighborhood Search
Variable Neighborhood Descent
Performance Analysis
Convergence Properties
Parameter Sensitivity
Benchmarking and Comparison
No Free Lunch Theorems
Previous
9. Stochastic Optimization
Go to top
Next
11. Multi-Objective Optimization