AI/ML

New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. (arXiv:2001.11590v1 [cs.NE])



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.

Source link





Related posts

Analyzing Visual Representations in Embodied Navigation Tasks. (arXiv:2003.05993v1 [cs.CV])

Newsemia

Robust Evaluation of Language-Brain Encoding Experiments. (arXiv:1904.02547v1 [cs.CL])

Newsemia

A shear-induced network of aligned wormlike micelles in a sugar-based molecular gel. From gelation to biocompatibility assays.

Newsemia

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy