Cargando...

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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Arindam Roy, Apurba Manna, Samir Maity
Formato: Artigo
Lenguaje:Inglês
Publicado: Regional Association for Security and crisis management 2019-10-01
Colección:Decision Making: Applications in Management and Engineering
Materias:
Acceso en línea:http://www.dmame.org/index.php/dmame/article/view/41
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!