• Title/Summary/Keyword: Evolutionary Simulation

Search Result 187, Processing Time 0.022 seconds

School Bus Routing Problem with Mixed-Load and Dynamic Arrivals (혼승 및 시간대별 학생들의 동적유입을 고려한 스쿨버스 경로 문제)

  • Lee, Young-Ki;Jeong, Suk-Jae;Yun, Ho-Young;Kim, Kyung-Sup
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.1
    • /
    • pp.63-75
    • /
    • 2013
  • The School Bus Routing Problem(SBRP) seeks to plan an efficient schedule of a fleet of school buses that must pick up student from various bus stops and deliver them by satisfying various constraints; maximum capacity of the bus, maximum riding time of students, arrival time between a school's time window. By extending the existing SBRP, we consider a case study of SBRP with allowance of mixed-loading and dynamic arrivals reflecting the school bus operation of university in Korea. Our solution procedure is based on constructing the initial solution using sweep algorithm and then improving solution within the framework of the evolutionary approach known as efficient meta-heuristics. By comparing the various scenarios through the constraints relaxation for reflecting the real operational strategies, we assess the merit of our proposed procedure.

Optimal Design for Marker-assisted Gene Pyramiding in Cross Population

  • Xu, L.Y.;Zhao, F.P.;Sheng, X.H.;Ren, H.X.;Zhang, L.;Wei, C.H.;Du, L.X.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.25 no.6
    • /
    • pp.772-784
    • /
    • 2012
  • Marker-assisted gene pyramiding aims to produce individuals with superior economic traits according to the optimal breeding scheme which involves selecting a series of favorite target alleles after cross of base populations and pyramiding them into a single genotype. Inspired by the science of evolutionary computation, we used the metaphor of hill-climbing to model the dynamic behavior of gene pyramiding. In consideration of the traditional cross program of animals along with the features of animal segregating populations, four types of cross programs and two types of selection strategies for gene pyramiding are performed from a practical perspective. Two population cross for pyramiding two genes (denoted II), three population cascading cross for pyramiding three genes(denoted III), four population symmetry (denoted IIII-S) and cascading cross for pyramiding four genes (denoted IIII-C), and various schemes (denoted cross program-A-E) are designed for each cross program given different levels of initial favorite allele frequencies, base population sizes and trait heritabilities. The process of gene pyramiding breeding for various schemes are simulated and compared based on the population hamming distance, average superior genotype frequencies and average phenotypic values. By simulation, the results show that the larger base population size and the higher the initial favorite allele frequency the higher the efficiency of gene pyramiding. Parents cross order is shown to be the most important factor in a cascading cross, but has no significant influence on the symmetric cross. The results also show that genotypic selection strategy is superior to phenotypic selection in accelerating gene pyramiding. Moreover, the method and corresponding software was used to compare different cross schemes and selection strategies.

Analysis of the applicability of parameter estimation methods for a transient storage model (저장대모형의 매개변수 산정을 위한 최적화 기법의 적합성 분석)

  • Noh, Hyoseob;Baek, Donghae;Seo, Il Won
    • Journal of Korea Water Resources Association
    • /
    • v.52 no.10
    • /
    • pp.681-695
    • /
    • 2019
  • A Transient Storage Model (TSM) is one of the most widely used model accounting for complex solute transport in natural river to understanding natural river properties with four TSM key parameters. The TSM parameters are estimated via inverse modeling. Parameter estimation of the TSM is carried out by solving optimization problem about finding best fitted simulation curve with measured curve obtained from tracer test. Several studies have reported uncertainty in parameter estimation from non-convexity of the problem. In this study, we assessed best combination of optimization method and objective function for TSM parameter estimation using Cheong-mi Creek tracer test data. In order to find best optimization setting guaranteeing convergence and speed, Evolutionary Algorithm (EA) based global optimization methods, such as CCE of SCE-UA and MCCE of SP-UCI, and error based objective functions were compared, using Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL). Overall results showed that multi-EA SC-SAHEL with Percent Mean Squared Error (PMSE) objective function is the best optimization setting which is fastest and stable method in convergence.

