טוען...
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...
שמור ב:
| Main Authors: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Regional Association for Security and crisis management
2019-10-01
|
| סדרה: | Decision Making: Applications in Management and Engineering |
| נושאים: | |
| גישה מקוונת: | http://www.dmame.org/index.php/dmame/article/view/41 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|