• International Journal of Naval Architecture and Ocean Engineering
• /
• v.8 no.6
• /
• pp.602-614
• /
• 2016

It is necessary to develop an efficient optimization technique to perform optimum designs which have given design spaces, discrete design values and several design goals. As optimization techniques, direct search method and stochastic search method are widely used in designing of ship structures. The merit of the direct search method is to search the optimum points rapidly by considering the search direction, step size and convergence limit. And the merit of the stochastic search method is to obtain the global optimum points well by spreading points randomly entire the design spaces. In this paper, Pareto Strategy (PS) multi-objective function method is developed by considering the search direction based on Pareto optimal points, the step size, the convergence limit and the random number generation. The success points between just before and current Pareto optimal points are considered. PS method can also apply to the single objective function problems, and can consider the discrete design variables such as plate thickness, longitudinal space, web height and web space. The optimum design results are compared with existing Random Search (RS) multi-objective function method and Evolutionary Strategy (ES) multi-objective function method by performing the optimum designs of double bottom structure and double hull tanker which have discrete design values. Its superiority and effectiveness are shown by comparing the optimum results with those of RS method and ES method.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.2
• /
• pp.185-193
• /
• 2009

This paper presents a methodology for photovoltaic (PV) system allocation in distribution systems using a discrete particle swarm optimization (DPSO). The PV allocation problem is in the category of mixed integer nonlinear programming and its formulation may include multi-valued dis-crete variables. Thus, the PSO requires a scheme to deal with multi-valued discrete variables. This paper introduces a novel multi-level quantization scheme using a sigmoid function for discrete particle swarm optimization. The technique is employed to a standard PSO architecture; the same velocity update equation as in continuous versions of PSO is used but the particle's positions are updated in an alternative manner. The set of multi-level quantization is defined as integer multiples of powers-of-two terms to efficiently approximate the sigmoid function in transforming a particle's position into discrete values. A comparison with a genetic algorithm (GA) is performed to verify the quality of the solutions obtained.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.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.

• Journal of KSNVE
• /
• v.10 no.3
• /
• pp.451-456
• /
• 2000

In this paper a discrete time model for the identification of nonlinear vibration system with stick-slip friction is proposed. The proposed model can handle the highly nonlinear behavior of the friction such as stick-slip phenomenon and Stribeck effect. The basic idea of the proposed model is as follows : If the nonlinearity of the system can be predicted as a simple function then this nonlinear function term cab be directly used in the discrete time model. By doing this the number of nonlinear terms in the model can be much less than those of NARMAX model which is widely used nonlinear discrete model. The simulation result shows that the proposed model can estimate the response of the nonlinear vibration system with stick-slip friction very well with less computational effort.

• Proceeding of KASS Symposium
• /
• 2005.05a
• /
• pp.236-245
• /
• 2005

This paper was developed the discrete optimum design program by the refined fuzzy-genetic algorithms based on the genetic algorithms and fuzzy theory. The optimum design of this paper can perform both size and shape optimum design for planar and spacial steel structures. In this paper, the objective function is the weight of steel structures and the constraints are the design limits defined by design and buckling strengths, displacements and thicknesses. The design variables are dimensions and coordinates of steel sections. Design examples are given to show the applicability of the discrete optimum design program of this paper.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.641-643
• /
• 1998

This paper deals with the stability of discrete time linear systems with time - varying delays in state. In this paper, the magnitude of time - varying delays is assumed to be upper-bounded. The stability of discrete time linear systems with time - varying delays in state is related with the stability of discrete time linear systems with constant time delay in state. To show this, a new Lyapunov function is proposed. Using this Lyapunov function, a sufficient condition for the asymptotic stability is derived.

• Honam Mathematical Journal
• /
• v.45 no.3
• /
• pp.457-470
• /
• 2023

In this study, we set a boundary value problem (BVP) consisting of a discrete Sturm-Liouville equation with transmission condition and boundary conditions depending on generalized eigenvalue parameter. Discussing the Jost and scattering solutions of this BVP, we present scattering function and find some properties of this function. Furthermore, we obtain resolvent operator, continuous and discrete spectrum of this problem and we give an valuable asymptotic equation to get the properties of eigenvalues. Finally, we give an example to compare our results with other studies.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.52 no.5
• /
• pp.19-26
• /
• 2010

This study was conducted to find out the reasonable optimum design method of agricultural reinforced concrete structures. Selected design variables are the dimension of concrete section, reinforced steel area, and objective function is formulated by cost function. To test the reliability, efficiency, possibility of application and reasonability of optimum design method, both continuous optimization method and mixed-discrete optimization method were applied to the design of reinforced concrete superstructure of aqueduct and application results were discussed. It is proved that mixed-discrete optimization method is more reliable, efficient and reasonable than continuous optimization method for the optimum design of reinforced concrete agricultural structures.

• Journal of the Korean Mathematical Society
• /
• v.43 no.6
• /
• pp.1269-1287
• /
• 2006

As a continuation of computing the zeta function of a regular covering graph by Mizuno and Sato in [9], we derive in this paper computational formulae for the zeta functions of a graph bundle and of any (regular or irregular) covering of a graph. If the voltages to derive them lie in an abelian or dihedral group and its fibre is a regular graph, those formulae can be simplified. As a by-product, the zeta function of the cartesian product of a graph and a regular graph is obtained. The same work is also done for a discrete torus and for a discrete Klein bottle.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.509-527
• /
• 2013

A Krawtchouk polynomial is introduced as the classical Mac-Williams identity, which can be expressed in weight-enumerator-free form of a linear code and its dual code over a Hamming scheme. In this paper we find a new explicit expression for the $p$-number and the $q$-number, which are more generalized notions of the Krawtchouk polynomial in the P-polynomial schemes by using an extended version of a discrete Green's function. As corollaries, we obtain a new expression of the Krawtchouk polynomial over the Hamming scheme and the Eberlein polynomial over the Johnson scheme. Furthermore, we find another version of the MacWilliams identity over a Hamming scheme.