Heuristics and metaheuristics for green vehicle routing problem (GVRP) using python implementing the following algorithms:
- Greedy Randomized Adaptative Search Procedure (GRASP)
- Variable Neighbourhood Search (VNS) to solve Travelling Salesman Problems, TSPs, inside VRP.
- In VNS we use Local Search with 2OPT and 3OPT neighbour structure.
- Greedy path clustering algorithm.
Instances are adaptade from literature. Plot .csv files with plot.py script.