C++CompletedDeep Orange theme

Ordering Problem

A C++ optimisation exercise with genetic algorithms, ant-colony optimisation and particle-swarm approaches built around graphs, nodes and weighted relationships.

C++Qt 6Algorithms
OPOrdering Problem
C++Main technology
21Tracked files*
9.cpp files
8.h files

*File metrics count tracked files after excluding common generated build folders. The project status is an editable draft classification.

01 · What it does

What the application does

Capabilities evidenced by project documentation and source structure; some behaviours require platform configuration.

01

Genetic optimisation population and fitness routines

Genetic optimisation population and fitness routines.

02

Ant-colony and particle-swarm strategies.

Ant-colony and particle-swarm strategies.

03

Graph and route data structures.

Graph and route data structures.

02 · Technical structure

How the system works

Technical architecture drawn from the repository and supplied documentation.

01

The project uses C++, Qt 6, Algorithms as its documented technical foundation.

02

The source tree and supplied README describe the primary modules; individual files and runtime behaviour may vary by platform.

04 · Source and design

Implementation examples and code walkthrough

Genetic algorithm creates and evaluates generations

OSP/genetic.cppVerified GitHub source excerpt (abridged)
std::vector<int> GeneticSolver::run() {
    auto t0 = Clock::now();
    initialize();
    evaluate();
    std::vector<int> bestInd = population[0];
    double bestFit = fitness[0];
    for (int gen = 1; gen < maxGen; ++gen) {
        const std::vector<int> elite = bestInd;
        std::vector<std::vector<int>> newPop;
        newPop.reserve(popSize);
        // Selection, crossover, mutation and repair follow.
    }
    // Remaining source updates and returns the best candidate.
}

Genetic solver with elitism

C++

The solver couples tournament-style parent selection with crossover, mutation, repair and an elite individual. The displayed fragment is abridged from the source to focus on the generational flow.

OSP/genetic.cppSelected source excerpt
std::vector<int> GeneticSolver::run() {
    initialize();
    evaluate();
    std::vector<int> bestInd = population[0];
    for (int gen = 1; gen < maxGen; ++gen) {
        const auto elite = bestInd;
        auto p1 = selectParent();
        auto child = crossover(p1, selectParent());
        mutate(child);
        repair(child);
        // Elite is retained while the population evolves.
    }
    return bestInd;
}
06 · Technology

Programming languages & stack

C++
Qt 6
Algorithms

Technology overview: C++, Qt 6, Algorithms. The list reflects documented tools, dependencies and proposed components; for planned projects it does not prove implementation.

File types identified: 9 .cpp, 8 .h, 1 .ui

07 · Reality check

Status, evidence & limitations

The project status is based on repository sources and supplied documentation. It may be updated as the project evolves. A published case study is not a certification of production readiness.
  • Features are based on the supplied README and code inventory; no end-to-end runtime certification is implied.
08 · Resources

Project resources

Explore the public repository, source code and project documentation on GitHub.