Amazing Collection Vehicle Routing Problem
-
Updated
Nov 22, 2019
Amazing Collection Vehicle Routing Problem
Solution quadratic assign problem via LS(local search), ILS(iterated local search), GLS(guided local search)
The research work on local search algorithms
laboratory works for combinatoric optimization course
Modeling with Linear/Integer/Binary Programming & Metaheuristics
Discrete Optimization Algorithms
Solving Vehicle Rounting Problem with Time Windows using multiple Classic Heuristic, Metaheuristic algorithms (Hybrid Genetic Search (HGS), Guided Local Search (GLS), Ant Colony Optimisation (ACO), Simulated Annealing (SA)), then comparing result's with each one's results and present it in the graph. This was my master's thesis project.
Add a description, image, and links to the guided-local-search topic page so that developers can more easily learn about it.
To associate your repository with the guided-local-search topic, visit your repo's landing page and select "manage topics."