Yüklüyor......
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...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Regional Association for Security and crisis management
2019-10-01
|
| Seri Bilgileri: | Decision Making: Applications in Management and Engineering |
| Konular: | |
| Online Erişim: | http://www.dmame.org/index.php/dmame/article/view/41 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|