• Title/Summary/Keyword: space programming

Search Result 435, Processing Time 0.028 seconds

Process Optimization Formulated in GDP/MINLP Using Hybrid Genetic Algorithm (혼합 유전 알고리즘을 이용한 GDP/MINLP로 표현된 공정 최적화)

  • 송상옥;장영중;김구회;윤인섭
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.2
    • /
    • pp.168-175
    • /
    • 2003
  • A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

A Study on the Model Development for Production of Interior Drawings and estimation of Quantities (실내도면 작성과 물량산출을 위한 모델 개발에 관한 연구)

  • 정례화;이승우;추승연
    • Korean Institute of Interior Design Journal
    • /
    • no.19
    • /
    • pp.30-37
    • /
    • 1999
  • This study presents a methods on the construction of integrated system for the purpose of automation of design plans, calculation of quantity of materials and estimation by abstracting information on building materials which is produced on the course of three dimension modeling by using computer. Therefore, an object oriented methodology is introduced to compose design informations in three dimension, space for unifying building informations, and expressing properties of building factors and materials, and to construct a database for computers to recognize architecture informations. An object indicates a conceptual individual existing in real world or existence of individual and necessity in composing a building could be called as objects such as column, wall, beam, slab, door and window and these contain materiality and immateriality. It is systemized to which properties of these building's objects are installed by the user of computer and by API(Application Programming Interface), chosen informations automatically converse to each unit work such as design plan structure plan, calculation of amount of materials, etc.

  • PDF

A Study on the Space Programming of Prayer House feature (기도원 시설의 공간구성 특성에 관한 연구)

  • 장경수
    • Korean Institute of Interior Design Journal
    • /
    • no.19
    • /
    • pp.105-113
    • /
    • 1999
  • This study investigates the prayer House facilities in Korean Churches and improves them to the positive way in order to revive the church itself. The prayer houses in Korea manages the various facilities and special programs. Theses facilities are used in christian seminars, educations, belief-training for the more non-christian's resort and training center when they could meet the god naturally. The purpose of this paper suggests the condition of the current prayer house facilities and the main organizers. this leads the fundamental data for the patterns of the unit facilities. Methods of study and range are 20 places among Seoul, Kyunggi - do area and analyse document survey, phone interview, drawing analysis, direct visit including the prayer house type, building area, site area, total floor area, location condition as searching items.

  • PDF

Machine Repair Problem in Multistage Systems (직렬시스템의 수리 및 예비품 지원정책에 관한 연구)

  • Park, Young-Taek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.2
    • /
    • pp.93-101
    • /
    • 1989
  • The classic machine repair problem is extended to the case where a number of different machines are arranged in the sequence of operation. The steady-state availability of the system with a series of operating machines is maximized under some constraints such as total cost, available space. In order to find the optimal numbers of spare units and repair channels for each operating machine, the problem is formulated as non-linear integer programming(NLIP) problem and an efficient algorithm, which is a natural extension of the new Lawler-Bell algorithm of Sasaki et al., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

  • PDF

Optimizing Empty Container Repositioning at a Global Maritime Company (글로벌 해운회사의 공컨테이너 재배치 최적화)

  • Choi, Seong-Hoon;Kim, Hwa-Joong;Kim, Gwang-Tae
    • IE interfaces
    • /
    • v.24 no.2
    • /
    • pp.164-172
    • /
    • 2011
  • H maritime company in Korea had a long history of difficulty in obtaining enough empty containers to transport its commodities. Despite efforts to resolve the problem, the repositioning of empty containers between depots was still planned manually, which consumed much worker time. To automate the generation of reposition plans, we developed a planning system to optimize the company's reposition of empty containers between global depots with a linear programming model functioning as a key decision engine in the system. The model determines the route, volume and mode of transportation for repositioning empty containers from depots with surplus containers to those requiring containers, as well as the empty space of ships generated from the unloading or loading of full and empty containers. The system has been in operation in the company's global network since March 2008.

