There are 1 repository under local-search topic.
AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
A curated list of amazingly awesome local seo resources.
A Java library of Customizable, Hybridizable, Iterative, Parallel, Stochastic, and Self-Adaptive Local Search Algorithms
Amazing Collection Vehicle Routing Problem
Functions, examples and data from the first and the second edition of "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2019, ISBN:978-0128150658). This repository mirrors https://gitlab.com/NMOF/NMOF .
Solver for Capacitance Vehicle Routing Problem - School bus routing problem with bus stop selection
A metaheuristic optimization framework
A Julia package to manage Constraint-Based Local Search (CBLS) solvers.
Java Constraint Solvers for Vehicle Routing Problem (VRP)
The research work on Vehicle Routing Problem (VRP) solving via Artifical Bee colony algorithm
Python/Numba implemenation of of Lin-Kernighan-style TSP solver
:seedling: Genetic Algorithm, Memetic Algorithms, GRASP, Simulated Annealing, Multi start search, Reiterated Local Search, Local Search, Greedy and randomized Greedy
This is a n-queen problem solver using local search algorithms.
Implementation of local search-based algorithms for solving SAT and Max-SAT in Python
Python bindings for OptFrame C++ Functional Core
The research work on local search algorithms
Metaheuristic solver for nurse rostering problem. ( http://mobiz.vives.be/inrc2/ )
Open Shop Scheduling Problem resolution via Ant Colony Optimization algorithm.
An Introduction to Optimization Algorithms
Simple local file finder / Простой локальный поисковик файлов
The source code examples for the book "An Introduction to Optimization Algorithms"
EVRPTW resolution with Ant Colony Optimization
Project on Ant Colony Optimization applied to the Flow Shop Problem
A book on optimization algorithms.
An implementation of a local-search-based heuristic for the symmetric travelling salesman problem (TSP), using the Lin-Kernighan neighborhood.