Skip to content

Latest commit

 

History

History
29 lines (20 loc) · 912 Bytes

README.md

File metadata and controls

29 lines (20 loc) · 912 Bytes

Ant Colony Optimization

Ant Colony Optimization algorithm solving Google HashCode 2020 online elimination problem

Problem Statement

The problem statement can be found here

Solution

The solution is based on Ant Colony Optimization algorithm with additional mutations.

How to run

bash -c "git clone https://github.com/Wector1/ant_colony_optimization.git && \
         cd ant_colony_optimization && \
         cmake -B build             && \
         cd build                   && \
         make                       && \
         ./main"

Program accepts data through the standard input and outputs the solution to the standard output. Alternatively, you can specify the input and output files using the following command:

./main <input_file >output_file