ATM: a New Heuristic Algorithm Based on Genetic Algorithm and Betting Theory

This paper proposes a new heuristic algorithm for combinatorial optimization. This algorithm is based on genetic algorithm and betting theory. It applies probabilistic recombination to a solution given as input and returns a new solution much more optimized. Experiments using arrays from the library of the Travel Salesman Problem have been done and the obtained results have demonstrated that this algorithm is very efficient, mainly for dense arrays