ロード中...
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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|