• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.917-920
• /
• 2016

SpSF algorithm is direction-of-arrival estimation algorithm based on sparse representation of incident signlas. Cost function to be optimized for DOA estimation is multi-dimensional nonlinear function, which is hard to handle for optimization. After some manipulation, the problem can be cast into convex optimiztion problem. Convex optimization problem tuns out to be constrained optimization problem, where the parameter in the constraint has to be determined. The solution of the convex optimization problem is dependent on the specific parameter value in the constraint. In this paper, we propose a rule-of-thumb for determining the parameter value in the constraint. Based on the fact that the noise in the array elements is complex Gaussian distributed with zero mean, the average of the Frobenius norm of the matrix in the constraint can be rigorously derived. The parameter in the constrint is set to be two times the average of the Frobenius norm of the matrix in the constraint. It is shown that the SpSF algorithm actually works with the parameter value set by the method proposed in this paper.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.30 no.3
• /
• pp.82-94
• /
• 1988

A growing attention has been paid to the optimum design of structures in recent years. Most studies on the optimum design of reinforced concrete structures has been mainly focussed to the design of structural members such as beams, slabs and columns, and there exist few studies that deal with the optimum design of large-scale concrete shell structures. The purpose of the present investigation is, therefore, to set up an efficient optimum design method for the large-scale reinforced concrete cylindrical shell structures like intake tower of reservoir. The major design variables are the dimensions and steel areas of each member of structures. The construction cost which is compo8ed of the concrete, steel, and form work costs, respectively, is taken as the objective function. The constraint equations for the design of intake-tower are derived on the basis of strength design method. The results obtained are summarized as follows 1. The efficient optimlzation algorithrns which can execute the automatic optimum design of reinforced concrete intake tower based on the strength design method were developed. 2. Since the objective function and design variables were converged to their optimum values within the first or second iteration, the optimization algorithms developed in this study seem to be efficient and stable. 3. When using the strength design method, the construction cost could be saved about 9% compared with working stress design method. Therefore, the reliability of algorithm was proved. 4. The difference in construction cost between the optimum designs with substructures and with entire structure was found to be small and thus the optimum design with substructures may conveniently be used in practical design. 5. The major active constraints of each structural member were found to be the 'bending moment constraint for slab, the minimum longitudinal steel ratio constraint for tower body and the shearing force, bending moment and maximum eccentricity constraints for footing, respectively. 6. The computer program developed in the present study can be effectively used even by an uneiperienced designer for the optimum design of reinforced concrete intake-tower on the basis of strength design method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.117-129
• /
• 2008

Make-to-order manufacturers with multiple plants at multiple sites need to have the ability to quickly determine which plant will produce which customer order to meet the due date and minimize the transportation cost from the plants to the customer. Balancing the work loads and minimizing setups and make-span are also of great concern. Solving such scheduling problems usually takes a long time. We propose a new approach, which we call 'preprocessing', for resolving such complex problems. In preprocessing scheme, a 'good' a priori schedule is prepared and maintained using unconfirmed order information. Upon the confirmation of orders. the preprocessed schedule is quickly modified to obtain the final schedule. We present a preprocessing solution algorithm for multi-site constraint scheduling problem (MSCSP) using genetic algorithm; and conduct computational experiments to evaluate the performance of the algorithm.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.341-343
• /
• 2000

Traditionally electric power system are operated in such a way that the total fuel cost is minimized regardless of accounting for tie-lines transmission constraint and emissions produced. But tie-lines transmission and emissions constraint are very important issues in the operation and planning of electric power system. This paper presents the Two-Phase Neural Network(TPNN) to solve the Economic Load Dispatch (ELD) problem with tie-lines transmission and emissions constraint considering transmission losses. The transmission losses are obtained from the B-coefficient which approximate the system losses as s quadratic function of the real power generation. By applying the proposed algorithm to the test system, the usefulness of this algorithm is verified.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.12
• /
• pp.2503-2510
• /
• 2002

Since the first shape-form-shading technique was developed by Horn in the early 1970s, many different approaches have been continuously emerging in the past three decades. Some of them improve existing techniques, while others are completely new approaches. Using the image reflectance equation, they estimate the 3-D shape of an object utilizing adequate constraints. Each algorithm applies different constraints such as brightness, smoothness, and integrability to solve the shape-from-shading problem. Especially for symmetric objects, a symmetry constraint is proposed to improve the performance of existing shape-from-shading algorithm in this paper. The symmetry constraint is imposed to a conventional algorithm and then the improvement in the performance of 3-D shape reconstruction is proved by quantitatively comparing the depth and gradient errors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.145-151
• /
• 2015

As order quantity is increased, the ordering cost per item will be cheaper due to saving of transportation and material handling costs. In this paper, two realistic assumptions such as quantity discount and budget limit are considered. Quantity discount means that all units in the order will be discounted according to the predetermined order levels. Budget limit represents that the costs for inventory investments are bounded. This paper develops a Lagrangian relaxation approach for a continuous review inventory model with a budget constraint and quantity discounts. Computational results indicate that the proposed approach provides a good solution. Sensitivity analysis is done to get some insights on budget limit and quantity discount. As budget limit or the amount of discount according to order quantity is increased, order quantity is increased, whereas reorder point is not always increased.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.3
• /
• pp.1099-1109
• /
• 2018

For practical consideration, economic dispatch (ED) problems in power system have non-smooth cost functions with equality and inequality constraints that makes the problems complex constrained nonlinear optimization problems. This paper proposes a new constraint handling method for equality and inequality constraints which is employed to solve ED problems, where the incremental rate is employed to enhance the modification process. In order to prove the applicability of the proposed method, the study cases are tested based on the classical particle swarm optimization (PSO) and differential evolution (DE) algorithm. The proposed method is evaluated for ED problems using six different test systems: 6-, 15-, 20-, 38-, 110- and 140-generators system. Simulation results show that it can always find the satisfactory solutions while satisfying the constraints.

• Journal of Energy Engineering
• /
• v.6 no.2
• /
• pp.129-136
• /
• 1997

This paper presents a new economic load dispatch considering atmospheric emissions such as NOx and SO$_2$caused by the operation of fossil-fueled thermal generation in power systems. The proposed method is described for scheduling their output of thermal power units so as to comply with total emission constraint, area emission constraint and the both of those constraints. Also, by using a trade-off curve, representing all dispatch alternatives and conflict between the emission and the fuel cost, the sensitivity analysis of the emission and the fuel cost is applied to this algorithm. By the way, this proposed method is analyzed how dispatch changes as a function of the total environmental cost, and as a function of the relative weighting of individual environmental insults, e.g, NOx and SO$_2$. By applying the proposed method to the system, the usefulness of this method is verified.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.29-42
• /
• 2006

This paper describes the design scheme of the three-dimensional structures based on the concept of the cellular automata simulation. The cellular automata simulation is performed according to the local rule. In this paper, the local rule is derived in the mathematical formulation from the optimization problem. The cell density is taken as the design variable. Two objective functions are defined for reducing the total weight of the structure and obtaining the fully stressed structure. The constraint condition is defined for defining the local rule. The penalty function is defined from the objective functions and the constraint condition. Minimization of the penalty function with respect to the design parameter leads to the local rule. The derived rule is applied to the design of the three-dimensional structure first. The final structure can be obtained successfully. However, the computational cost is expensive. So, in order to reduce the computational cost, the material parameters $c_1$ and $c_2$ and the value of the cell rejection criterion (CRC) are changed. The results show that the computational cost depends on the parameters and the CRC value.