https://github.com/astrodynamic/ant-colony-optimization-algorithm-in-qt-cpp

ACOAlgorithms is a C++ project implementing ant colony optimization algorithm for solving traveling salesman problem.
https://github.com/astrodynamic/ant-colony-optimization-algorithm-in-qt-cpp

aco algorithm ant-colony-optimization cmake cmakelists console-application cpp cpp17 makefile multithreading tsp-problem

Last synced: 3 days ago
JSON representation

ACOAlgorithms is a C++ project implementing ant colony optimization algorithm for solving traveling salesman problem.

• Host: GitHub
• URL: https://github.com/astrodynamic/ant-colony-optimization-algorithm-in-qt-cpp
• Owner: Astrodynamic
• License: mit
• Created: 2023-02-12T03:14:29.000Z (almost 2 years ago)
• Default Branch: develop
• Last Pushed: 2023-05-09T05:44:19.000Z (over 1 year ago)
• Last Synced: 2025-01-12T18:09:44.769Z (3 days ago)
• Topics: aco, algorithm, ant-colony-optimization, cmake, cmakelists, console-application, cpp, cpp17, makefile, multithreading, tsp-problem
• Language: C++
• Homepage:
• Size: 3.54 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Ant colony optimization algorithm in Qt/CPP

This project provides an implementation of the Ant Colony Optimization (ACO) algorithm to solve the Traveling Salesman Problem (TSP). The ACO algorithm is a metaheuristic approach to solve combinatorial optimization problems based on the behavior of ants. The TSP is a classic optimization problem that consists of finding the shortest path that visits a set of cities and returns to the starting city. 

This project is developed in C++17 and follows the Google C++ Style Guide. It provides a console interface to test the functionality of the implemented libraries.

## Getting Started

### Prerequisites

To build and run the project, the following tools must be installed on your system:

* CMake (version 3.15 or higher)

* C++ compiler supporting the C++17 standard

* Make

### Build and Install

To build and install the project, run the following commands:

```

cmake -S . -B ./build

cmake --build ./build

```

![Build](data/img/_build.png)

This will generate the executable file `ACOAlgorithms` in the `build` directory.

### Usage

#### Console Interface

The console interface provides the following functionality:

### Main menu

![Main menu](data/img/main_menu.png)

1. Loading the original graph from a file

![Main menu](data/img/load_graph.png)

2. Run the Atn Colony Optimization

![Main menu](data/img/run_algorithm.png)

#### ACO Algorithm

To run the ACO algorithm, execute the following command in the `build` directory:

```

./build/ACOAlgorithms.app

```

This will run the ACO algorithm to solve the TSP problem for a user-defined matrix. The user can set the matrix for the TSP problem and the number of executions N. The program will display the results of each of the algorithms for the specified matrix and measure the time it takes to execute N times an ACO algorithm applying parallelism and a usual ant algorithm for the user-defined matrix. The obtained time will be displayed.

This will load the graph from the file specified by `` and display the menu with the available options. To select an option, enter the corresponding number and follow the instructions on the screen.

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.