• Title/Summary/Keyword: Genetic Operation

Search Result 390, Processing Time 0.029 seconds

Minimization of Post-processing area for Stereolithography Parts by Selection of Part Orientation (부품방향의 선정을 통한 광조형물의 후가공면적 최소화)

  • Kim, Ho-Chan;Lee, Seok-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.11
    • /
    • pp.2409-2414
    • /
    • 2002
  • The surfaces of prototypes become rough due to the stair-stepping which is the inevitable phenomenon in the Rapid Prototypes are not used only for the verification of feature. The grinding, coating, or the composition of them is a main operation in post-processing in which lots of costs and long build time are needed. The solution is proposed to increase the efficiency of rapid prototyping by minimizing or removing the composition of them is a main operation in post-processing in which lots of costs and long build time are needed. the solution is proposed to increase the efficiency of rapid prototyping by minimizing or removing the regions for post-processing. the factors to cause the surface roughness and their effects are analyzed through the experiments. Software modules are developed to predict the surface roughness of each face in the prototyping with the result. An experimental compensation method is developed to apply the modules to various RP equipments, materials and build styles. The build direction is searched with use of genetic algorithm to maximize the total areas of the surface of which roughness is better than the user-defined value.

A Study on the didactical phenomenology of the negative numbers (음수의 교수 현상학적 연구)

  • 우정호;최병철
    • Journal of Educational Research in Mathematics
    • /
    • v.13 no.1
    • /
    • pp.25-55
    • /
    • 2003
  • In the school mathematics, the negative numbers have been instructed by means of intuitive models(concrete situation models, number line model, colour counter model), inductive-extrapolation approach, and the formal approach using the inverse operation relations. These instructions on the negative numbers have caused students to have the difficulty in understanding especially why the rules of signs hold. It is due to the fact that those models are complicated, inconsistent, and incomplete. So, students usually should memorize the sign rules. In this study we studied on the didactical phenomenology of the negative numbers as a foundational study for the improvement of teaching negative numbers. First, we analysed the formal nature of the negative numbers and the cognitive obstructions which have showed up in the historic-genetic process of them. Second, we investigated what the middle school students know about the negative numbers and their operations, which they have learned according to the current national curriculum. The results showed that the degree they understand the reasons why the sign rules hold was low Third, we instructed the middle school students about the negative number and its operations using the formal approach as Freudenthal suggest ed. And we investigated whether students understand the formal approach or not. And we analysed the validity of the new teaching method of the negative numbers. The results showed that students didn't understand the formal approach well. And finally we discussed the directions for improving the instruction of the negative numbers on the ground of these didactical phenomenological analysis.

  • PDF

Coordinated Multiple Reservoir Operation Using a DEA-based Ranking Procedure (DEA기반 순위결정 절차를 활용한 저수지군 연계운영)

  • Jeon, Seung-Mok;Kim, Sheung-Kown
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2007.05a
    • /
    • pp.2089-2093
    • /
    • 2007
  • 저수지군 연계운영 문제는 서로 상충되는 목적들이 존재하고, 다양한 평가 기준들이 존재하는 다목적 특성을 갖는 문제이다. 때문에 저수지군 연계운영 문제에 다중목적계획법이 많이 사용되고 있으나 문제의 해결을 위해 사용한 다수의 목적간의 가중치 설정에 의사결정자의 주관적요소가 반영 될 수도 있고, 설정된 가중치에 따라 결과 값이 민감하게 반응하여 의사결정자가 바람직한 가중치 설정에 어려움이 있다. 본 연구의 목적은 다중 목적 특성이 존재하는 저수지군 연계운영 문제에 다요소 의사결정기법 적용하여 바람직한 저수지별 저수 가중치를 선정하는 방법을 제안하는 것이다. 제안하는 저수 가중치 선정 절차는, 우선 GA-CoMOM (Genetic-Algorithm Coordinate Multi-reservoir Operation Model)을 통해 수계 전체 관점에서 저수량과 발전량의 상충되는 목적에 대한 파레토 최적해와 각 최적해에 해당하는 저수지별 저수 가중치를 도출한다. 다음 단계로 다요소 의사결정기법중에 하나인 수정된 거리척도 기반의 DEA 순위 선정 절차를 이용하여 도출된 최적해들의 운영 결과를 평가하여 파레토 최적해군 중에 선호해를 결정하고, 결정된 선호해의 저수지별 저수 가중치를 해당 기간의 저수 가중치로 선정한다. 설명한 선호 가중치 선정 절차를 금강 수계에 적용해 보고 저수지 연계운영에서 바람직한 가중치를 도출할 수 있음을 보인다.

  • PDF

