• Title/Summary/Keyword: Minimum Optimal Size

Search Result 188, Processing Time 0.027 seconds

Finding Optimal Small Networks by Mathematical Programming Models (수리계획 모형을 이용한 최적의 작은 네트워크 찾기)

  • Choi, Byung-Joo;Lee, Hee-Sang
    • IE interfaces
    • /
    • v.21 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.

Analysis of Generalized n-winding Coupled Inductor in dc-dc Converters

  • Kang, Taewon;Suh, Yongsug
    • Proceedings of the KIPE Conference
    • /
    • 2017.07a
    • /
    • pp.88-89
    • /
    • 2017
  • This paper investigates the design of multi-winding coupled inductor for minimum inductor current ripple in rapid traction battery charger systems. Based on the general circuit model of multi-winding coupled inductor together with the operating principles of dc-dc converter, the relationship between the ripple size of inductor current and the coupling factor is derived under the different duty ratio. The optimal coupling factor which corresponds to a minimum inductor ripple current becomes -(1/n-1), i.e. a complete inverse coupling without leakage inductance, as the steady-state duty ratio operating point approaches 1/n, 2/n, … or (n1)/n. In an opposite manner, the optimal coupling factor value of zero, i.e. zero mutual inductance, is required when the steady-state duty ratio operating point approaches either zero or one.

  • PDF

Design optimization of reinforced concrete structures

  • Guerra, Andres;Kiousis, Panos D.
    • Computers and Concrete
    • /
    • v.3 no.5
    • /
    • pp.313-334
    • /
    • 2006
  • A novel formulation aiming to achieve optimal design of reinforced concrete (RC) structures is presented here. Optimal sizing and reinforcing for beam and column members in multi-bay and multistory RC structures incorporates optimal stiffness correlation among all structural members and results in cost savings over typical-practice design solutions. A Nonlinear Programming algorithm searches for a minimum cost solution that satisfies ACI 2005 code requirements for axial and flexural loads. Material and labor costs for forming and placing concrete and steel are incorporated as a function of member size using RS Means 2005 cost data. Successful implementation demonstrates the abilities and performance of MATLAB's (The Mathworks, Inc.) Sequential Quadratic Programming algorithm for the design optimization of RC structures. A number of examples are presented that demonstrate the ability of this formulation to achieve optimal designs.

Mesh Selectivity of Drift Gill Net for Yellow Croaker, Larimichthys polyactis, in the Coastal Sea of Gageo-do (가거도 인근해역 참조기(Larimichthys polyactis) 유자망의 망목선택성)

  • Kim, Seong-Hun;Park, Seong-Wook;Bae, Jae-Hyun;Kim, Yeong-Hye
    • Korean Journal of Fisheries and Aquatic Sciences
    • /
    • v.42 no.5
    • /
    • pp.518-522
    • /
    • 2009
  • The mesh selectivity of drift gill net for yellow croaker (Larimichthys polyactis) was examined in field experiments with six different net mesh size (40, 45, 50, 55, 60 and 65 mm) from April to December, 2008 in the northwestern coastal waters of Gageo-do, Korea. The total catch of 8,091 consisted of yellow croaker (n=7,574; 89.5% of total catch), common mackerel (n=162; 4.8%) and other species (n=355; 5.8%). The selectivity curve for the small size yellow croaker was fit by Kitahara's method to the polynomial equation S(R)=exp{($-0.552R^3$+$4.927R^2$-11.591R+9.320)-6.717}. The optimal mesh size for 50% retention for minimum landing size(191mm) of yellow croaker was estimated as 51.1 mm. This is very similar to the current drift net mesh size used in Gageo-do.

Cure depth control using photopolymerization inhibitor in microstereolithography and fabrication of three dimensional microstructures (액속주사법을 이용한 마이크로 광조형시 광폴리머에 대한 중합억제제의 영향분석 및 삼차원 미세구조물 제조)

  • 김성훈;주재영;정성호
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.714-719
    • /
    • 2004
  • Controlling the cure depth of the Fa1260T photopolymer enhances the quality of a microstructure and minimizes its size in microstereolithography. In this work, variation of cure depth of the Fa1260T photopolymer is investigated while the concentration of a photopolymerization inhibitor as a radical quencher was varied. The energy source inducing photopolymerization was a He-Cd laser and a motorized stage controled the laser beam path accurately. The effects of process variables such as laser beam power and scan speed on the cure depth were examined. Optimum conditions for the minimum cure depth were determined as laser power of 230 W and scan speed of 40-50 m/s at the concentration of the radical quencher of 5%. The minimum cure depth at the optimal condition was 14 m. The feasibility of the fabrication of microstructures such as a microcup, microfunnel, and microgrid of 100 m size is demonstrated using Super IH process.

  • PDF

