Clustered Vehicle Routing Problem (CluVRP) Simple, Fast and flexible solver

The solver has three simple steps

Aggregation of customers based on given subgroups (zones, clusters, or micro postcodes) and creating the reduced graph.
Solving a CVRP on the reduced graph with Large Neighborhood Search (LNS).
Disaggregating the clusters sequence to customer nodes sequence.

Name		Name	Last commit message	Last commit date
Latest commit History 20 Commits
.idea		.idea
Exact		Exact
clustering		clustering
data		data
k-nearest		k-nearest
lowerbound		lowerbound
projection		projection
trajectory		trajectory
tsp_solver		tsp_solver
utils		utils
vrp_solver		vrp_solver
.gitignore		.gitignore
Aggresults_Golden_AS5.csv		Aggresults_Golden_AS5.csv
GUI.py		GUI.py
Golden_10-C30-N324.png		Golden_10-C30-N324.png
LNS_results.csv		LNS_results.csv
README.md		README.md

Provide feedback