In this project, I implemented with Python the solutions of the scheduling problem using different methods, the metaheuristic : genetic algorithm and secondly the dynamic programming.
Python bindings for OptFrame C++ Functional Core
A Vehicle Routing Problem optimized solution with Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND) and Simulated Annealing
The Chinese Postman Problem with load-dependent costs
Metaheuristics for the generalized assignment problem written in JavaScript
some basic (or advanced) heuristic algorithms applied in TSP
Variable neighborhood search used for solving Cell Formation problem
Flaky Clustering Library (Minimum Sum-Of-Squares Clustering)
These codes are part of MetaHeuristic Course. Algorithm of all these codes are taken from research paper.
Solver of the Team Orienteering Problem (TOP) by several different approaches of the Variable Neighborhood Search (VNS).
TSP optimization, Operations Research 2 project, UniPD 2022/23
The Categorized Orienteering Problem with Count-Dependent Profits (COPCDP)
Modeling with Linear/Integer/Binary Programming & Metaheuristics
Source code for a Master Degree about the Multiple Multidimensional Knapsack Problem with Family-Split Penalties
Operational Research 2 - PROJECT
Add a description, image, and links to the variable-neighborhood-search topic page so that developers can more easily learn about it.
To associate your repository with the variable-neighborhood-search topic, visit your repo's landing page and select "manage topics."