Application of a Penalty Function to Improve Performance of an Automatic Calibration for a Watershed Runoff Event Simulation Model (홍수유출 모형 자동 보정의 벌칙함수를 이용한 기능 향상 연구)

  • Kang, Taeuk;Lee, Sangho
    • Journal of Korea Water Resources Association
    • /
    • v.45 no.12
    • /
    • pp.1213-1226
    • /
    • 2012
  • Evolutionary algorithms, which are frequently used in an automatic calibration of watershed runoff simulation models, are unconstrained optimization algorithms. An additional method is required to impose constraints on those algorithms. The purpose of the study is to modify the SCE-UA (shuffled complex evolution-University of Arizona) to impose constraints by a penalty function and to improve performance of the automatic calibration module of the SWMM (storm water management model) linked with the SCE-UA. As indicators related to peak flow are important in watershed runoff event simulation, error of peak flow and error of peak flow occurrence time are selected to set up constraints. The automatic calibration module including the constraints was applied to the Milyang Dam Basin and the Guro 1 Pumping Station Basin. The automatic calibration results were compared with the results calibrated by an automatic calibration without the constraints. Error of peak flow and error of peak flow occurrence time were greatly improved and the original objective function value is not highly violated in the automatic calibration including the constraints. The automatic calibration model with constraints was also verified, and the results was excellent. In conclusion, the performance of the automatic calibration module for watershed runoff event simulation was improved by application of the penalty function to impose constraints.

The Design of Target Tracking System Using FBFE Based on VEGA (VEGA 기반 FBFE을 이용한 표적 추적 시스템 설계)

  • 이범직;주영훈;박진배
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.359-365
    • /
    • 2001
  • In this paper, we propose the design methodology of target tracking system using fuzzy basis function expansion(FBFE) based on virus evolutionary genetic algorithm (VEGA). In general, the objective of target tracking is to estimate the future trajectory of the target based on the past position of the target obtained from the sensor. In the conventional and mathematical nonlinear filtering method such as extended Kalman filter(EKF), the performance of the system may be deteriorated in highly nonlinear situation. To resolve these problems of nonlinear filtering technique, by appling artificial intelligent technique to the tracking control of moving targets, we combine the advantages of both traditional and intelligent control technique. In the proposed method, after composing training datum from the parameters of extended Kalman filter, by combining FDFE, which has the strong ability for the approximation, with VEGA, which prevent GA from converging prematurely in the case of lack of genetic diversity of population, and by idenLifying the parameters and rule numbers of fuzzy basis function simultaneously, we can reduce the tracking error of EKF. Finally, the proposed method is applied to three dimensional tracking problem, and the simulation results shows that the tracking performance is improved by the proposed method.

  • PDF

Designing the Moving Pattern of Cleaning Robot based on Grammatical Evolution with Conditional Probability Table (문법적 진화기법과 조건부 확률을 이용한 청소 로봇의 이동 패턴 계획)

  • Gwon, Soon-Joe;Kim, Hyun-Tae;Ahn, Chang Wook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.184-188
    • /
    • 2016
  • The cleaning robot is popularly used as a home appliance. The state-of-the-art cleaning robot can clean more efficiently by using information gathered from its sensor, which is difficult for low-price cleaning robots due to limitation in this aspect. In this paper, we suggested a method for the moving pattern of cleaning robot based on grammatical evolution. Optimized program is generated by using moving pattern grammar, which is defined by Backus-Naur form. In addition, conditional probability is used between each of the grammar elements during the program creation process. The proposed method is evaluated by robot simulation in order to verify its performance and further compare it with existing algorithms. The experiment results showed that the proposed method is better than the compared algorithms.

A Study on Optimal Design for Linear Electromagnetic Generator of Electricity Sensor System using Vibration Energy Harvesting (진동에너지 하베스팅을 이용한 전력감지시스템용 리니어 전자기 발전기에 관한 최적설계)

  • Cho, Seong Jin;Kim, Jin Ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.16 no.2
    • /
    • pp.7-15
    • /
    • 2017
  • Recently, an electricity sensor system has been installed and operated to prevent failures and accidents by identifying whether a transformer is normal in advance of failure. This electricity sensor system is able to both measure and monitor the transformer's power and voltage remotely and send information to a manager when unusual operation is discovered. However, a battery is required to operate power detection devices, and battery systems need ongoing management such as regular replacement. In addition, at a maintenance cost, occasional human resources and worker safety problems arise. Accordingly, we apply a linear electromagnetic generator using vibration energy from a transformer for an electric sensor system's drive in this research and we conduct optimal design to maximize the linear electromagnetic generator's power. We consider design variables using the provided design method from Process Integration, Automation, and Optimization (PIAnO), which is common tool from process integration and design optimization (PIDO). In addition, we analyze the experiment point from the design of the experiments using "MAXWELL," which is a common electromagnet analysis program. We then create an approximate model and conduct accuracy verification. Finally, we determine the optimal model that generates the maximum power using the proven approximate kriging model and evolutionary optimization algorithm, which we then confirm via simulation.

