• Advances in Computational Design
• /
• 제3권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
• /
• 제4권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.

• 한국컴퓨터정보학회논문지
• /
• 제17권1호
• /
• pp.161-169
• /
• 2012

일반적으로 유클리드 최소신장트리는 2차원 평면상에 존재하는 입력노드들이 최소 비용으로 연결된 것이다. 그러나 생성된 유클리드 최소신장트리는 3차원의 현실세계에 적용할 경우 그 연결비용은 최소비용이 아닐 수 있다. 본 논문에서는 3차원 공간상에 존재하는 입력노드를 최단 길이로 연결하는 3차원 유클리드 최소신장트리를 제안한다. 100%의 공간비율의 3차원 공간상에 존재하는 30,000개의 입력 노드에 대한 실험에서, 본 논문에서 제안된 방법에 생성된 트리는, Prim의 2차원 최소신장트리 알고리즘에 의해 생성된 유클리드 최소신장트리에 비해, 2차원 평면에서만 고려했을 때 251.2%의 연결 비용의 증가를 보이지만 이것은 3차원 실세계에서는 의미가 없다. 본 논문에서 제안된 방법에 의해 생성된 트리는 3차원 공간에서는 90.0%의 비용의 절감율을 보인다. 이는 제안된 방법이 3차원적 연결에 관한 많은 현실적인 문제에 잘 적용될 수 있음을 나타낸다.

• 대한전기학회논문지
• /
• 제33권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
• /
• 제15권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.

• 한국인터넷방송통신학회논문지
• /
• 제12권5호
• /
• pp.141-151
• /
• 2012

본 논문은 할당 문제의 최적해를 찾는 대표적인 Hungarian 보다 간단히 최적해를 구하는 알고리즘을 제안하였다. Hungarian 알고리즘은 행과 열의 최소 비용을 선택하고 각 비용에서 최소 비용을 뺀다. 다음으로 0을 모두 포함하는 최소한의 선이 행의 개수 가 될 때까지 수행한다. 반면에 제안된 알고리즘은 단지 행에 대해 최소 비용을 선택한다. 다음으로 열에 대해 2개 이상 선택된 열을 출발지로, 하나도 선택되지 않은 열을 목적지로하여 출발지의 비용에서 목적지의 최소 비용과의 차이인 기회비용이 가장 큰 비용은 고정시키고 기회비용이 보다 작은 비용들을 다음으로 큰 비용으로 이동시키는 방법을 적용하였다. 제안된 방법을 25개의 균형 할당과 7개의 불균형 할당 문제에 적용하여 Hungarian 알고리즘과 동일한 최적해를 구하는데 성공하였다. 제안된 알고리즘은 Hungarian 알고리즘의 수행 복잡도 $O(n^3)$를 $O(n^2)$로 개선하였으며, 불균형을 균형 할당 문제로 변환시키는 과정도 수행하지 않는 단순한 알고리즘이다. 따라서 할당 문제의 Hungarian 알고리즘을 대체시킬 수 있을 것이다.

• Industrial Engineering and Management Systems
• /
• 제9권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
• /
• 제8권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.

• 한국경영과학회지
• /
• 제25권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
• /
• 제4권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.