نتایج جستجو برای: heuristic crossover

تعداد نتایج: 86317  

2014
Z H Ahmed

Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX...

2003
Jürgen Branke Christiane Barz Ivesa Behrens

Crossover for evolutionary algorithms applied to permutation problems is a difficult and widely discussed topic. In this paper we use ideas from ant colony optimization to design a new permutation crossover operator. One of the advantages of the new crossover operator is the ease to introduce problem specific heuristic knowledge. Empirical tests on a travelling salesperson problem show that the...

Alireza rezaee

In this paper, echo cancellation is done using genetic algorithm (GA). The genetic algorithm is implemented by two kinds of crossovers; heuristic and microbial. A new procedure is proposed to estimate the coefficients of adaptive filters used in echo cancellation with combination of the GA with Least-Mean-Square (LMS) method. The results are compared for various values of LMS step size and diff...

2013
Gintaras VAIRA Olga KURASOVA

In the paper, we investigate the crossover operators for a vehicle routing problem where only feasible solutions are taken into account. New crossover operators are proposed that are based on the common sequence in the parent solutions. Random insertion heuristic is used as a reconstruction method in a crossover operator to preserve stochastic characteristics of the genetic algorithm. The genet...

2017
Zengliang Han Dongqing Wang Feng Liu Zhiyong Zhao

This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV) path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, dou...

2003
I. Lohmar

A prominent chemical reaction in interstellar clouds is the formation of molecular hydrogen by recombination, which essentially takes place on dust grain surfaces. Analytical approaches to model such a system have hitherto neglected the spatial aspects of the problem by employing a simplistic version of the sweeping rate of reactants. We show how these aspects can be accounted for by a consiste...

2007
Stephen T. Frezza Steven P. Levitan

This paper presents a new approach to routing schematic diagrams. Heuristic global and local algorithms are presented which focus on congestion and crossover issues in the development of aesthetically-pleasing diagrams. Congestion is the basis for the global, and crossover for the local router. This algorithm can work on a completed schematic, but also can be applied to schematics that are incr...

1999
Stephen Y. Chen Stephen F. Smith

The Commonality-Based Crossover Framework defines crossover as a two-step process: 1) preserve the maximal common schema of two parents, and 2) complete the solution with a construction heuristic. In these “heuristic” operators, the first step is a form of selection. This commonality-based form of selection has been isolated in GENIE. Using random parent selection and a non-elitist generational...

2016
Xiuli Wu Pietro A. Consoli Leandro L. Minku Gabriela Ochoa Xin Yao

Software project scheduling plays an important role in reducing the cost and duration of software projects. It is an NP-hard combinatorial optimization problem that has been addressed based on single and multiobjective algorithms. However, such algorithms have always used fixed genetic operators, and it is unclear which operators would be more appropriate across the search process. In this pape...

1995
Edmund K. Burke Dave Elliman Rupert F. Weare

In this paper, we present a powerful hybrid genetic algorithm based around a heuristic timetabling framework. This combines a direct representation of the timetable with heuristic crossover operators to ensure that the most fundamental constraints are never violated. We explain how the population is seeded so as to produce a solution which cannot be outperformed by the heuristic method alone. W...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید