Operational Research 2 - PROJECT
-
Updated
Aug 28, 2020 - C
Operational Research 2 - PROJECT
The Categorized Orienteering Problem with Count-Dependent Profits (COPCDP)
Modeling with Linear/Integer/Binary Programming & Metaheuristics
TSP optimization, Operations Research 2 project, UniPD 2022/23
Solver of the Team Orienteering Problem (TOP) by several different approaches of the Variable Neighborhood Search (VNS).
These codes are part of MetaHeuristic Course. Algorithm of all these codes are taken from research paper.
Flaky Clustering Library (Minimum Sum-Of-Squares Clustering)
Variable neighborhood search used for solving Cell Formation problem
some basic (or advanced) heuristic algorithms applied in TSP
The Chinese Postman Problem with load-dependent costs
Metaheuristics for the generalized assignment problem written in JavaScript
A Vehicle Routing Problem optimized solution with Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND) and Simulated Annealing
Python bindings for OptFrame C++ Functional Core
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.
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."