New Variations of Order Crossover for Travelling Salesman Problem
Davis presented the order crossover operator for solving the travelling salesman problem (TSP) using genetic algorithm and has described two basic variants of this order crossover operator. In order to improve the efficiency and validity of these variants, in this paper three new variations of the o...
保存先:
| 出版年: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| 主要な著者: | , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| 主題: | |
| オンライン･アクセス: | https://www.redalyc.org/articulo.oa?id=265219618002 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|