Capacitated-Vehicle-Routing-Problem

Algorithms Implemented:

Clark & Wright (serial and parallel version)
Cluster first route second:Fisher & Jaikumar
- GAP assignement method:
  - NearestNeighbourn
  - Dijkastra
Route First Cluster Second: using an auxiliary graph and Dijkastra

Name		Name	Last commit message	Last commit date
Latest commit History 154 Commits
A-VRP		A-VRP
Sol_CR		Sol_CR
__pycache__		__pycache__
cvrp-sol		cvrp-sol
cvrp		cvrp
mysol		mysol
mysol_DJ		mysol_DJ
mysol_DJ_kRand		mysol_DJ_kRand
mysol_FJ		mysol_FJ
mysol_FJ_kRand		mysol_FJ_kRand
mysol_Genetic		mysol_Genetic
mysol_par		mysol_par
relazione		relazione
CompareResult.txt		CompareResult.txt
README.md		README.md
cvrp-sol.zip		cvrp-sol.zip
cvrp.zip		cvrp.zip
cvrpGraph.py		cvrpGraph.py
main.py		main.py
parser.py		parser.py
progetto-1718.pdf		progetto-1718.pdf
route.py		route.py
solver.py		solver.py
studio12.pdf		studio12.pdf
tsplib-doc.pdf		tsplib-doc.pdf