Načítá se...
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...
Uloženo v:
| Vydáno v: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Témata: | |
| On-line přístup: | https://www.redalyc.org/articulo.oa?id=265219618002 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|