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...

Descrizione completa

Salvato in:
Dettagli Bibliografici
Pubblicato in:International Journal of Combinatorial Optimization Problems and Informatics
Autori principali: Kusum Deep, Hadush Mebrahtu
Natura: Artigo
Lingua:Inglês
Pubblicazione: International Journal of Combinatorial Optimization Problems and Informatics 2011
Soggetti:
Computación
Genetic algorithms
Variations of Order crossover
The Travelling salesman problem
Accesso online:https://www.redalyc.org/articulo.oa?id=265219618002
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !

Documenti analoghi