• Title/Summary/Keyword: Evolutionary study

Search Result 757, Processing Time 0.022 seconds

An Evolutionary Acquisition Strategy for Defense Information Systems (국방정보시스템의 진화적 획득전략)

  • Cho, Sung-Rim;Sim, Seung-Bae;Kim, Sung-Tae;Jeong, Bong-Ju
    • Journal of Information Technology Services
    • /
    • v.9 no.4
    • /
    • pp.187-206
    • /
    • 2010
  • Evolutionary acquisition is an alternative to the grand design acquisition approaches. It has activities to make it possible to develop quickly and respond flexibly to changing customer needs and technological opportunities. The Ministry of Defense adopted an evolutionary strategy to acquire defense information systems. but it does not work well always. We look at problems from aspects of acquisition system and project management. We benchmark successful cases for evolutionary acquisition strategy in the DoD, the pubic and the private sector. We suggest an evolutionary strategy for defense information systems. The evolutionary strategy in this study includes an evolutionary acquisition framework, an evolutionary acquisition process, and an evolutionary acquisition guideline for defense information systems. The evolutionary strategy can help to implement evolutionary acquisition process for defense information system, and the process can increase the success rate of projects.

Students' Knowledge, Acceptance of Theory of Evolution and Epistemology: Cross-sectional Study of Grade Level Differences

  • Kim, Sun Young
    • Journal of Science Education
    • /
    • v.40 no.1
    • /
    • pp.1-16
    • /
    • 2016
  • The purpose of this study is to explore the variables of knowledge, acceptance of theory of evolution and epistemology that could be keys for teaching and learning the theory of evolution within school contexts, and to suggest instructional tips for teaching evolution in relation to the grade levels of education. This cross-sectional study examined the grade level differences (8th, 11th, and preservice teachers) of four variables: evolutionary knowledge; acceptance of theory of evolution; and both domain-specific epistemology (nature of science in relation to evolution) and context-specific epistemology (scientific epistemological views) and their relationships. This study, then, built conceptual models of each grade level students' acceptance of theory of evolution among the factors of evolutionary knowledge and epistemology (both domain-specific and context-specific). The results showed that the scores of evolutionary knowledge, evolution in relation to NOS, and scientific epistemology increased as the grade levels of education go up(p<.05) except the scores of acceptance of theory of evolution(p>.05). In addition, the 8th graders' and the 11th graders' acceptance of evolutionary theory was most explained by 'evolution in relation to NOS', while the preservice teachers' acceptance of evolutionary theory was most explained by evolutionary knowledge. Interestingly, 'scientific epistemological views' were only included for the 8th graders, while evolutionary knowledge and 'evolution in relation to NOS' (context-specific epistemology) were included in explaining all the level of students' acceptance of evolutionary theory. This study implicated that when teaching and learning of the theory of evolution in school contexts, knowledge, acceptance of evolutionary theory and epistemology could be considered appropriately for the different grade levels of students.

  • PDF

A Study on the Hybrid Mutant Space of Evolutionary Space Design - Focus on the Biological Evolutionism - (진화론적 공간디자인에서의 혼성적 변이공간에 관한 연구 - 생물학적 진화론을 중심으로 -)

  • Cheon, Byoung-Woo
    • Korean Institute of Interior Design Journal
    • /
    • v.21 no.1
    • /
    • pp.78-85
    • /
    • 2012
  • The relevance between organisms and their external environment covers everything including humans, natural and artificial surroundings, regarding which academic and scientific understanding has continued. Relevant elements established by inter-dependence between humans and environment and the unity of life should be translated from the perspective of a whole, not of unit elements or reduction. That is, a space is formed by its own program and assumes sustainable relevance based on interactions between internal and external spaces, not building an independent system. The present study aims to present the feasibility of a potential mutant space formed by invisible arenas between individuals and evolutionary space formation based on an ecological paradigm Accordingly, this study suggested that evolutionary attributes as the major power source of biological changes could verify the virtual multiplicity of a new space formation, and that the potential form generation of hybrid mutant space of emergence and infinite formative capability could be supported. The suggestions made here will hopefully contribute to extending applicability of evolutionary space generation in the field of space design. To derive the potential mutant forms from biological space, a preliminary study was conducted regarding the characteristics of evolutionary form generation. For the purpose of this study, three evolutionary perspectives of reproduction, mutation (variation) and selection were taken. First, the theory of evolution was defined and characterized. Also, the relevance between the characteristics generated and hybrid mutant space was analyzed to consider relevant characteristics. The present study helped to understand that the hybrid mutant space had an evolutionary space structure based on a biological paradigm. It was also found that the mutant space structure built by mutant polymorphism assumed a systematic correlation between space and environment.

  • PDF

