Useful Links
Systems Science
Operations Research
1. Introduction to Operations Research
2. Mathematical Preliminaries
3. Linear Programming
4. Transportation and Assignment Problems
5. Network Optimization Models
6. Integer Programming
7. Nonlinear Programming
8. Dynamic Programming
9. Stochastic Processes and Markov Chains
10. Queueing Theory
11. Inventory Theory
12. Simulation
13. Decision Analysis
14. Heuristics and Metaheuristics
Heuristics and Metaheuristics
Introduction to Heuristic Methods
Exact vs. Approximate Methods
Quality vs. Efficiency Trade-offs
When to Use Heuristics
Construction Heuristics
Greedy Algorithms
Nearest Neighbor Heuristics
Savings Algorithms
Insertion Heuristics
Local Search Methods
Neighborhood Structures
Hill Climbing
Local Optima Problems
Multi-Start Methods
Metaheuristic Frameworks
Simulated Annealing
Cooling Schedules
Acceptance Probability
Parameter Tuning
Tabu Search
Tabu Lists
Memory Structures
Aspiration Criteria
Intensification and Diversification
Genetic Algorithms
Representation and Encoding
Selection Methods
Crossover Operators
Mutation Operators
Population Management
Ant Colony Optimization
Pheromone Trails
Construction Procedures
Pheromone Update Rules
Parameter Settings
Particle Swarm Optimization
Particle Representation
Velocity Updates
Position Updates
Swarm Topology
Hybrid Methods
Combining Exact and Heuristic Methods
Multi-Level Approaches
Matheuristics
Performance Evaluation
Solution Quality Assessment
Computational Efficiency
Statistical Testing
Benchmarking
Previous
13. Decision Analysis
Go to top
Back to Start
1. Introduction to Operations Research