Design of an Optimal Controller with Neural Networks for Nonminimum Phase Systems (신경 회로망을 이용한 비최소 위상 시스템의 최적 제어기 설계)

  • 박상봉;박철훈
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.6
    • /
    • pp.56-66
    • /
    • 1998
  • This paper investigates a neuro-controller combined in parallel with a conventional linear controller of PID type in order to control nonminimum phase systems more efficiently. The objective is to minimize overall position errors as well as to maintain small undershooting. A costfunction is proposed with two conflict objectives. The neuro-controller is trained off-line with evolutionary programming(EP) in such a way that it becomes optimal by minimizing the given cost function through global evaluation based on desired control performance during the whole training time interval. However, it is not easy to find an optimal solution which satisfies individual objective simultaneously. With the concept of Pareto optimality and EP, we train the proposed controller more effectively and obtain a valuable set of optimal solutions. Simulation results show the efficacy of the proposed controller in a viewpoint of improvement of performance of a step response like fast settling time and small undershoot or overshoot compared with that of a conventional linear controller.

  • PDF

A Fair Radio Resource Allocation Algorithm for Uplink of FBMC Based CR Systems

  • Jamal, Hosseinali;Ghorashi, Seyed Ali;Sadough, Seyed Mohammad-Sajad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1479-1495
    • /
    • 2012
  • Spectrum scarcity seems to be the most challenging issue to be solved in new wireless telecommunication services. It is shown that spectrum unavailability is mainly due to spectrum inefficient utilization and inappropriate physical layer execution rather than spectrum shortage. Daily increasing demand for new wireless services with higher data rate and QoS level makes the upgrade of the physical layer modulation techniques inevitable. Orthogonal Frequency Division Multiple Access (OFDMA) which utilizes multicarrier modulation to provide higher data rates with the capability of flexible resource allocation, although has widely been used in current wireless systems and standards, seems not to be the best candidate for cognitive radio systems. Filter Bank based Multi-Carrier (FBMC) is an evolutionary scheme with some advantages over the widely-used OFDM multicarrier technique. In this paper, we focus on the total throughput improvement of a cognitive radio network using FBMC modulation. Along with this modulation scheme, we propose a novel uplink radio resource allocation algorithm in which fairness issue is also considered. Moreover, the average throughput of the proposed FBMC based cognitive radio is compared to a conventional OFDM system in order to illustrate the efficiency of using FBMC in future cognitive radio systems. Simulation results show that in comparison with the state of the art two algorithms (namely, Shaat and Wang) our proposed algorithm achieves higher throughputs and a better fairness for cognitive radio applications.

TCSC Nonlinear Adaptive Damping Controller Design Based on RBF Neural Network to Enhance Power System Stability

  • Yao, Wei;Fang, Jiakun;Zhao, Ping;Liu, Shilin;Wen, Jinyu;Wang, Shaorong
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.2
    • /
    • pp.252-261
    • /
    • 2013
  • In this paper, a nonlinear adaptive damping controller based on radial basis function neural network (RBFNN), which can infinitely approximate to nonlinear system, is proposed for thyristor controlled series capacitor (TCSC). The proposed TCSC adaptive damping controller can not only have the characteristics of the conventional PID, but adjust the parameters of PID controller online using identified Jacobian information from RBFNN. Hence, it has strong adaptability to the variation of the system operating condition. The effectiveness of the proposed controller is tested on a two-machine five-bus power system and a four-machine two-area power system under different operating conditions in comparison with the lead-lag damping controller tuned by evolutionary algorithm (EA). Simulation results show that the proposed damping controller achieves good robust performance for damping the low frequency oscillations under different operating conditions and is superior to the lead-lag damping controller tuned by EA.