C++11 or later required

Capacitated Vehicle Routing Problem (CVRP) and Vehicle Routing Problem with Time Windows(VRPTW) are briefly explained here

https://developers.google.com/optimization/routing/cvrp

http://cognitive-robotics17.csail.mit.edu/docs/tutorials/Tutorial10_Multi_vehicle_Routing_with_Time_Windows.pdf

I implemented 2 types of alogorithm, Ant Colony Optimization (ACO) and Greedy Algorithm.

At each time step, if a calculated total distance is smaller than the minimum distance, the minimum distance would be updated and printed.

Make sure you've installed CMake and its version above 3.1

cmake --version

Run the following command

./run.sh

./build/main.exe probs/solomon_***/***.txt

Specify text file in the second argument

Public benchmark for VRPTW, Solomon's problem sets is obtained from "data" directory in this repo.

e.g. seek minimum tour length by ACO