OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Genetic Algorithm, Simulated Annealing, Tabu Search, Iterated Local Search, Variable Neighborhood Search, NSGA-II, Genetic Programming etc. Examples for Traveling Salesman, Vehicle Routing, Knapsack Problem, etMu

🌱 Genetic Algorithm, Memetic Algorithms, GRASP, Simulated Annealing, Multi start search, Reiterated Local Search, Local Search, Greedy and randomized Greedy

Scheduling maneuvers for the restoration of electric power distribution networks

Proyecto VOR del profesor Bernardi

A Greed Iterated Local Search with Variable Neighborhood Descent with Random neighborhood ordering for the Capacitated Vehicle Routing Problem

FiveA is a heuristic algorithm to solve the one-dimensional cut problem.

heurísticas: ILS, Simulated Annealing e Genetic Algorithm para o problema closest string

Iterated local search (ILS) and hybrid genetic search (HGS) for the hybrid electric vehicle - traveling salesman problem with time windows (HEVTSPTW). From "Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows. Computers & Operations Research, 155, 2023", by Yure Rocha & Anand Subramanian.