A Vehicle Routing Problem optimized solution with Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND) and Simulated Annealing
Heuristic Solver for the Multidimensional Knapsack Problem
These codes are part of MetaHeuristic Course. Algorithm of all these codes are taken from research paper.
Artificial Intelligence Lab
This repo is created as a part of Aritificial Intelligence course at my college and contains implementations of some AI algorithms from scratch.
Construction Heuristics, Local Search, VND, GRASP and GVNS applied to the Minimum Wieghted Crossings with Constraints Problem (MWCCP)
Add a description, image, and links to the variable-neighbourhood-descent topic page so that developers can more easily learn about it.
To associate your repository with the variable-neighbourhood-descent topic, visit your repo's landing page and select "manage topics."