Signomial Classification Method with 0-regularization (L0-정규화를 이용한 Signomial 분류 기법)

  • Lee, Kyung-Sik
    • IE interfaces
    • /
    • v.24 no.2
    • /
    • pp.151-155
    • /
    • 2011
  • In this study, we propose a signomial classification method with 0-regularization (0-)which seeks a sparse signomial function by solving a mixed-integer program to minimize the weighted sum of the 0-norm of the coefficient vector of the resulting function and the $L_1$-norm of loss caused by the function. $SC_0$ gives an explicit description of the resulting function with a small number of terms in the original input space, which can be used for prediction purposes as well as interpretation purposes. We present a practical implementation of $SC_0$ based on the mixed-integer programming and the column generation procedure previously proposed for the signomial classification method with $SL_1$-regularization. Computational study shows that $SC_0$ gives competitive performance compared to other widely used learning methods for classification.

Calculation on the Ion Flow Field under HVDC Transmission Lines Considering Wind Effects

  • Wu, Jing;Gao, Sheng;Liu, Yuxiao
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.5
    • /
    • pp.2077-2082
    • /
    • 2015
  • Based on Deutsch assumption, a calculation method on the electric field over the ground surface under HVDC transmission lines in the wind is proposed. Analyzing the wind effects on the electric field and the space charge density the existing method based on Deutsch assumption is improved through adding the wind speed to the ion flow field equations. The programming details are illustrated. The calculation results at zero wind speed are compared with available data to validate the code program. Then the ionized fields which resulted from corona of ±800kV HVDC lines are analyzed. Both the electric field and the current density on the ground level are computed under different wind direction and speed. The computation results are in good agreement with measurements. The presented method and code program can be used to rapidly predict and evaluate the wind effects in HVDC transmission engineering.

A Threaded Tree Construction Algorithm not Using Stack (스택을 이용하지 않는 스레드 트리 구성 알고리즘)

  • Lee Dae-Sik
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.119-127
    • /
    • 2004
  • As, the development of language-based programming environment, a study on incremental parsing has become an essential part. The purpose of this paper is to show the more efficient incremental parsing algorithm than earlier one that demands parsing speed and memorizing space too much. This paper suggests the threaded tree construction algorithm not using stack. In addition, to remove the reparsing process, it proposes the algorithm for creation node and construction incremental threaded tree not using stack.

  • PDF

SOME FIXED POINT THEOREMS VIA COMMON LIMIT RANGE PROPERTY IN NON-ARCHIMEDEAN MENGER PROBABILISTIC METRIC SPACES

  • Nashine, Hemant Kumar;Kadelburg, Zoran
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.3
    • /
    • pp.789-807
    • /
    • 2015
  • We propose coincidence and common fixed point results for a quadruple of self mappings satisfying common limit range property and weakly compatibility under generalized ${\Phi}$-contractive conditions i Non-Archimedean Menger PM-spaces. As examples we exhibit different types of situations where these conditions can be used. A common fixed point theorem for four finite families of self mappings is presented as an application of the proposed results. The existence and uniqueness of solutions for certain system of functional equations arising in dynamic programming are also presented as another application.

Design and Implementation of High-Resolution Integral Imaging Display System using Expanded Depth Image

  • Song, Min-Ho;Lim, Byung-Muk;Ryu, Ga-A;Ha, Jong-Sung;Yoo, Kwan-Hee
    • International Journal of Contents
    • /
    • v.14 no.3
    • /
    • pp.1-6
    • /
    • 2018
  • For 3D display applications, auto-stereoscopic display methods that can provide 3D images without glasses have been actively developed. This paper is concerned with developing a display system for elemental images of real space using integral imaging. Unlike the conventional method, which reduces a color image to the level as much as a generated depth image does, we have minimized original color image data loss by generating an enlarged depth image with interpolation methods. Our method was efficiently implemented by applying a GPU parallel processing technique with OpenCL to rapidly generate a large amount of elemental image data. We also obtained experimental results for displaying higher quality integral imaging rather than one generated by previous methods.