Methods

Constructive Heuristics

Foundations and Principles Constructive heuristics represent a fundamental class of solution methods for combinatorial optimization problems, characterized by their incremental approach to building solutions. Unlike improvement methods that require complete initial solutions, constructive algorithms start with an empty solution and progressively build a complete one by adding components according to specific decision rules.

GRASP

GRASP: Greedy Randomized Adaptive Search Procedure GRASP, or Greedy Randomized Adaptive Search Procedure, is a multi-start metaheuristic designed to solve combinatorial optimization problems. It combines the greedy construction of solutions with randomization and local search, offering a balance between exploration and exploitation of the search space.

Local Search

Local Search: Core Concepts and Advanced Strategies Local Search is a fundamental metaheuristic used to solve combinatorial and continuous optimization problems. Rather than exploring the entire solution space, Local Search operates by iteratively moving from a solution to a neighboring solution in the hope of improving the objective value.

VNS

Variable Neighborhood Search (VNS) Variable Neighborhood Search (VNS) is a powerful metaheuristic introduced by Mladenović and Hansen (1997) for solving combinatorial and global optimization problems. The main idea is simple but effective: systematically change the neighborhood structures within a local search to escape local optima and explore the search space more thoroughly.