19) with a total distance of 19.0 units. Combinatorial optimization problems are among the most difficult in computer science. One of the most common techniques for solving them is an old approach ...

A new algorithm which could provide a solution to the age old Traveling Salesman Problem (TSP) has been improved by a student.

The science of computational complexity aims to solve the TSP -- the Travelling Salesman Problem -- when the time required to find an optimal solution is vital for practical solutions to modern ...

The considered optimization problem is NP-hard, that is why we proposed a two-level based genetic algorithm in order to solve it. The computational results reported on a set of existing benchmark ...

In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on ...

Genetic algorithms are problem-solving methods that mimic the process of natural selection and can be applied to predicting the movements of security prices.