Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence
DOI: 10.1109/icec.1994.350010
|View full text |Cite
|
Sign up to set email alerts
|

An enhanced operator-oriented genetic search algorithm

Abstract: This paper proposes a new search process incorporated into an Operator-Oriented Genetic Algorithm (GA). The new search algorithm solves problems in the context of invertible symbolic operations on a combinational finite state environment. The algorithm exploits the GA's ability to search for solutions without regard to a priori knowledge of the problem domain. The validity of the'algorithm is illustrated by solving Rubik's Cube.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…GAs augmented the network life when compared with LEACH [126] by employing energy efficient data dissemination and optimizing the cluster distances. Zhang et al [127] WSN SOGA Simulated annealing (SA) [128] A GA approach provided the energy efficient WSN topology by improving the data aggregation rate and minimizing the intra-cluster distances. Huruiala et al [129] WSN SOGA Centralized GA A GA running on BS coordinate with nodes to minimize latency and power consumption for routing under tight constraints.…”
Section: Network Planning and Designmentioning
confidence: 99%
“…GAs augmented the network life when compared with LEACH [126] by employing energy efficient data dissemination and optimizing the cluster distances. Zhang et al [127] WSN SOGA Simulated annealing (SA) [128] A GA approach provided the energy efficient WSN topology by improving the data aggregation rate and minimizing the intra-cluster distances. Huruiala et al [129] WSN SOGA Centralized GA A GA running on BS coordinate with nodes to minimize latency and power consumption for routing under tight constraints.…”
Section: Network Planning and Designmentioning
confidence: 99%