Genetic algorithm and a double-chromosome implementation to the traveling salesman problem

Abstract

The variety of methods used to solve the traveling salesman problem attests to the fact that the problem is still vibrant and of concern to researchers in this area. For problems with a large search space, similar to the traveling salesman problem, evolutionary algorithms such as genetic algorithm are very powerful and can be used to obtain optimized solutions. However, the challenge in applying a genetic algorithm to the traveling salesman problem is the choice of appropriate operators that could produce legal tours. In the literature, additional repair algorithms have been introduced and employed and the offspring produced by these genetic algorithm operators are modified to ensure that the generated chromosomes represent legal tours. Rather than sticking to repair algorithms, a double-chromosome approach is proposed in this article. The proposed method can be employed to optimize problems similar to the traveling salesman problem. The double-chromosome approach has been tested with a variety of traveling salesman problems, and the results indicated that the proposed method has a high rate of convergence toward the shortest tour.

Optimal Route Selection Decision-Making Based on Intelligent Network

“…According to intelligent network optimization problem, the existing optimization algorithms can be classified into probabilistic algorithms [4][5][6][10][11][12] and logical algorithms [7-9, 18, 19] in the present stages. All of those algorithms have a great requirement for the improvement of algorithm efficiency.…”

“…e existing optimal route selection decision-making problems can be classified into three aspects based on intelligent network. e first class is based on genetic algorithm [4,10,11]. e second one is based on ant colony optimization algorithm [5,6,12].…”

Desenvolvimento e otimização de silenciador automotivo orientado a protótipos Formula Student

“…mais "adaptados" ao propósito de minimização e seleciona-se uma determinada porcentagem dos melhores indivíduos (processo devidamente chamado de "seleção"). Dos valores selecionados, um novo rol de indivíduos é gerado por meio de mutação e/ou crossover (que podem ser melhor compreendidos em Riazi [22]) e, então, avaliados de acordo com a função objetivo.…”

A Solving Route Optimization of Airplane Travel Problem Use Artificial Bee Colony Algorithm

“…The case study used comes from the new dataset developed by Kiwi in a traveling salesman challenge 2.0 (TSC 2.0) competition. The results of this study compared with the GA, which is a popular algorithm in combinatorial problems and has been proven to solve TSP problems [5], [16], [28], [29].…”