Speed-Sensitive Handover Scheme over IEEE 802.16 Multi-Relay Networks

  • Kim, Dong-Ho;Kim, Soon-Seok;Lee, Yong-Hee
    • Journal of Information Processing Systems
    • /
    • v.6 no.3
    • /
    • pp.403-412
    • /
    • 2010
  • Multi-Relay Networks should accommodate mobile users of various speeds. The cellular system should meet the minimum residency time requirements for handover calls while considering an efficient use of available channels. In this paper, we design speed-sensitive handover under dynamic hierarchical cellular systems, in which mobile users are classified according to the mean speed of mobile users and each class has its cellular layer. In order to meet the minimum residency time, the cell size of each cellular layer is dynamically determined depending on the distributions of mean speeds of mobile users. Since the speed-dependent non-preferred cell can provide a secondary resource, overflow and take-back schemes are adopted in the system. We develop analytical models to study the performance of the proposed system, and show that the optimal cell size improves the blocking probability.

Optimal Base Position and Joint Configuration of a Wheeled Manipulator

  • Kim, Sung-Bok;Kim, Hyoung-Gi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.834-839
    • /
    • 2004
  • In this paper, we investigate the optimal base position and joint configuration of a planar wheeled mobile manipulator in terms of manipulability measure. Taking into account the level of coordination between a manipulator and a platform, both local and global optimization problems are considered. First, based on the kinematic models of a mobile manipulator, the manipulability measures are expressed along with the analysis of the configurational dependency. Second, the geometric symmetry of a mobile manipulator in view of manipulability measure is analyzed, and for some base positions, the best and worst joint configurations are determined, Third, with reverence to the maximum, minimum, and average manipulability measures, the optimal base positions are determined, and the percent improvements due to the base relocation are discussed considering the relative scales among the platform size, the wheel radius, and the link length.

  • PDF

An Analysis of the Space Size in the Apartment Unit Plan (공동주택 단위평면의 실별 면적 분석)

  • Lee, Kyung-A;Park, So-Yun;Lee, Hyun-Soo
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2005.10a
    • /
    • pp.52-55
    • /
    • 2005
  • The purpose of this study is to analyze space size in the apartment unit plan towards optimal space configuration in order to offer the helpful information to housing designers. For this, we analyzed 432 samples using the Excel 2003 program. The major results of this study are as follows. 1) as the unit size gets bigger, the proportion of the usable area is increased. 2) as the unit size gets bigger, the number of spaces is increased and spaces are divided although they have the same function. 3) living room has the highest proportion in each unit, master room and kitchen are followed. 4) the proportion of living room, kitchen and entrance hall is not fluctuated while that of bedroom and bathroom is decreased. 5) there is a big gap between maximum size and minimum size of kitchen, entrance hall, bathroom and dressing room.

  • PDF

Optimal Frame Size Allocation Mechanism for Fast Tag Identification in RFID System (RFID 시스템에서 고속 태그 식별을 위한 최적의 프레임 크기 할당 기법)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1569-1574
    • /
    • 2008
  • Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

Harmony search based, improved Particle Swarm Optimizer for minimum cost design of semi-rigid steel frames

  • Hadidi, Ali;Rafiee, Amin
    • Structural Engineering and Mechanics
    • /
    • v.50 no.3
    • /
    • pp.323-347
    • /
    • 2014
  • This paper proposes a Particle Swarm Optimization (PSO) algorithm, which is improved by making use of the Harmony Search (HS) approach and called HS-PSO algorithm. A computer code is developed for optimal sizing design of non-linear steel frames with various semi-rigid and rigid beam-to-column connections based on the HS-PSO algorithm. The developed code selects suitable sections for beams and columns, from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange W-shapes, such that the minimum total cost, which comprises total member plus connection costs, is obtained. Stress and displacement constraints of AISC-LRFD code together with the size constraints are imposed on the frame in the optimal design procedure. The nonlinear moment-rotation behavior of connections is modeled using the Frye-Morris polynomial model. Moreover, the P-${\Delta}$ effects of beam-column members are taken into account in the non-linear structural analysis. Three benchmark design examples with several types of connections are presented and the results are compared with those of standard PSO and of other researches as well. The comparison shows that the proposed HS-PSO algorithm performs better both than the PSO and the Big Bang-Big Crunch (BB-BC) methods.