• 제목/요약/키워드: Solution Representation

검색결과 308건 처리시간 0.022초

Finite Element Numerical Analysis on Tidal Characteristic Changes due to Seadike Construction

  • Kwun, Soon-Kuk;Na, Jeong-Woo;Chang, Hyun-Jin
    • 한국농공학회지
    • /
    • 제39권2호
    • /
    • pp.19-25
    • /
    • 1997
  • Abstract [] The prediction of changes in the tidal regime due to the sea dike closure in the Saemankum area was performed using the nonlinear finite element model, TIDE. Based upon an overall comparison of calibrated model results with available field data, the TIDE model behaves well and is good representation of the hydrodynamic of the Saemankum tidal project area. It is shown that the TIDE model does an excellent job of computing the changes of tidal characteristics resulting in sea dike closure in an estuary area.

  • PDF

FDMA 무선통신 네트워크에서 채널할당을 위한 HGLS 알고리듬 (Hybrid Genetic and Local Search (HGLS) Algorithm for Channel Assignment in FDMA Wireless Communication Network)

  • 김성수;민승기
    • 산업공학
    • /
    • 제18권4호
    • /
    • pp.504-511
    • /
    • 2005
  • The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

유전 알고리즘을 이용한 Wibro MMR 네트워크의 최적 배치 탐색 (Optimal topology in Wibro MMR Network Using a Genetic Algorithm)

  • 오동익;김우제
    • 대한산업공학회지
    • /
    • 제34권2호
    • /
    • pp.235-245
    • /
    • 2008
  • The purpose of this paper is to develop a genetic algorithm to determine the optimal locations of base stations and relay stations in Wibro MMR Network. Various issues related to the genetic algorithm such as solution representation, selection method, crossover operator, mutation operator, and a heuristic method for improving the quality of solutions are presented. The computational results are presented for determining optimal parameters for the genetic algorithm, and show the convergence of the genetic algorithm.

무선통신 네트워크에서 동적채널할당을 위한 진화프로그램의 개발 (Development of Evolution Program for Dynamic Channel Assignment in Wireless Telecommunication Network)

  • 김성수;한광진;이종현
    • 산업공학
    • /
    • 제14권3호
    • /
    • pp.227-235
    • /
    • 2001
  • There is a rapidly growing demand for wireless telecommunication. However, the number of usable channel is very limited. Therefore, the problem of channel assignment becomes more and more important to use channels as efficiently as possible. The objective of this paper is to develop an evolution program (EP) to find an efficient dynamic channel assignment method for minimum interference among the channels within reasonable time. The series of specific channel number is used as a representation of chromosome. The only changed chromosomes by crossover and mutation are evaluated in each generation to save computation time and memory for the progress of improved EP. We can easily differentiate the fitness value of each chromosome using proposed evaluation function. We also control the weighting factor of the mutation rate and the used number of elitist chromosomes for the speed of convergence to the optimal solution.

  • PDF

복합설계를 위한 동시공학적 접근방법 (A Heuristic Approach Solving for the Complex Design with Precedence Constraints in Concurrent Engineering)

  • 조문수;김창영
    • 대한산업공학회지
    • /
    • 제24권2호
    • /
    • pp.185-197
    • /
    • 1998
  • Engineering design involves the specification of many variables that define a product, how it is made, and how it behaves. Before some variables can be determined, other variables must first be known or assumed. This fact implies a precedence order of the variables, and of the tasks of determining these variable consequently. Moreover, design of complex systems may involve a large number of design activities. In this paper, the activity-activity incidence matrix is considered as a representation of design activity analysis which mainly focuses on the precedence constraint. In order to analyze the activity-activity incidence matrix, a heuristic algorithm is proposed, which transforms an activity-activity, parameter-formula, and parameter-parameter incidence matrix into a lower triangular form. The analysis of the structured matrices can not only significantly reduce the overall project complexity by reorganizing few critical tasks in practice, but also aims at obtaining shorter times considering the solution structure by exploring concurrency.

  • PDF

