2015 | OriginalPaper | Buchkapitel
New Mechanism of Combination Crossover Operators in Genetic Algorithm for Solving the Traveling Salesman Problem
verfasst von : Pham Dinh Thanh, Huynh Thi Thanh Binh, Bui Thu Lam
Erschienen in: Knowledge and Systems Engineering
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Traveling salesman problem
(TSP)
is a well-known in computing field. There are many researches to improve the genetic algorithm for solving
TSP
. In this paper, we propose two new crossover operators and new mechanism of combination crossover operators in genetic algorithm for solving
TSP
. We experimented on
TSP
instances from
TSP
-Lib and compared the results of proposed algorithm with genetic algorithm
(GA)
, which used
MSCX
. Experimental results show that, our proposed algorithm is better than the
GA
using
MSCX
on the min, mean cost values.