• Title/Summary/Keyword: Evolutionary Simulation

Search Result 187, Processing Time 0.034 seconds

AN ADAPTIVE DISPATCHING ALGORITHM FOR AUTOMATED GUIDED VEHICLES BASED ON AN EVOLUTIONARY PROCESS

  • Hark Hwnag;Kim, Sang-Hwi;Park, Tae-Eun
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1997.04a
    • /
    • pp.124-127
    • /
    • 1997
  • A key element in the control of Automated Guided Vehicle Systems (AGVS) is dispatching policy. This paper proposes a new dispatching algorithm for an efficient operation of AGVS. Based on an evolutionary operation, it has an adaptive control capability responding to changes of the system environment. The performance of the algorithm is compared with some well-known dispatching rules in terms of the system throughput through simulation. Sensitivity analysis is carried out varying the buffer capacity and the number of AGVS.

  • PDF

Modeling and Simulation of Evolutionary Dynamic Path Planning for Unmanned Aerial Vehicles Using Repast (Repast기반 진화 알고리즘을 통한 무인 비행체의 동적 경로계획 모델링 및 시뮬레이션)

  • Kim, Yong-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.2
    • /
    • pp.101-114
    • /
    • 2018
  • Several different approaches and mechanisms are introduced to solve the UAV path planning problem. In this paper, we designed and implemented an agent-based simulation software using the Repast platform and Java Genetic Algorithm Package to examine an evolutionary path planning method by implementing and testing within the Repast environment. The paper demonstrates the life-cycle of an agent-based simulation software engineering project while providing a documentation strategy that allows specifying autonomous, adaptive, and interactive software entities in a Multi-Agent System. The study demonstrates how evolutionary path planning can be introduced to improve cognitive agent capabilities within an agent-based simulation environment.

Evolutionary Model of Depression as an Adaptation for Blocked Social Mobility

  • Park, Hanson;Pak, Sunyoung
    • Korean Journal of Biological Psychiatry
    • /
    • v.29 no.1
    • /
    • pp.1-8
    • /
    • 2022
  • Objectives In regard to the social competition hypothesis, depression is viewed as an involuntary defeat strategy. A previous study has demonstrated that adaptation in microenvironments can result in a wide range of behavioural patterns including defense activation disorders. Using a simulation model with evolutionary ecological agents, we explore how the fitness of various defence activation traits has changed over time in different environments with high and low social mobility. Methods The Evolutionary Ecological Model of Defence Activation Disorder, which is based on the Marginal Value Theorem, was used to examine changes in relative fitness for individuals with defensive activation disorders after adjusting for social mobility. Results Our study examined the effects of social mobility on fitness by varying the d-values, a measure of depression in the model. With a decline in social mobility, the level of fitness of individuals with high levels of defense activation decreased. We gained insight into the evolutionary influence of varying levels of social mobility on individuals' degrees of depression. In the context of a highly stratified society, the results support a mismatch hypothesis which states that high levels of defence are detrimental. Conclusions Despite the fact that niche specialization in habitats composed of multiple microenvironments can result in diverse levels of defensive activation being evolutionary strategies for stability, decreased social mobility may lead to a decrease in fitness of individuals with highly activated defence modules. There may be a reason behind the epidemic of depression in modern society.

Evolutionary Computation for the Real-Time Adaptive Learning Control(II) (실시간 적응 학습 제어를 위한 진화연산(II))

  • Chang, Sung-Ouk;Lee, Jin-Kul
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.730-734
    • /
    • 2001
  • In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

  • PDF

Comparison of Evolutionary Computation for Power Flow Control in Power Systems (전력계통의 전력조류제어를 위한 진화연산의 비교)

  • Lee, Sang-Keun
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.54 no.2
    • /
    • pp.61-66
    • /
    • 2005
  • This paper presents an unified method which solves real and reactive power dispatch problems for the economic operation of power systems using evolutionary computation such as genetic algorithms(GA), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most of these approaches have the common defect of being caught to a local minimum solution. The proposed methods, applied to the IEEE 30-bus system, were run for 10 other exogenous parameters and composed of P-optimization module and Q-optimization module. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.

Parameter Optimization using Eevolutionary Programming in Voltage Reference Circuit Design (진화 연산을 이용한 기준 전압 회로의 파라미터 최적화)

  • 남동경;박래정;서윤덕;박철훈;김범섭
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.8
    • /
    • pp.64-70
    • /
    • 1997
  • This paper presents a parameter optimization method using evolutionary programming in voltage reference circuit because the designer must select appropriate parameter values of the circuit taking into consideration both powr voltage and temperature variation. In this paper, evolutionary programming is suggested as an approach for finding good parameters with which the reference voltage variation is small with respect to temperature variation. Simulation results. Simulation results show that this method is effective in circuit design.

  • PDF

Many-to-Many Warship Combat Tactics Generation Methodology Using the Evolutionary Simulation (진화론적 시뮬레이션을 이용한 다대다 함정교전 전술 생성 방법론)

  • Jung, Chan-Ho;Ryu, Han-Eul;You, Yong-Jun;Chi, Sung-Do;Kim, Jae-Ick
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.3
    • /
    • pp.79-88
    • /
    • 2011
  • In most existing warships combat simulation system, the tactics of a warship is manipulated by human operators. For this reason, the simulation results are restricted due to the stereotype of human operators. To deal with this, we have employed the genetic algorithm for supporting the evolutionary simulation environment. In which, the tactical decision by human operators is replaced by the human model with a rule-based chromosome for representing tactics so that the population of simulations are created and hundreds of simulation runs are continued on the basis of the genetic algorithm without any human intervention until to find emergent tactics which shows the best performance throughout the simulation. This paper proposes an evolutionary tactics generation methodology for the emergent tactics in many-to-many warship combat simulation. To do this, 3:3 warship combat simulation tests are performed.

An Optimal Real and Reactive Power dispatch using Evolutionary Computation (진화연산을 이용한 유효 및 무효전력 최적배분)

  • You, Seok-Ku;Park, Chang-Joo;Kim, Kyu-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1996.11a
    • /
    • pp.166-168
    • /
    • 1996
  • This paper presents an power system optimization method which solves real and reactive power dispatch problems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods, applied to the IEEE 30-bus system, were run for 12 other exogenous parameters. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.

  • PDF

Designing New Algorithms Using Genetic Programming

  • Kim, Jin-Hwa
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2004.11a
    • /
    • pp.171-178
    • /
    • 2004
  • This study suggests a general paradigm enhancing genetic mutability. Mutability among heterogeneous members in a genetic population has been a major problem in application of genetic programming to diverse business problems. This suggested paradigm is implemented to developing new methods from existing methods. Within the evolutionary approach taken to designing new methods, a general representation scheme of the genetic programming framework, called a kernel, is introduced. The kernel is derived from the literature of algorithms and heuristics for combinatorial optimization problems. The commonality and differences among these methods have been identified and again combined by following the genetic inheritance merging them. The kernel was tested for selected methods in combinatorial optimization. It not only duplicates the methods in the literature, it also confirms that each of the possible solutions from the genetic mutation is in a valid form, a running program. This evolutionary method suggests diverse hybrid methods in the form of complete programs through evolutionary processes. It finally summarizes its findings from genetic simulation with insight.

  • PDF

Game Theory Based Co-Evolutionary Algorithm (GCEA) (게임 이론에 기반한 공진화 알고리즘)

  • Sim, Kwee-Bo;Kim, Ji-Youn;Lee, Dong-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.3
    • /
    • pp.253-261
    • /
    • 2004
  • Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.