This project contains four heuristics for the Capacitated Vehicle Routing Problem (CVRP).
The implemented heuristics are:
- Clarke and Wright Savings.
- Greedy algorithm.
- Cluster First / Route second + Sweep Algorithm.
- Cluster First / Route second + 2-opt.
- Simulated Annealing.
This was made as part of our "Algorithms and Data Structures III" course, taught during the first semester of 2019 at the Faculty of Natural and Exact Sciences, University of Buenos Aires.
make clean && make
Para ver un mensaje de ayuda:
./build/vrp --help
Para ejecutar uno de los algoritmos:
cat data/CASO_DE_PRUEBA.vrp | ./build/vrp --algo ALGORITMO