• Title/Summary/Keyword: genetic algorithm operators

Search Result 172, Processing Time 0.034 seconds

A MULTI-OBJECTIVE OPTIMIZATION FOR CAPITAL STRUCTURE IN PRIVATELY-FINANCED INFRASTRUCTURE PROJECTS

  • S.M. Yun;S.H. Han;H. Kim
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.509-519
    • /
    • 2007
  • Private financing is playing an increasing role in public infrastructure construction projects worldwide. However, private investors/operators are exposed to the financial risk of low profitability due to the inaccurate estimation of facility demand, operation income, maintenance costs, etc. From the operator's perspective, a sound and thorough financial feasibility study is required to establish the appropriate capital structure of a project. Operators tend to reduce the equity amount to minimize the level of risk exposure, while creditors persist to raise it, in an attempt to secure a sufficient level of financial involvement from the operators. Therefore, it is important for creditors and operators to reach an agreement for a balanced capital structure that synthetically considers both profitability and repayment capacity. This paper presents an optimal capital structure model for successful private infrastructure investment. This model finds the optimized point where the profitability is balanced with the repayment capacity, with the use of the concept of utility function and multi-objective GA (Generic Algorithm)-based optimization. A case study is presented to show the validity of the model and its verification. The research conclusions provide a proper capital structure for privately-financed infrastructure projects through a proposed multi-objective model.

  • PDF

A study on automation of crane operation (천정 크레인의 자동화 연구)

  • 박병석;김성현;윤지섭
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.1871-1875
    • /
    • 1997
  • Crane operation is manually accomplished by skilled operators. Recently, the concept of automation is widely introduced in shipping and unloading operation using the overhead crane for the enhanced productivity. In this regards, we designed an angle detector and 3D position detectro which are key evices for this operation. As well as an intellignet control algorithm is developed for the implementation of swing free crane. The performance of the presented algorithm is tested for the swing angle and the position of the overheas crand. The control scheme adopts a feedback control of an angular velocity of swing in initial phase and then the fuzzy controller whose rule base is optimized by a genetic algorithm.

  • PDF

An Efficient Algorithm for Balancing and Sequencing of Mixed Model Assembly Lines (혼합모델 조립라인의 작업할당과 투입순서 결정을 위한 효율적인 기법)

  • Kim Dong Mook;Kim Yong Ju;Lee keon Shang;Lee Nam Seok
    • Journal of the Korea Safety Management & Science
    • /
    • v.7 no.3
    • /
    • pp.85-96
    • /
    • 2005
  • This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

Determination of Part Orientation and Packing in SLS Process (SLS에서의 자동적인 조형자세 및 배치 결정에 관한 연구)

  • Hur, Sung-Min;Chang, Pok-Keun;Choi, Kyung-Hyun;Lee, Seok-Hee
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.11
    • /
    • pp.139-147
    • /
    • 1999
  • Rapid Prototyping has made a drastic change in all industries which needs to reduce the time for the development of new products. Orientation and packing in rapid prototyping is considered as the most important factors to maximize the utilization of space in the build chamber and reduce build time. However, the decision of these parameter is mainly dependant on the operators's experience. This paper presents the methodology to find the optimal build layout considering an orientation and packing of multiple parts in SLS processing. Each part is represented as a voxel structure to deal with the inefficiency in a bounding box approach. Test results show that the adapted BL algorithm with a genetic algorithm(GA) can be applicable to a real industry.

  • PDF

Optimizing Assembly Line Balancing Problems with Soft Constraints (소프트 제약을 포함하는 조립라인 밸런싱 문제 최적화)

  • Choi, Seong-Hoon;Lee, Geun-Cheol
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.105-116
    • /
    • 2018
  • In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