Multi-Objective Pareto Optimization of Parallel Synthesis of Embedded Computer Systems

  • Drabowski, Mieczyslaw
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.304-310
    • /
    • 2021
  • The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Comparative Analysis of Game-Theoretic Demand Allocation for Enhancing Profitability of Whole Supply Chain (전체 공급망 수익성 개선을 위한 게임이론 기반의 수요 할당 메커니즘의 비교 연구)

  • Shin, Kwang Sup
    • The Journal of Society for e-Business Studies
    • /
    • v.19 no.1
    • /
    • pp.43-61
    • /
    • 2014
  • This research is an application of game theory to developing the supplier selection and demand allocation mechanism, which are the essential and major research areas of supply chain planning and operation. In this research, the most popular and widely accepted mechanism, the progressive reverse auction is analyzed and compared with the other game theoretic approach, Kalai-Smorodinsky Bargaining Solution in the viewpoint of holistic efficiency of supply chain operation. To logically and exquisitely compare the efficiencies, a heuristic algorithm based on Genetic Algorithm is devised to find the other optimal demand allocation plan. A well known metric, profit-cost ratio, as well as profit functions for both suppliers and buyer has been designed for evaluating the overall profitability of supply chain. The experimental results with synthesis data and supply chain model which were made to mimic practical supply chain are illustrated and analyzed to show how the proposed approach can enhance the profitability of supply chain planning. Based on the result, it can be said that the proposed mechanism using bargainging solution mayguarantee the better profitability for the whole supply chin including both suppliers and buyer, even though quite small portion of buyer's profitability should be sacrified.

An Iterative Data-Flow Optimal Scheduling Algorithm based on Genetic Algorithm for High-Performance Multiprocessor (고성능 멀티프로세서를 위한 유전 알고리즘 기반의 반복 데이터흐름 최적화 스케줄링 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.115-121
    • /
    • 2015
  • In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.

Effect of Incorrectly Estimated Parameters on the Control of Specific Growth Rate in E. coli Fed-Batch Fermentation

  • Park, Tai-Hyun;Yoon, Sung-Kwan;Kang, Whan-Koo
    • Biotechnology and Bioprocess Engineering:BBE
    • /
    • v.1 no.1
    • /
    • pp.22-25
    • /
    • 1996
  • An Exponetial feeding strategy has been frequently used in fed-batch fermentation of recombinant E. coli. In this feeding scheme, growth yield and initial cell concentration, which can be erroneously determined, are needed to calculate the feed rate for controlling specific growth rate at the set point. The effect of the incorrect growth yield and initial cell concentration on the control of the specific growth rate was theoretically analyzed. Insignificance of the correctness of those parameters for the control of the specific growth rate was shown theoretically and experimentally.

  • PDF

Distribution System Reconfiguration Considering Customer and DG Reliability Cost

  • Cho, Sung-Min;Shin, Hee-Sang;Park, Jin-Hyun;Kim, Jae-Chul
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.4
    • /
    • pp.486-492
    • /
    • 2012
  • This paper presents a novel objective function for distribution system reconfiguration for reliability enhancement. When islanding operations of distributed generators is prohibited, faults in the feeder interrupt the operation of distributed generators. For this reason, we include the customer interruption cost as well as the distributed generator interruption cost in the objective function in the network reconfiguration algorithm. The network reconfiguration in which genetic algorithms are used is implemented by MATLAB. The effect of the proposed objective function in the network reconfiguration is analyzed and compared with existing objective functions through case studies. The network reconfiguration considering the proposed objective function is suitable for a distribution system that has a high penetration of distributed generators.

Design and Implementation of Simulation Tool for Rural Postman Problem (Rural Postman Problem 시뮬레이션 툴 설계 및 구현)

  • Kang, Myung-Ju
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2016.07a
    • /
    • pp.239-240
    • /
    • 2016
  • 본 논문에서는 RPP(Rural Postman Problem)을 시뮬레이션 하기 위한 툴을 설계하고 구현하였다. RPP 문제의 해를 구하기 위해 유전 알고리즘을 시뮬레이션 툴 내부에 엔진으로 구현하였다. 시뮬레이션 툴의 구성은 유전 알고리즘의 파라미터를 설정하기 위한 사용자 인터페이스 부분과 시뮬레이션 결과를 그래프로 표현해 주는 Presentation Layer, 유전 알고리즘을 이용하여 경로탐색을 처리하는 Operation Layer, 유전 알고리즘에서 사용되는 염색체들을 저장 관리하는 Data Layer로 되어 있다. 본 논문에서 구현한 시뮬레이션 툴을 이용하여 다양한 RPP 문제를 파라미터의 설정만을 통해 해를 구할 수 있으며, 실험 결과를 그래프로 확인할 수 있다.

  • PDF