• Title/Summary/Keyword: Genetic Operation

Search Result 393, Processing Time 0.029 seconds

Using Potential Field for Modeling of the Work-environment and Task-sharing on the Multi-agent Cooperative Work

  • Makino, Tsutomu;Naruse, Keitarou;Yokoi, Hiroshi;Kakazu, Yikinori
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.37-44
    • /
    • 2001
  • This paper describes the modeling of work environment for the extraction of abstract operation rules for cooperative work with multiple agent. We propose the modeling method using a potential field. In the method, it is applied to a box pushing problem, which is to move a box from a start to a goal b multiple agent. The agents follow the potential value when they move and work in the work environment. The work environment is represented as the grid space. The potential field is generated by Genetic Algorithm(GA) for each agent. GA explores the positions of a potential peak value in the grid space, and then the potential value stretching in the grid space is spread by a potential diffusion function in each grid. However it is difficult to explore suitable setting using hand coding of the position of peak potential value. Thus, we use an evlolutionary computation way because it is possible to explore the large search space. So we make experiments the environment modeling using the proposed method and verify the performance of the exploration by GA. And we classify some types from acquired the environment model and extract the abstract operation rule, As results, we find out some types of the environment models and operation rules by the observation, and the performance of GA exploration is almost same as the hand coding set because these are nearly same performance on the evaluation of the consumption of agent's energy and the work step from point to the goal point.

  • PDF

A Comparison of Scheduling Optimization Algorithm for the Efficient Satellite Mission Scheduling Operation (효율적인 위성 임무 스케줄링 운영을 위한 스케줄링 최적화 알고리즘 비교 연구)

  • Baek, Seung-Woo;Cho, Kyeum-Rae;Lee, Dae-Woo;Kim, Hae-Dong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.1
    • /
    • pp.48-57
    • /
    • 2010
  • A comparison of two kinds of scheduling optimization algorithms is presented in this paper. As satellite control and operation techniques have been developed, satellite missions became more complicated and overall quantity of missions also increased. These changes require more specific consideration and a huge amount of computation for the satellite mission scheduling. Therefore, it is a good strategy to make a scheduling optimization algorithm for the efficient satellite mission scheduling operation. In this paper, two kinds of scheduling optimization algorithms are designed with tabu-search algorithm and genetic algorithm respectively. These algorithms are applied for the same mission scenario and the results of each algorithm are compared and analyzed.

DESIGN OF A LOAD FOLLOWING CONTROLLER FOR APR+ NUCLEAR PLANTS

  • Lee, Sim-Won;Kim, Jae-Hwan;Na, Man-Gyun;Kim, Dong-Su;Yu, Keuk-Jong;Kim, Han-Gon
    • Nuclear Engineering and Technology
    • /
    • v.44 no.4
    • /
    • pp.369-378
    • /
    • 2012
  • A load-following operation in APR+ nuclear plants is necessary to reduce the need to adjust the boric acid concentration and to efficiently control the control rods for flexible operation. In particular, a disproportion in the axial flux distribution, which is normally caused by a load-following operation in a reactor core, causes xenon oscillation because the absorption cross-section of xenon is extremely large and its effects in a reactor are delayed by the iodine precursor. A model predictive control (MPC) method was used to design an automatic load-following controller for the integrated thermal power level and axial shape index (ASI) control for APR+ nuclear plants. Some tracking controllers employ the current tracking command only. On the other hand, the MPC can achieve better tracking performance because it considers future commands in addition to the current tracking command. The basic concept of the MPC is to solve an optimization problem for generating finite future control inputs at the current time and to implement as the current control input only the first control input among the solutions of the finite time steps. At the next time step, the procedure to solve the optimization problem is then repeated. The support vector regression (SVR) model that is used widely for function approximation problems is used to predict the future outputs based on previous inputs and outputs. In addition, a genetic algorithm is employed to minimize the objective function of a MPC control algorithm with multiple constraints. The power level and ASI are controlled by regulating the control banks and part-strength control banks together with an automatic adjustment of the boric acid concentration. The 3-dimensional MASTER code, which models APR+ nuclear plants, is interfaced to the proposed controller to confirm the performance of the controlling reactor power level and ASI. Numerical simulations showed that the proposed controller exhibits very fast tracking responses.

Development of a Model for Dynamic Station Assignmentto Optimize Demand Responsive Transit Operation (수요대응형 모빌리티 최적 운영을 위한 동적정류장 배정 모형 개발)

  • Kim, Jinju;Bang, Soohyuk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.1
    • /
    • pp.17-34
    • /
    • 2022
  • This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Moon, Seok-hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.632-635
    • /
    • 2015
  • Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

  • PDF

