Using genetic algorithm to find the most profitable routes for a bus company

Graph that represents cities on a map. Green lines represent connections between cities, and purple ones represent current best bus route.

There a are few different companies and each of them has the same number of buses. Each bus has a limited number of seats, and therefore can travel with a limited number of passengers. Bus travels along its route which consists of cities and connections beetween those cities. Each connection is different, which means they have a different length and weight - that results in different travel cost. In every generation that route is mutated acording to one randomly selected method of mutation.

After mutation process all buses are randomly assigned to different companies, which constitutes crossing of their genome. Crossed individuals then become new parent generation and whole process will repeat itself until limit of generations is reached.