نتایج جستجو برای: point crossover swap operator

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

1989
Rich Caruana Larry J. Eshelman J. David Schaffer

The traditional crossover operator used in genetic search exhibits a position-dependent bias called the dcfining-length bias. We show how this bias results in hidden biases that are difficult to anticipate and compensate for. We introduce a new crossover operator, shuffle crossover, that eliminates the position dependent bias of the traditional crossover operator by shuffling the representation...

2013
Walter E. Brown

We propose a new swap operator on native types for incorporation into the C++1Y core language. For user-defined types, we propose that this new operator be treated as a special member function, and that, when viable, its presence provide an alternative to traditional memberwise implementation of defaulted assignment semantics.

2015
A. J. Umbarkar P. D. Sheth

The performance of Genetic Algorithm (GA) depends on various operators. Crossover operator is one of them. Crossover operators are mainly classified as application dependent crossover operators and application independent crossover operators. Effect of crossover operators in GA is application as well as encoding dependent. This paper will help researchers in selecting appropriate crossover oper...

Journal: :IJISTA 2016
Changxi Ma Ruichun He Wanli Xiang

Hazardous materials transport network optimisation is the basis of ensuring the safety of hazardous materials transport. Considering the uncertainty of much basic information in hazardous materials transport system, this paper proposes the multi-objective chance-constrained programming model for hazardous materials transport network under uncertainty optimisation theory framework. Then, the pap...

2000
Christos Emmanouilidis Andrew Hunter

Genetic Algorithms are often employed for neural network feature selection. The efficiency of the search for a good subset of features, depends on the capability of the recombination operator to construct building blocks which perform well, based on existing genetic material. In this paper, a commonality-based crossover operator is employed, in a multiobjective evolutionary setting. The operato...

Journal: :Archives of ophthalmology 2000
C A Girkin A Emdadi P A Sample E Z Blumenthal A C Lee L M Zangwill R N Weinreb

OBJECTIVE To compare progression in short-wavelength automated perimetry (SWAP) and white-on-white (standard) perimetry in eyes with progressive glaucomatous changes of the optic disc detected by serial stereophotographs. METHODS Forty-seven glaucoma patients with at least 2 disc stereophotographs more than 2 years apart, along with standard perimetry and SWAP examinations within 6 months of ...

Journal: :Math. Program. Comput. 2017
Zhang-Hua Fu Jin-Kao Hao

Steiner tree problems (STPs) are very important in both theory and practice. In this paper, we introduce a powerful swap-vertex move operator which can be used as a basic element of any neighborhood search heuristic to solve many STP variants. Given the incumbent solution tree T , the swapvertex move operator exchanges a vertex in T with another vertex out of T , and then attempts to construct ...

2004
Vincent Tam M. C. Kwan

Pickup and delivery problems with time windows (PDPTW) are challenging yet realistic scheduling problems in which each delivery vehicle is assigned to handle different pairs of pickup-anddelivery requests. Our previous work successfully adapted the push forward insertion heuristic (PFIH) for initialization, and proposed a new swap operator to effectively solve PDP-TWs. In this paper, we improve...

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

1999
Allan Tucker

Recent work has shown that for finding static Bayesian network structures, an Evolutionary Programming (EP) approach that exploits the description length of single links is better suited than a standard Genetic Algorithm (GA). We extend this work to find good dynamic Bayesian network structures that can have large time lags. We do this through the use of a new representation of dynamic Bayesian...

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

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