Optimization of photovoltaic thermal (PV/T) hybrid collectors by genetic algorithm in Iran's residential areas

  • Ehyaei, M.A.;Farshin, Behzad
    • Advances in Energy Research
    • /
    • v.5 no.1
    • /
    • pp.31-55
    • /
    • 2017
  • In the present study, PV/T collector was modeled via analysis of governing equations and physics of the problem. Specifications of solar radiation were computed based on geographical characteristics of the location and the corresponding time. Temperature of the collector plate was calculated as a function of time using the energy equations and temperature behavior of the photovoltaic cell was incorporated in the model with the aid of curve fitting. Subsequently, operational range for reaching to maximal efficiency was studied using Genetic Algorithm (GA) technique. Optimization was performed by defining an objective function based on equivalent value of electrical and thermal energies. Optimal values for equipment components were determined. The optimal value of water flow rate was approximately 1 gallon per minute (gpm). The collector angle was around 50 degrees, respectively. By selecting the optimal values of parameters, efficiency of photovoltaic collector was improved about 17% at initial moments of collector operation. Efficiency increase was around 5% at steady condition. It was demonstrated that utilization of photovoltaic collector can improve efficiency of solar energy-based systems.

Extension of Wireless Sensor Network Lifetime with Variable Sensing Range Using Genetic Algorithm (유전자알고리즘을 이용한 가변감지범위를 갖는 무선센서네트워크의 수명연장)

  • Song, Bong-Gi;Woo, Chong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.5
    • /
    • pp.728-736
    • /
    • 2009
  • We propose a method using the genetic algorithm to solve the maximum set cover problem. It is needed for scheduling the power of sensor nodes in extending the lifetime of the wireless sensor network with variable sensing range. The existing Greedy Heuristic method calculates the power scheduling of sensor nodes repeatedly in the process of operation, and so the communication traffic of sensor nodes is increased. The proposed method reduces the amount of communication traffic of sensor nodes, and so the energies of nodes are saved, and the lifetime of network can be extended. The effectiveness of this method was verified through computer simulation, and considering the energy losses of communication operations about 10% in the network lifetime is improved.

  • PDF

Combustion Control of Refuse Incineration Plant using Fuzzy Model and Genetic Algorithms (퍼지 모델과 유전 알고리즘을 이용한 쓰레기 소각로의 연소 제어)

  • Park, Jong-Jin;Choi, Kyu-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2116-2124
    • /
    • 2000
  • In this paper we propose combustion control of refuse incineration plant using fuzzy model and genetic algorithm. At first fuzzy modelling is performed to obtain fuzzy model of the refuse incineration plant and obtained fuzzy model predicts outputs of the plant when inputs are given. Fuzzy model ca be used to obtain control strategy, and train and enhance operators' skill by simulating the plant. Then genetic algorithms search and find out optimal control inputs over all possible solutions in respect to desired outputs and these are inserted to plant. In order to testify proposed control method, computer simulation was carried out. As a result, ISE of fuzzy model of refuse incineration plant is 0.015 and ITAE of control by proposed method, 352 which is better than that by manual operation.

  • PDF

Design of a Self-tuning PID Controller for Over-damped Systems Using Neural Networks and Genetic Algorithms (신경회로망과 유전알고리즘을 이용한 과감쇠 시스템용 자기동조 PID 제어기의 설계)

  • 진강규;유성호;손영득
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.27 no.1
    • /
    • pp.24-32
    • /
    • 2003
  • The PID controller has been widely used in industrial applications due to its simple structure and robustness. Even if it is initially well tuned, the PID controller must be retuned to maintain acceptable performance when there are system parameter changes due to the change of operation conditions. In this paper, a self-tuning control scheme which comprises a parameter estimator, a NN-based rule emulator and a PID controller is proposed, which can cope with changing environments. This method involves combining neural networks and real-coded genetic algorithms(RCGAs) with conventional approaches to provide a stable and satisfactory response. A RCGA-based parameter estimation method is first described to obtain the first-order with time delay model from over-damped high-order systems. Then, a set of optimum PID parameters are calculated based on the estimated model such that they cover the entire spectrum of system operations and an optimum tuning rule is trained with a BP-based neural network. A set of simulation works on systems with time delay are carried out to demonstrate the effectiveness of the proposed method.

Estimating model parameters of rockfill materials based on genetic algorithm and strain measurements

  • Li, Shouju;Yu, Shen;Shangguan, Zichang;Wang, Zhiyun
    • Geomechanics and Engineering
    • /
    • v.10 no.1
    • /
    • pp.37-48
    • /
    • 2016
  • The hyperbolic stress-strain model has been shown to be valid for modeling nonlinear stress-strain behavior for rockfill materials. The Duncan-Chang nonlinear constitutive model was adopted to characterize the behavior of the modeled rockfill materials in this study. Accurately estimating the model parameters of rockfill materials is a key problem for simulating dam deformations during both the dam construction period and the dam operation period. In order to estimate model parameters, triaxial compression experiments of rockfill materials were performed. Based on a genetic algorithm, the constitutive model parameters of the rockfill material were determined from the triaxial compression experimental data. The investigation results show that the predicted strains provide satisfactory precision when compared with the observed strains and the strains forecasted by a gradient-based optimization algorithm. The effectiveness of the proposed inversion procedure of model parameters was verified by experimental investigation in a laboratory.