#### Filter Results:

- Full text PDF available (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Otman Abdoun, Jaafar Abouchabaka, Chakir Tajani
- ArXiv
- 2012

The genetic algorithm includes some parameters that should be adjusted, so as to get reliable results. Choosing a representation of the problem addressed, an initial population, a method of selection, a crossover operator, mutation operator, the probabilities of crossover and mutation, and the insertion method creates a variant of genetic algorithms. Our… (More)

- Otman Abdoun, Chakir Tajani, Jaafar ABOUCHABKA
- 2012

In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM. The efficiency of the HPRM is compared as against… (More)

- Chakir Tajani, Jaafar Abouchabaka
- ArXiv
- 2012

This work concerns the use of the iterative algorithm (KMF algorithm) proposed by Kozlov, Mazya and Fomin to solve the Cauchy problem for Laplace’s equation. This problem consists to recovering the lacking data on some part of the boundary using the over specified conditions on the other part of the boundary. We describe an alternating formulation of the… (More)

- Otman Abdoun, Chakir Tajani, Jaafar Abouchabaka
- ArXiv
- 2012

In this paper, we present a new mutation operator, Hybrid Mutation (HPRM), for a genetic algorithm that generates high quality solutions to the Traveling Salesman Problem (TSP). The Hybrid Mutation operator constructs an offspring from a pair of parents by hybridizing two mutation operators, PSM and RSM. The efficiency of the HPRM is compared as against… (More)

- ‹
- 1
- ›