Using Machine Learning to Improve Evolutionary Multi-Objective Optimization

  • Alotaibi, Rakan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.203-211
    • /
    • 2022
  • Multi-objective optimization problems (MOPs) arise in many real-world applications. MOPs involve two or more objectives with the aim to be optimized. With these problems improvement of one objective may led to deterioration of another. The primary goal of most multi-objective evolutionary algorithms (MOEA) is to generate a set of solutions for approximating the whole or part of the Pareto optimal front, which could provide decision makers a good insight to the problem. Over the last decades or so, several different and remarkable multi-objective evolutionary algorithms, have been developed with successful applications. However, MOEAs are still in their infancy. The objective of this research is to study how to use and apply machine learning (ML) to improve evolutionary multi-objective optimization (EMO). The EMO method is the multi-objective evolutionary algorithm based on decomposition (MOEA/D). The MOEA/D has become one of the most widely used algorithmic frameworks in the area of multi-objective evolutionary computation and won has won an international algorithm contest.

An Evolutionary Algorithm for Determining the k Most Vital Arcs in Shortest Path Problem (최단경로문제에서 k개의 치명호를 결정하는 유전알고리듬)

  • 정호연
    • Journal of the military operations research society of Korea
    • /
    • v.26 no.2
    • /
    • pp.120-130
    • /
    • 2000
  • The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. Generally, the problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k most vital arcs in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. The method presented in this study is developed using the library of the evolutionary algorithm framework and then the performance of algorithm is analyzed through the computer experiment.

  • PDF

A Study on the Shape Optimization of a Cutout Using Evolutionary Structural Optimization Method (진화 구조 최적화 기법을 이용한 개구부의 형상 최적화에 관한 연구)

  • 류충현;이영신
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.369-372
    • /
    • 2000
  • ESO(Evolutionary Structural Optimization) method is known that elements involved low stress value are removed from the previous model or that elements are added around elements involved high stress level on it and then the optimized model is obtained with required weight. Rejection ratio/addition ratio and evolutionary ratio are predefined and elements having lower/higher stress than reference stress, which average Mises stress on edge elements times rejection ratio, are deleted/added. In this study, when the plate having a cutout is subjected various in-plane load, a cutout shape is optimized using ESO method. ANSYS is used to analyse a finite element model and optimization procedure is made by APDL (ANSYS Parametric Design Language). ESO method is useful in rather than a complex structure optimization as well as a cutout shape optimization.

  • PDF

A Study on Multiobjective Genetic Optimization Using Co-Evolutionary Strategy (공진화전략에 의한 다중목적 유전알고리즘 최적화기법에 관한 연구)

  • Kim, Do-Young;Lee, Jong-Soo
    • Proceedings of the KSME Conference
    • /
    • 2000.11a
    • /
    • pp.699-704
    • /
    • 2000
  • The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.

  • PDF

Comparison and Analysis of Competition Strategies in Competitive Coevolutionary Algorithms (경쟁 공진화 알고리듬에서 경쟁전략들의 비교 분석)

  • Kim, Yeo Keun;Kim, Jae Yun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.87-98
    • /
    • 2002
  • A competitive coevolutionary algorithm is a probabilistic search method that imitates coevolution process through evolutionary arms race. The algorithm has been used to solve adversarial problems. In the algorithms, the selection of competitors is needed to evaluate the fitness of an individual. The goal of this study is to compare and analyze several competition strategies in terms of solution quality, convergence speed, balance between competitive coevolving species, population diversity, etc. With two types of test-bed problems, game problems and solution-test problems, extensive experiments are carried out. In the game problems, sampling strategies based on fitness have a risk of providing bad solutions due to evolutionary unbalance between species. On the other hand, in the solution-test problems, evolutionary unbalance does not appear in any strategies and the strategies using information about competition results are efficient in solution quality. The experimental results indicate that the tournament competition can progress an evolutionary arms race and then is successful from the viewpoint of evolutionary computation.

A Study on the Quadratic Multiple Container Packing Problem (Quadratic 복수 컨테이너 적재 문제에 관한 연구)

  • Yeo, Gi-Tae;Soak, Sang-Moon;Lee, Sang-Wook
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.3
    • /
    • pp.125-136
    • /
    • 2009
  • The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

Study on Diversity of Population in Game model based Co-evolutionary Algorithm for Multiobjective optimization (다목적 함수 최적화를 위한 게임 모델에 기반한 공진화 알고리즘에서의 해집단의 다양성에 관한 연구)

  • Lee, Hea-Jae;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.869-874
    • /
    • 2007
  • In searching for solutions to multiobjective optimization problem, we find that there is no single optimal solution but rather a set of solutions known as 'Pareto optimal set'. To find approximation of ideal pareto optimal set, search capability of diverse individuals at population space can determine the performance of evolutionary algorithms. This paper propose the method to maintain population diversify and to find non-dominated alternatives in Game model based Co-Evolutionary Algorithm.