Laddar...
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...
Sparad:
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Regional Association for Security and crisis management
2019-10-01
|
| Serie: | Decision Making: Applications in Management and Engineering |
| Ämnen: | |
| Länkar: | http://www.dmame.org/index.php/dmame/article/view/41 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|