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...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Main Authors: Arindam Roy, Apurba Manna, Samir Maity
Format: Artigo
Sprog:Inglês
Udgivet: Regional Association for Security and crisis management 2019-10-01
Serier:Decision Making: Applications in Management and Engineering
Fag:
TSP, Memetic GA, multi-parent crossover.
Online adgang:http://www.dmame.org/index.php/dmame/article/view/41
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker