• 한국컴퓨터정보학회논문지
• /
• 제21권5호
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• pp.458-465
• /
• 2000

In the field of structural optimization simulated annealing (SA) algorithm has widely been adopted as an optimizer with the positive features of SA such as simplicity of the algorithm and possibility of finding global solution However, annealing process of SA algorithm based on random generator with the zeroth order structural information requires a large of number of iterations highly depending on cooling schedules and stopping criteria. In this paper, MSA algorithm is presented in the form of two phase annealing process with the effective cooling schedule and stopping criteria. With the application to optimal seismic design of steel structures, the performance of the proposed MSA algorithm has been demonstrated with respect to stability and global convergence of the algorithm

• 대한산업공학회지
• /
• 제32권1호
• /
• pp.9-17
• /
• 2006

This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

• 대한기계학회논문집A
• /
• 제30권11호
• /
• pp.1358-1368
• /
• 2006

This paper proposes a Pareto artificial life algorithm for solving multi-objective optimization problems. The artificial life algorithm for optimization problem with a single objective function is improved to handle Pareto optimization problem through incorporating the new method to estimate the fitness value for a solution and the Pareto list to memorize and to improve the Pareto optimal set. The proposed algorithm was applied to the optimum design of a journal bearing which has two objective functions. The Pareto front and the optimal solution set for the application were presented to give the possible solutions to a decision maker or a designer. Furthermore, the relation between linearly combined single-objective optimization problem and Pareto optimization problem has been studied.

• 산업공학
• /
• 제22권1호
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

• 한국정밀공학회지
• /
• 제17권4호
• /
• pp.121-128
• /
• 2000

In this paper, the control algorithm fur an autonomous vehicle is studied and applied to an actual 2 wheel-driven vehicle system. In order to control a nonholonomic system, the kinematic model for an autonomous vehicle is constructed by relative velocity relationship about the virtual point at distance from the vehicle's frame. And the optimal controller that based on the kinematic model is operated on purpose to track a reference vehicle's path. The actual system is designed with named 'HYAVI' and the system controller is applied. Because all the results of simulation don't satisfy the driving conditions of HYAVI, a reformed control algorithm that satisfies an actual autonomous vehicle is applied at HYAVI. At the results of actual experiments, the path tracking works very well by the reformed control algorithm. An autonomous vehicle that applied this control algorithm can be easily used for a path generation algorithm.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.43-56
• /
• 2009

In korean peninsular, aircraft defense with SAM (Surface-to-Air Missile) is very important because of short range of combat space in depth. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Set covering model which can handle both factors simultaneously and Multi-heuristic algorithm for solving allocation problem of the batteries and missile assignment problem in each battery. Genetic algorithm is used to decide optimal location of the batteries. To determine the number of SAM, a heuristic algorithm is applied for solving missile assignment problem. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of air defense operations.

• Journal of Construction Engineering and Project Management
• /
• 제7권2호
• /
• pp.1-10
• /
• 2017

The Clonal Selection Algorithm (CSA) is an algorithm inspired by the human immune system mechanism. In CSA, several parameters needs to be optimized by large amount of sensitivity analysis for the optimal results. They limit the accuracy of the results due to the uncertainty and subjectivity. Adaptive Clonal Selection (ACS), a modified version of CSA, is developed as an algorithm without controls by pre-defined parameters in terms of selection process and mutation strength. In this paper, we discuss the ACS in detail and present its implementation in construction site utilization planning (CSUP). When applied to a developed model published in research literature, it proves that the ACS are capable of searching the optimal layout of temporary facilities on construction site based on the result of objective function, especially when the parameterization process is considered. Although the ACS still needs some improvements, obtaining a promising result when working on a same case study computed by Genetic Algorithm and Electimze algorithm prove its potential in solving more complex construction optimization problems in the future.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권9호
• /
• pp.433-445
• /
• 2000

In this paper, optimal tuning problem of power system stabilizer(PSS) using Immune Algorithm(IA) is investigated to improve power system dynamic stability. In proposed method, objective function is represented as antigens. An affinity calculation is embedded within the algorithm for determining the promotion or suppression of antibody. An antibody that most fits the antigen is considered as the solution to PSS tuning problem. The computaton performance by the proposed method is compared with Genetic Algorithm(GA). The porposed PSS using IA has been applied for two sample system, single-machine infinite bus system and multi-machine power system. The performance of the proposed PSS is compared with that of conventional PSS. It is shown that the proposed PSS tuned using immune algorithm is more robust than conventional PSS.