• Advances in Computational Design
• /
• v.3 no.1
• /
• pp.49-69
• /
• 2018

This paper shows an optimal design for reinforced concrete rectangular combined footings based on a criterion of minimum cost. The classical design method for reinforced concrete rectangular combined footings is: First, a dimension is proposed that should comply with the allowable stresses (Minimum stress should be equal or greater than zero, and maximum stress must be equal or less than the allowable capacity withstand by the soil); subsequently, the effective depth is obtained due to the maximum moment and this effective depth is checked against the bending shear and the punching shear until, it complies with these conditions, and then the steel reinforcement is obtained, but this is not guaranteed that obtained cost is a minimum cost. A numerical experimentation shows the model capability to estimate the minimum cost design of the materials used for a rectangular combined footing that supports two columns under an axial load and moments in two directions at each column in accordance to the building code requirements for structural concrete and commentary (ACI 318S-14). Numerical experimentation is developed by modifying the values of the rectangular combined footing to from "d" (Effective depth), "b" (Short dimension), "a" (Greater dimension), "${\rho}_{P1}$" (Ratio of reinforcement steel under column 1), "${\rho}_{P2}$" (Ratio of reinforcement steel under column 2), "${\rho}_{yLB}$" (Ratio of longitudinal reinforcement steel in the bottom), "${\rho}_{yLT}$" (Ratio of longitudinal reinforcement steel at the top). Results show that the optimal design is more economical and more precise with respect to the classical design. Therefore, the optimal design presented in this paper should be used to obtain the minimum cost design for reinforced concrete rectangular combined footings.

• Advances in Computational Design
• /
• v.4 no.3
• /
• pp.273-294
• /
• 2019

In this paper is presented the minimum cost (optimal design) for reinforced concrete circular isolated footings based on an analytic model. This model considers a load and two moments in directions of the X and Y axes, and the pressure has a variation linear, these are the effects that act on the footing. The minimum cost (optimal design) and the Maple program are shown in Flowcharts. Two numerical experiments are shown to obtain the minimum cost design of the two materials that are used for a circular footing supporting an axial load and moments in two directions in accordance to the code of the ACI (American Concrete Institute), and it is compared against the current design (uniform pressure). Also, the same examples are developed through the normal procedure to verify the minimum cost (optimal design) presented in this document, i.e., the equations of moment, bending shear and punching shear are used to check the thickness, and after, the steel areas of the footing are obtained, and it is compared against the current design (uniform pressure). Results section show that the optimal design is more accurate and more economical than to any other model. Therefore, it is concluded that the optimized design model presented in this paper should be used to obtain the minimum cost design for the circular isolated footings.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.161-169
• /
• 2012

In general, Euclidean minimum spanning tree is a tree connecting input nodes with minimum connecting cost. But the tree may not be optimal when applied to real world problems of three dimension. In this paper, three dimension Euclidean minimum spanning tree is proposed, connecting all input nodes of 3-dimensional space with minimum cost. In experiments for 30,000 input nodes with 100% space ratio, the tree produced by the proposed method can reduce 90.0% connection cost tree, compared with the tree by two dimension Prim's minimum spanning tree. In two dimension plane, the proposed tree increases 251.2% connecting cost, which is pointless in 3-dimensional real world. Therefore, the proposed method can work well for many connecting problems in real world space of three dimensions.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.1
• /
• pp.9-16
• /
• 1984

This paper describes the minimum cost expansion planning which is based on the economical aspect under the various conditions on the power system expansion planning. It presents not only linear cost characteristics analysis but also stepwise cost characteristics analysis which satisfies practical condition in the power system. The latter analysis must be handled by integer programming (IP), because the relation between the cost and the capacity has stepwise characteristics. In order to proceed the latter analysis, the solving procedure is illustrated in detais by using branch and bound method which includes the network flow theory and maximum flow-minimum cut theorem.

• Structural Engineering and Mechanics
• /
• v.15 no.1
• /
• pp.39-52
• /
• 2003

