Semantic Scholar uses AI to extract papers important to this topic.
In this paper, continuous genetic algorithm is introduced as an efficient solver for systems of second-order boundary value… Expand Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions… Expand With the proliferation of mobile devices and wireless technologies, mobile social network systems are increasingly available. A… Expand This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible job-shop scheduling problem. Three… Expand The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or… Expand Many places in the world are too rugged or enclosed for vehicles to access. Even today, material transport to such areas is… Expand Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration… Expand This paper describes two elitism-based compact genetic algorithms (cGAs)-persistent elitist compact genetic algorithm (pe-cGA… Expand Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes… Expand This paper considers the problem of using genetic algorithms to design structures. We relax one constraint on classical genetic… Expand