A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique

In the present study, a Novel Memetic Genetic Algorithm (NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA is the combination of Boltzmann probability selection and a multi-parent crossover technique with known random mutation. In the proposed multi-parent crossover...

Full description

Saved in:
Bibliographic Details
Main Authors: Arindam Roy, Apurba Manna, Samir Maity
Format: Artigo
Language:Inglês
Published: Regional Association for Security and crisis management 2019-10-01
Series:Decision Making: Applications in Management and Engineering
Subjects:
TSP, Memetic GA, multi-parent crossover.
Online Access:http://www.dmame.org/index.php/dmame/article/view/41
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items