A computer program has been developed for the optimum design of prestressed concrete beams under flexure. Optimum values of prestressing force, tendon configuration, and cross-sectional dimensions are determined subject to constraints on the design variables and stresses. 28 constraints have been used including flexural stresses, cover requirement, the aspect ratios for top and bottom flanges and web part of a beam and ultimate moment. The objective function contains cost of concrete, prestressing force and formwork. Using this function, it is possible to obtain minimum cost design, minimum weight or cross-sectional area of concrete design and minimum prestressing force design. Besides the idealized I-shaped cross-section, which is widely used in literature, a general I-shaped cross-section with eight geometrical design variables are used here. Four examples, one of which is available in the literature and the others are modified form of it, have been solved for minimum cost and minimum cross-sectional area designs and the results are compared. The computer program, which employs modified grid search optimization method, can assist a designer in producing efficient designs rapidly and easily. Considerable savings in computational work are thus made possible.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.141-151
• /
• 2012

This paper suggests more simple algorithm than Hungarian algorithm for assignment problem. Hungarian algorithm selects minimum cost of row and column, and subtracts minimum cost from each cost. Then, performs until the number of minimum lines with 0 equals the number of rows. But, the proposed algorithm selects the minimum cost for each rows only. From the start point with over 2 to the target point with null selects in column, fixes the maximum opportunity cost that the difference of the cost of starting point and target point, and moves the cost less than opportunity cost th more than previous cost. For the 25 balance and 7 unbalance assignment problems, This algorithm gets the optimal solution same as Hungarian algorithm. This algorithm improves the time complexity $O(n^3)$ of Hungarian algorithm to $O(n^2)$, and do not performs the transformation process from unbalance to balance assignment in Hungarian algorithm. Therefore, this algorithm can be alter Hungarian algorithm in assignment problem.

• Industrial Engineering and Management Systems
• /
• v.9 no.3
• /
• pp.204-214
• /
• 2010

A manufacturing/remanufacturing system is investigated with the consideration of required minimum quality of end-of-used products. A constant demand is satisfied by remanufacturing end-of-used products and manufacturing raw materials outsourced from outside. It is assumed in this system that the buyback price and remanufacturing cost are related to the different quality level of end-of-used products. For remanufacturing, only the used products that satisfy a required minimum quality level will be recycled. Thus, the returning rate is a function of the required minimum quality level. Functions of returning rate, buyback price and remanufacturing cost, which are closely connected to the quality level of end-of-used products, are investigated here. Treating the required minimum quality level of end-of-used products, the length of a cycle, the number of manufacturing lots and remanufacturing lots in a cycle as decision variables, the mathematical models with the objective of minimizing the average total cost are constructed. Through construction of a solution process based on Tabu Search algorithm and calculating examples, the validity of the models is illustrated.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.162-170
• /
• 2009

This paper deals with a closed-loop remanufacturing system with one manufacturer and one remanufacturer. The manufacturer sells new products bearing the 'Extended Producer Responsibility (EPR).' It is assumed that the manufacturer's collection rate of used products depends only on the buy-back cost, while that of the remanufacturer depends on the minimum allowed quality level of used products in addition to the buy-back cost. Through the development of mathematical models with the objective function of maximizing profit, we study an efficient operation policy of each party. The decision variables are the unit selling price of new products and remanufactured products, the unit buy-back cost of the used products of the manufacturer and remanufacturer, and the minimum allowed quality level. The validity of the model is examined through numerical examples and sensitivity analysis.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.3
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.281-292
• /
• 2006

The design and implementation of Generalized Minimum Variance control laws for nonlinear multivariable systems that can include severe nonlinearities is considered. The quadratic cost index minimised involves dynamically weighted error and nonlinear control signal costing terms. The aim here is to show the controller obtained is simple to design and implement. The features of the control law are explored. The controller obtained includes an internal model of the process and in one form is a nonlinear version of the Smith Predictor.