[PDF][PDF] Crossover operators in genetic algorithms: a review.

AJ Umbarkar, PD Sheth - ICTACT journal on soft …, 2015 - pdfs.semanticscholar.org
Abstract The performance of Genetic Algorithm (GA) depends on various operators.
Crossover operator is one of them. Crossover operators are mainly classified as application …

Exploration and exploitation in evolutionary algorithms: A survey

M Črepinšek, SH Liu, M Mernik - ACM computing surveys (CSUR), 2013 - dl.acm.org
“Exploration and exploitation are the two cornerstones of problem solving by search.” For
more than a decade, Eiben and Schippers' advocacy for balancing between these two …

An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks

Y Yoon, YH Kim - ieee transactions on cybernetics, 2013 - ieeexplore.ieee.org
Sensor networks have a lot of applications such as battlefield surveillance, environmental
monitoring, and industrial diagnostics. Coverage is one of the most important performance …

[图书][B] Design of modern heuristics: principles and application

F Rothlauf - 2011 - Springer
Most textbooks on modern heuristics provide the reader with detailed descriptions of the
functionality of single examples like genetic algorithms, genetic programming, tabu search …

[PDF][PDF] Crossover and mutation operators of genetic algorithms

SM Lim, ABM Sultan, MN Sulaiman… - International journal of …, 2017 - ijmlc.org
Genetic algorithms (GA) are stimulated by population genetics and evolution at the
population level where crossover and mutation comes from random variables. The problems …

[图书][B] Evolutionary algorithms

A Pétrowski, S Ben-Hamida - 2017 - books.google.com
Evolutionary algorithms are bio-inspired algorithms based on Darwin's theory of evolution.
They are expected to provide non-optimal but good quality solutions to problems whose …

A comparison study of harmony search and genetic algorithm for the max-cut problem

YH Kim, Y Yoon, ZW Geem - Swarm and evolutionary computation, 2019 - Elsevier
The max-cut problem is one of well-known NP-complete problems and has applications in
various fields such as the design process for VLSI (Very-Large-Scale Integration) chips and …

Genetic approaches for graph partitioning: a survey

J Kim, I Hwang, YH Kim, BR Moon - … of the 13th annual conference on …, 2011 - dl.acm.org
The graph partitioning problem occurs in numerous applications such as circuit placement,
matrix factorization, load balancing, and community detection. For this problem, genetic …

SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices

M Kim, KS Candan - Data & Knowledge Engineering, 2012 - Elsevier
Graphs are used for modeling a large spectrum of data from the web, to social connections
between individuals, to concept maps and ontologies. As the number and complexities of …

Method and system for combinatorial layout design

WM Chan - US Patent 9,317,626, 2016 - Google Patents
The present invention discloses a method for combinatorial layout design, in particular
family mold layout design, using a computer. The method starts with receiving design …