• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

• Journal of Ocean Engineering and Technology
• /
• v.24 no.6
• /
• pp.109-113
• /
• 2010

We present the minimum weight optimum design of cross sectional for frame structures subject to natural frequency. The optimum design in this paper employ discrete and continuous design variables and Genetic Algorithms. In this paper, Genetic Algorithms is used in optimization process, and be used the method of Elitism and penalty parameters in order to improved fitness in the reproduction process. For 1-Bay 2-Story frame structure, in examples, continuous and discrete design variables are used, and W-section (No.1~No.64), from AISC, discrete data are used in discrete optimization. In this case, Exhaustive search are used for finding global optimum. Continuous variables are used for 1-Bay 7-Story frame structure. Two typical frame structure optimization examples are employed to demonstrate the availability of Genetic Algorithms for solving minimum weight optimum of frame structures with fundamental and multi frequency.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1005-1010
• /
• 2004

The structural optimization has been carried out in the continuous design space or in the discrete design space. Generally, available designs are discrete in design practice. But methods for discrete variables are extremely expensive in computational cost. In order to overcome this weakness, an iterative optimization algorithm was proposed for design in the discrete space, which is called as a sequential algorithm using orthogonal arrays (SOA). We focus to verify the fact that the local solution can be obtained throughout the optimization with this algorithm. The local solution is defined in discrete design space. Then the search space, which is the set of candidate values of each design variables formed by the neighborhood of current design point, is defined. It is verified that a local solution can be founded by moving sequentially the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained using the SOA algorithm

• Computational Structural Engineering
• /
• v.10 no.2
• /
• pp.255-263
• /
• 1997

The optimum design of most structural systems used in practice requires considering design variables as discrete quantities. The present paper shows that the linear approximation method is very effective as a tool for the discrete optimum designs of unsymmetric composite laminates. The formulated design problem is subjected to a multiple in-plane loading condition due to shear and axial forces, bending and twisting moments, which is controlled by maximum strain criterion for each of the plys of a composite laminate. As an initial approach, the process of continuous variable optimization by FDM is required only once in operating discrete optimization. The nonlinear discrete optimization problem that has the discrete and continuous variables is transformed into the mixed integer programming problem by SLDP. In numerical examples, the discrete optimum solutions for the unsymmetric composite laminates consisted of six plys according to rotated stacking sequence were found, and then compared the results with the nonlinear branch and bound method to verify the efficiency of present method.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2001.11a
• /
• pp.166-171
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design for the application-based exclusive rolling element bearings, this study propose design methodologies by using a genetic-based combinatorial optimization. By the presence of discrete variables such as the number of rolling element (standard component) and by the engineering point of views, the design problem of the rolling element bearing can be characterized by the combinatorial optimization problem as a fully discrete optimization. A genetic algorithm is used to efficiently find a set of the optimum discrete design values from the pre-defined variable sets. To effectively deal with the design constraints and the multi-objective problem, a ranking penalty method is suggested for constructing a fitness function in the genetic-based combinatorial optimization. To evaluate the proposed design method, a robust performance analyzer of ball bearing based on quasi-static analysis is developed and the computer program is applied to some design problems, 1) maximize fatigue life, 2) maximize stiffness, 3) maximize fatigue life and stiffness, of a angular contact ball bearing. Optimum design results are demonstrate the effectiveness of the design method suggested in this study. It believed that the proposed methodologies can be effectively applied to other multi-objective discrete optimization problems.

• Journal of Ocean Engineering and Technology
• /
• v.21 no.2 s.75
• /
• pp.75-80
• /
• 2007

The design variables for structural systems, in most practical designs, are chosen from a list of discrete values, which are commercially available sizing. This paper presents the application of Genetic Algorithms for determining the optimum design for two-dimensional structures with discrete and pseudocontinuous design variables. Genetic Algorithms are heuristic search algorithms and are effective tools for finding global solutions for discrete optimization. In this paper, Genetic Algorithms are used as the method of Elitism and penalty parameters, in order to improve fitness in the reproduction process. Examples in this paper include: 10 bar planar truss and 1 bay 8-story frame. Truss with discrete and pseudoucontinuous design variables and steel frame with W-sections are used for the design of discrete optimization.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.5
• /
• pp.27-37
• /
• 2020

Structural optimization problems with discrete design variables require more function calculations (or finite element analyses) than those in the continuous design space. In this study, a method to find an optimal solution in the discrete design of the truss structure is presented, reducing the number of function calculations. Because a continuous optimal solution is the Karush-Kuhn-Tucker point that satisfies the optimality condition, it is assumed that the discrete optimal solution is around the continuous optimum. Then, response values such as weight, displacement, and stress are predicted using approximate models-referred to as hybrid metamodels-within specified design ranges. The discrete design method using the hybrid metamodels is used as a post-process of the continuous optimization process. Standard truss design problems of 10-bar, 25-bar, 15-bar, and 52-bar are solved to show the usefulness of this method. The results are compared with those of existing methods.

• Steel and Composite Structures
• /
• v.15 no.4
• /
• pp.451-466
• /
• 2013

This paper deals with the multi-objective optimization of tire reinforcement structures such as the tread belt and the carcass path. The multi-objective functions are defined in terms of the discrete-type design variables and approximated by artificial neutral network, and the sensitivity analyses of these functions are replaced with the iterative genetic evolution. The multi-objective optimization algorithm introduced in this paper is not only highly CPU-time-efficient but it can also be applicable to other multi-objective optimization problems in which the objective function, the design variables and the constraints are not continuous but discrete. Through the illustrative numerical experiments, the fiber-reinforced tire belt structure is optimally tailored. The proposed multi-objective optimization algorithm is not limited to the tire reinforcement structure, but it can be applicable to the generalized multi-objective structural optimization problems in various engineering applications.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.9
• /
• pp.55-61
• /
• 2009

This paper presents a modified Phasor Discrete Particle Swarm Optimization (PDPSO) algorithm to configure Community Energy Systems(CESs) in the distribution system. The CES obtains electric power from its own Distributed Generations(DGs) and purchases insufficient power from the competitive power market, to supply power for customers contracted with the CES. When there are two or more CESs in a network, the CESs will continue the competitive expansion to reduce the total operation cost. The particles of the proposed PDPSO algorithm have magnitude and phase angle values, and move within a circle area. In the case study, the results by PDPSO algorithm was compared with that by the conventional DPSO algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1362-1366
• /
• 2003

Workload programming is allocating suitable workloads of production process according to the needs of products, which would minimize the total cost of both work and stock under some constraint conditions. In this paper, a production process flow chart of discrete manufacturing is presented by a Petri net, and the optimization model of workload-stock is established. An approach of the optimal workloads is provided by means of the integer matrix theory. An example is given to verify this method.