• Structural Engineering and Mechanics
• /
• v.71 no.4
• /
• pp.329-339
• /
• 2019

Assessment of failure probability, especially for a complex structure, requires a considerable number of calls to the numerical model. Reliability methods have been developed to decrease the computational time. In this approach, the original numerical model is replaced by a surrogate model which is usually explicit and much faster to evaluate. The current paper proposed an efficient reliability method based on Monte Carlo simulation (MCS) and multi-gene genetic programming (MGGP) as a robust variant of genetic programming (GP). GP has been applied in different fields; however, its application to structural reliability has not been tested. The current study investigated the performance of MGGP as a surrogate model in structural reliability problems and compares it with other surrogate models. An adaptive Metropolis algorithm is utilized to obtain the training data with which to build the MGGP model. The failure probability is estimated by combining MCS and MGGP. The efficiency and accuracy of the proposed method were investigated with the help of five numerical examples.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• Computers and Concrete
• /
• v.27 no.2
• /
• pp.143-152
• /
• 2021

Large dams are a part of the infrastructure of any society, and a huge amount of resources are consumed to build them. Among the various types of dams, the optimum design of concrete gravity dams requires special attention because these types of dams require a huge amount of concrete for their construction. On the other hand, concrete gravity dams are among the structures whose design, regarding the acting forces, geometric parameters, and resistance and stability criteria, has some complexities. In the present study, an optimization methodology is proposed based on Sequential Quadratic Programming (SQP), and a computer program is developed to perform optimization of concrete gravity dams. The optimum results for 45 concrete gravity dams are studied and regression analyses are performed to obtain some explicit formulas for optimization of the gravity dams. The optimization of concrete gravity dams can be provided easily using the developed formulas, without the need to perform any more optimization process.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.49 no.2
• /
• pp.153-160
• /
• 2013

Control allocation is an important part of a system. It implements the function that map the desired command forces from the controller into the commands of the different actuators. In this paper, the authors present an approach for solving constrained control allocation problem in vessel system by using multi-parametric quadratic programming (mp-QP) algorithm. The goal of mp-QP algorithm applied in this study is to compute a solution to minimize a quadratic performance index subject to linear equality and inequality constraints. The solution can be pre-computed off-line in the explicit form of a piecewise linear (PWL) function of the generalized forces and constrains. The efficiency of mp-QP approach is evaluated through a dynamic positioning simulation for a vessel by using four tugboats with constraints about limited pushing forces and found to work well.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.591-594
• /
• 2008

This paper explores how to characterise security properties of software components, and how to reason about their suitability for a trustworthy compositional contract. Our framework provides an explicit opportunity for software composers as well as software components to test a priori security properties of software components in a system composition. The proposed framework uses logic programming as a tool to represent security properties of atomic components and reason about their compositional matching with other components.

• Journal of Korean Institute of Industrial Engineers
• /
• v.11 no.2
• /
• pp.29-37
• /
• 1985

This paper studies a production-inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system. The integrated production-inventory model is formulated wth a nonlinear mixed integer programming problem. An algorithm is developed by utilizing the finite explicit enumeration method. The algorithm guarantees to generate an optimal policy for minimizing the total annual variable cost. A mumerical example involving 15 raw materials is given to illustrate the recommended solution procedure.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.197-206
• /
• 1995

In structural design procedure, The procedure of member selection manages complex data relationship and reflects structural expert's knowledge. It is a difficult problem to construct an effective system with the conventional l programming technique. Knowledge_based s!'stem is a software system capable of supporting the explicit representation of expert's knowledge in member selection process through member data and reasoning mechanisms. This study describes useful methodology for structuring knowledge and representing relation between member data and knowledge. And this study shows the application of this member for member selection in the steel structural design.

• Korean Management Science Review
• /
• v.33 no.1
• /
• pp.77-87
• /
• 2016

I study optimal consumption and investment choices of an infinitely-lived economic agent with a general time-separable von Neumann-Morgenstern utility under general borrowing constraints against future labor income. An explicit solution is provided by the dynamic programming method. It is shown that the optimal consumption and risky investment decrease as the borrowing constraints become stronger.

• Structural Engineering and Mechanics
• /
• v.76 no.6
• /
• pp.799-821
• /
• 2020

The optimum design of truss structures is one of the significant categories in structural optimization that has widely been applied by researchers. In the present study, new mathematical programming called Consistent Approximation (CONAP) method is utilized for the simultaneous optimization of the size and shape of truss structures. The CONAP algorithm has already been introduced to optimize some structures and functions. In the CONAP algorithm, some important parameters are designed by employing design sensitivities to enhance the capability of the method and its consistency in various optimum design problems, especially structural optimization. The cross-sectional area of the bar elements and the nodal coordinates of the truss are assumed to be the size and shape design variables, respectively. The displacement, allowable stress and the Euler buckling stress are taken as the design constraints for the problem. In the proposed method, the primary optimization problem is replaced with a sequence of explicit sub-problems. Each sub-problem is efficiently solved using the sequential quadratic programming (SQP) algorithm. Several truss structures are designed by employing the CONAP method to illustrate the efficiency of the algorithm for simultaneous shape and size optimization. The optimal solutions are compared with some of the mathematical programming algorithms, the approximation methods and metaheuristic algorithms those reported in the literature. Results demonstrate that the accuracy of the optimization is improved and the convergence rate speeds up.