Genetic algorithms with a permutation approach to the parallel machines scheduling problem

  • Han, Yong-Ho
    • 경영과학
    • /
    • 제14권2호
    • /
    • pp.47-61
    • /
    • 1997
  • This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

  • PDF

배수분조작을 위한 세포유전학적 연구 (Cytogenetic Studies of Polyploidy Manipulation)

  • 손진기
    • 한국가축번식학회지
    • /
    • 제13권1호
    • /
    • pp.49-55
    • /
    • 1989
  • The Results of colchicine and pretreatment time have shown that the cells of Coho Salmon(Oncorhynchus Kisutch) were effectively injected 6 hours prior to the harvest at a final concentration of 10$\mu\textrm{g}$/g body weight. The cell-density from 8,000 cells/㎣ (=8${\times}$106 ml) was found as ideal. The best effect of hypotonic solution in proportion to the cell is 20 : 1 and 50 minutes. The model number of diploid chromosome in this species was 2n=60. The karyotype analysis proved that the diploid complement consisted of 19 pairs of metacentric-, 4 pairs of submetacentric- and 7 paris of acrocentric-chromosomes. The diagrammatic representation proved that the diploid complement consisted of 7 pairs of metacentric-, 2 pairs of submetacentric- and 1 pair of acrocentric-chromosomes.

  • PDF

MONOTONICITY PROPERTIES OF THE GENERALIZED STRUVE FUNCTIONS

  • Ali, Rosihan M.;Mondal, Saiful R.;Nisar, Kottakkaran S.
    • 대한수학회지
    • /
    • 제54권2호
    • /
    • pp.575-598
    • /
    • 2017
  • This paper introduces and studies a generalization of the classical Struve function of order p given by $$_aS_{p,c}(x):=\sum\limits_{k=0}^{\infty}\frac{(-c)^k}{{\Gamma}(ak+p+\frac{3}{2}){\Gamma}(k+\frac{3}{2})}(\frac{x}{2})^{2k+p+1}$$. Representation formulae are derived for $_aS_{p,c}$. Further the function $_aS_{p,c}$ is shown to be a solution of an (a + 1)-order differential equation. Monotonicity and log-convexity properties for the generalized Struve function $_aS_{p,c}$ are investigated, particulary for the case c = -1. As a consequence, $Tur{\acute{a}}n$-type inequalities are established. For a = 2 and c = -1, dominant and subordinant functions are obtained for the Struve function $_2S_{p,-1}$.

무작위 데이터 근사화를 위한 유계오차 B-스플라인 근사법 (An Error-Bounded B-spline Fitting Technique to Approximate Unorganized Data)

  • 박상근
    • 한국CDE학회논문집
    • /
    • 제17권4호
    • /
    • pp.282-293
    • /
    • 2012
  • This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

경로의존성 없는 극좌표계 성형한계도를 이용한 판재 성형성 향상 기술 (The Improvement of Formability using the Polar-coordinate FLD with Strain Path Independence)

  • 배문기;홍승현;최광용;윤정환;김영석
    • 소성∙가공
    • /
    • 제24권5호
    • /
    • pp.348-353
    • /
    • 2015
  • The PEPS(Polar-coordinated Effective Plastic Strain) FLD(Forming Limit Diagram), a new type of FLD based on a polar representation of the EPS(Effective Plastic Strain), appears to be an effective solution to the problem of non-linear strain path effects. This method has the advantages of the familiar strain-based diagram for linear loading, but without the strain-hardening limitations of the stress-based diagram, or non-intuitive aspects of alternate Cartesian diagrams based on effective plastic strain. In the current study, the PEPS FLD was applied to the development process of an aluminum automobile-body panel, including the necking or crack prediction, die design, and die modification. As a result, the PEPS FLD provided improved formability of aluminum sheet as compared to deriving the potential formability with non-linearity.