A GA-based Inductive Learning System for Extracting the PROSPECTOR`s Classification Rules (프러스펙터의 분류 규칙 습득을 위한 유전자 알고리즘 기반 귀납적 학습 시스템)

  • Kim, Yeong-Jun
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.822-832
    • /
    • 2001
  • We have implemented an inductive learning system that learns PROSPECTOR-rule-style classification rules from sets of examples. In our a approach, a genetic algorithm is used in which a population consists of rule-sets and rule-sets generate offspring through the exchange of rules relying on genetic operators such as crossover, mutation, and inversion operators. In this paper, we describe our learning environment centering on the syntactic structure and meaning of classification rules, the structure of a population, and the implementation of genetic operators. We also present a method to evaluate the performance of rules and a heuristic approach to generate rules, which are developed to implement mutation operators more efficiently. Moreover, a method to construct a classification system using multiple learned rule-sets to enhance the performance of a classification system is also explained. The performance of our learning system is compared with other learning algorithms, such as neural networks and decision tree algorithms, using various data sets.

  • PDF

Trajectory Optimization for Biped Robots Walking Up-and-Down Stairs based on Genetic Algorithms (유전자 알고리즘을 이용한 이족보행 로봇의 계단 보행)

  • Jeon Kweon-Soo;Kwon O-Hung;Park Jong-Hyeon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.23 no.4 s.181
    • /
    • pp.75-82
    • /
    • 2006
  • In this paper, we propose an optimal trajectory for biped robots to move up-and-down stairs using a genetic algorithm and a computed-torque control for biped robots to be dynamically stable. First, a Real-Coded Genetic Algorithm (RCGA) which of operators are composed of reproduction, crossover and mutation is used to minimize the total energy. Constraints are divided into equalities and inequalities: Equality constraints consist of a position condition at the start and end of a step period and repeatability conditions related to each joint angle and angular velocity. Inequality constraints include collision avoidance conditions of a swing leg at the face and edge of a stair, knee joint conditions with respect to the avoidance of the kinematic singularity, and the zero moment point condition with respect to the stability into the going direction. In order to approximate a gait, each joint angle trajectory is defined as a 4-th order polynomial of which coefficients are chromosomes. The effectiveness of the proposed optimal trajectory is shown in computer simulations with a 6-dof biped robot that consists of seven links in the sagittal plane. The trajectory is more efficient than that generated by the modified GCIPM. And various trajectories generated by the proposed GA method are analyzed in a viewpoint of the consumption energy: walking on even ground, ascending stairs, and descending stairs.

Evolutionary Algorithm for solving Optimum Communication Spanning Tree Problem (최적 통신 걸침 나무 문제를 해결하기 위한 진화 알고리즘)

  • Soak Sang-Moon;Chang Seok-Cheol;Byun Sung-Cheal;Ahn Byung-Ha
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.268-276
    • /
    • 2005
  • This paper deals with optimum communication spanning tree(OCST) problem. Generally, OCST problem is known as NP-hard problem and recently, it is reveled as MAX SNP hard by Papadimitriou and Yannakakis. Nevertheless, many researchers have used polynomial approximation algorithm for solving this problem. This paper uses evolutionary algorithm. Especially, when an evolutionary algorithm is applied to tree network problem such as the OCST problem, representation and genetic operator should be considered simultaneously because they affect greatly the performance of algorithm. So, we introduce a new representation method to improve the weakness of previous representation which is proposed for solving the degree constrained minimum spanning tree problem. And we also propose a new decoding method to generate a reliable tree using the proposed representation. And then, for finding a suitable genetic operator which works well on the proposed representation, we tested three kinds of genetic operators using the information of network or the genetic information of parents. Consequently, we could confirm that the proposed method gives better results than the previous methods.

FSS Design System Using Genetic Algorithm and Characteristic Data Base (유전알고리즘과 특성 DB를 이용한 FSS 설계 시스템)

  • Lee Ji-Hong;Lee Fill-Youb;Seo Il-Song;Kim Geun-Hong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.4 s.346
    • /
    • pp.58-66
    • /
    • 2006
  • This paper proposes an FSS(Frequency Selective Surface) design system that automatically derives design parameters minimally specified by engineers. The proposed system derives optimal design parameters through theory of electromagnetic scattering on FSS, database implemented from real data obtained from practically manufactured FSS, and GA(Genetic Algorithm) for optimizing design parameters. The system, at the first step, searches the best matching FSS within preconstructed DB with given characteristics specified by operators, and then sets initial genes from the searched FSS parameters. GA iterates the optimization process until the system finds the FSS design parameters that matches the characteristics specified by operators. The theory for the electromagnetic scattering on FSS is verified by comparing the simulation results with real data obtained by measuring system composed of horn antenna and receiver. The process for manufacturing the FSS is also included in the paper.

Balancing and Sequencing of Mixed Model Assembly Lines Using A Genetic Algorithm (유전알고리듬을 이용한 혼합모델 조립라인의 작업할당과 투입 순서 결정)

  • 김동묵;김용주;이남석
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2005.05a
    • /
    • pp.523-534
    • /
    • 2005
  • This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

  • PDF