• Structural Engineering and Mechanics
• /
• 제51권3호
• /
• pp.361-375
• /
• 2014

The main aim of this paper is to investigate the relationship between thickness and height of the axially symmetric cylindrical reinforced concrete (RC) walls by the help of a meta-heuristic optimization procedure. The material cost of the wall which includes concrete, reinforcement and formwork, was chosen as objective function of the optimization problem. The wall thickness, compressive strength of concrete and diameter of reinforcement bars were defined as design variables and tank volume, radius and height of the wall, loading condition and unit cost of material were defined as design constants. Numerical analyses of the wall were conducted by using superposition method (SPM) considering ACI 318-Building code requirements for structural concrete. The optimum wall thickness-height relationship was investigated under three main cases related with compressive strength of concrete and density of the stored liquid. According to the results, the proposed method is effective on finding the optimum design with minimum cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권3호
• /
• pp.508-522
• /
• 2011

Femtocell is an economical solution to provide high speed indoor communication instead of the conventional macro-cellular networks. Especially, OFDMA femtocell is considered in the next generation cellular network such as 3GPP LTE and mobile WiMAX system. Although the femtocell has great advantages to accommodate indoor users, interference management problem is a critical issue to operate femtocell network. Existing OFDMA resource management algorithms only consider optimizing system-centric metric, and cannot manage the co-channel interference. Moreover, it is hard to cooperate with other femtocells to control the interference, since the self-configurable characteristics of femtocell. This paper proposes a novel interference-aware resource allocation algorithm for OFDMA femtocell networks. The proposed algorithm allocates resources according to a new objective function which reflects the effect of interference, and the heuristic algorithm is also introduced to reduce the complexity of the original problem. The Monte-Carlo simulation is performed to evaluate the performance of the proposed algorithm compared to the existing solutions.

• 한국산업융합학회 논문집
• /
• 제19권2호
• /
• pp.75-80
• /
• 2016

This study proposes a efficient technology to control the optimal trajectory planning and real-time implementation method which can perform autonomous travelling for unmaned factory automation. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on Route planning and control algorithm, we suggested representation of edge cost, heuristic function, and priority queue management, to make a modified Route planning algorithm. Performance of the proposed algorithm is verified by simulation test.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.525-528
• /
• 1988

In this paper, a new multi-output logic minimization algorithm is presented. A base minterm is selected in the given function and the prime implicant is obtained by expanding it in the order of the expansion set that is decided by heuristic method. Input-oriented expansion procedure is used to reduce fan-in and fan-out number. To show the effectiveness of this algorithm, comparative run time with other minimization algorithm is given.

• 대한기계학회논문집
• /
• 제17권12호
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1666-1669
• /
• 2002

In the process of creating architectural scenes from photographs using Model-based Stereo 〔1〕, the geometric model is used as prior information to solve correspondence problems and recover the depth or disparity of real scenes. This paper presents an Image Subregioning algorithm that divides left and right images into several rectangular sub-images. The division is done according to the estimated depth of real scenes using a Heuristic Approach. The depth difference between the reality and the model can be partitioned into each depth level. This reduces disparity search range in the Similarity Function. For architectural scenes with complex depth, experiments using the above approach show that accurate disparity maps and better results when rendering scenes can be achieved by the proposed algorithm.

• 대한전기학회논문지:전력기술부문A
• /
• 제55권1호
• /
• pp.1-6
• /
• 2006

The emergence of competitive power market makes dispatch algorithm with transient stability constraints increasingly important for the transparent power system operation. Heuristic and off-line evaluation for the operation point can produce a discrimination among market players in the deregulated power system. In this paper, a dispatch algorithm with transient stability constraints is proposed. Energy margin under the TEF(Transient Energy Function) structure is adopted as a measure for the stability index. Implementation issues and simulation results are discussed in the context of a 10-bus system

• 전자공학회논문지B
• /
• 제30B권7호
• /
• pp.59-69
• /
• 1993

In this paper, a new matching strategy for 3-D object recognition, based on the Surface Normal Images (SNIs), is proposed. The matching strategy using the similarity decision function [9,10] lost the efficiency and the reliability of matching, because all features of models within model base must be compared with the scene object features, and the weights of the attributes of features is given by heuristic manner. However, the proposed matching strategy can solve these problems by using a new approach. In the approach, by searching the model base, a model object whose features are fully matched with the features of sceme object is selected. In this paper, the model base is constructed for the total 26 objects, and systhetic and real range images are used in the test of the system operation. Experimental result is performed to show the possibility that this strategy can be effectively used for the SNI based recognition.

• 대한산업공학회지
• /
• 제29권3호
• /
• pp.213-221
• /
• 2003

In this paper, we consider a multi-objective part-machine grouping problem, in which part types have several alternative part routings and each part routing has a machining sequence. This problem is characterized as optimally determining part type sets and its corresponding machine cells such that the sum of inter-cell part movements and the sum of machine workload imbalances are simultaneously minimized. Due to the complexity of the problem, a two-stage heuristic algorithm is proposed, and experiments are shown to verify the effectiveness of the algorithm.