• Title/Summary/Keyword: 0-1 Programming

Search Result 308, Processing Time 0.031 seconds

A Genetic Algorithm A, pp.oach for Process Plan Selection on the CAPP (CAPP에서 공정계획 선정을 위한 유전 알고리즘 접근)

  • 문치웅;김형수;이상준
    • Journal of Intelligence and Information Systems
    • /
    • v.4 no.1
    • /
    • pp.1-10
    • /
    • 1998
  • Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

  • PDF

A Study on Berth Allocation for Navy Surface Vessels Considering Precedence Relationships among Services (서비스 전후 우선순위를 고려한 해군함정의 선석 할당에 관한 연구)

  • Jung, Whan-Sik;Kim, Jae-Hee;Kim, Sheung-Kwon
    • Journal of Navigation and Port Research
    • /
    • v.28 no.1
    • /
    • pp.83-90
    • /
    • 2004
  • Navy surface vessels require pier services such as emergency repair, oil supply, arm loading / unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG CPLEX 7.0. The results of the model show reduction of berth shifts and increasement of service benefits.

Stability and PSR(Power-Supply Rejection) Models for Design Optimization of Capacitor-less LDO Regulators (회로 최적화를 위한 외부 커패시터가 없는 LDO 레귤레이터의 안정도와 PSR 성능 모델)

  • Joo, Soyeon;Kim, Jintae;Kim, SoYoung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.1
    • /
    • pp.71-80
    • /
    • 2015
  • LDO(Low Drop-Out) regulators have become an essential building block in modern PMIC(Power Managment IC) to extend battery life of electronic devices. In this paper, we optimize capacitor-less LDO regulator via Geometric Programming(GP) designed using Dongbu HiTek $0.5{\mu}m$ BCDMOS process. GP-compatible models for stability and PSR of LDO regulators are derived based on monomial formulation of transistor characteristics. Average errors between simulation and the proposed model are 9.3 % and 13.1 %, for phase margin and PSR, respectively. Based on the proposed models, the capacitor-less LDO optimization can be performed by changing the PSR constraint of the design. The GP-compatible performance models developed in this work enables the design automation of capacitor-less LDO regulator for different design target specification.

The Allocation of Inspection Stations in Multi-Stage Production Systems with 0-1 Integer Programming (다단계 생산공정에서의 검사지점 할당 문제에 관한 연구)

  • Lee, Sung-Gi;Yun, Deok-Kyun
    • Journal of Korean Society for Quality Management
    • /
    • v.24 no.1
    • /
    • pp.20-31
    • /
    • 1996
  • A pure zero-one integer program is formulated for determining where to assign the inspection stations in a multi-stage production system. The objective fuction is formulated to minimize the overall inspection costs. One of the major characteristics of this system is that an assigned inspection station is to inspect only the items produced in previous manufacturing stages. Each inspection station can be assigned to any possible inspection stage between two manufacturing stages. Error-free and screening inspection policy is assumed in this system and the defective items found in any inspection station will be reworked at once. The integer programming model presented in this paper has the advantages in the ease of modeling and modifiing as compared with the existing dymanamic programming methods. The solutions of the model can be easily obtained by the commercially available softwares like LINDO and GAMS.

  • PDF

Estimating the unconfined compression strength of low plastic clayey soils using gene-expression programming

  • Muhammad Naqeeb Nawaz;Song-Hun Chong;Muhammad Muneeb Nawaz;Safeer Haider;Waqas Hassan;Jin-Seop Kim
    • Geomechanics and Engineering
    • /
    • v.33 no.1
    • /
    • pp.1-9
    • /
    • 2023
  • The unconfined compression strength (UCS) of soils is commonly used either before or during the construction of geo-structures. In the pre-design stage, UCS as a mechanical property is obtained through a laboratory test that requires cumbersome procedures and high costs from in-situ sampling and sample preparation. As an alternative way, the empirical model established from limited testing cases is used to economically estimate the UCS. However, many parameters affecting the 1D soil compression response hinder employing the traditional statistical analysis. In this study, gene expression programming (GEP) is adopted to develop a prediction model of UCS with common affecting soil properties. A total of 79 undisturbed soil samples are collected, of which 54 samples are utilized for the generation of a predictive model and 25 samples are used to validate the proposed model. Experimental studies are conducted to measure the unconfined compression strength and basic soil index properties. A performance assessment of the prediction model is carried out using statistical checks including the correlation coefficient (R), the root mean square error (RMSE), the mean absolute error (MAE), the relatively squared error (RSE), and external criteria checks. The prediction model has achieved excellent accuracy with values of R, RMSE, MAE, and RSE of 0.98, 10.01, 7.94, and 0.03, respectively for the training data and 0.92, 19.82, 14.56, and 0.15, respectively for the testing data. From the sensitivity analysis and parametric study, the liquid limit and fine content are found to be the most sensitive parameters whereas the sand content is the least critical parameter.

The Characteristics of p-channel SONOS Transistor for the NAND Charge-trap Flash Memory (NAND 전하트랩 플래시메모리를 위한 p채널 SONOS 트랜지스터의 특성)

  • Kim, Byung-Cheul;Kim, Joo-Yeon
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.22 no.1
    • /
    • pp.7-11
    • /
    • 2009
  • In this study, p-channel silicon-oxide-nitride-oxide-silicon(SONOS) transistors are fabricated and characterized as an unit cell for NAND flash memory. The SONOS transistors are fabricated by $0.13{\mu}m$ low power standard logic process technology. The thicknesses of gate insulators are 2.0 nm for the tunnel oxide, 1.4 nm for the nitride layer, and 4.9 nm for the blocking oxide. The fabricated SONOS transistors show low programming voltage and fast erase speed. However, the retention and endurance of the devices show poor characteristics.

A Polynomial Algorithm for the Minimum Spanning Arborescence in Transportation Networks with Bitype Arc Costs (이중비용 네트워크에서의 최소비용 극대방향 나무 해법)

  • Sim, Hyun-Taek;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.1
    • /
    • pp.17-25
    • /
    • 1990
  • Most of the least cost transportation network design problems are frequently formulated as the minimum spanning arborescence problems in directed networks with bitype are costs. These costs are classified whether the arc is included in the path from the root to a specified node over a given spanning arborescence. We prove that this problem is NP-hard, and develop a polynomial time algorithm for acyclic networks. The probelm in acyclic networks is initially formulated as 0-1 integer programming. Next, we prove that the 0-1 relaxed linear programming has an integral optimum solution by complementary slackness conditions. In this paper, we present an $O(n^2)$ algorithm based on a shortest path algorithm.

  • PDF

Analysis of Food and Nutrition Information of Diet-related Programs in Comprehensive Programming Channels: Focus on Professional Panelists (종합편성채널 식생활관련 프로그램의 식품영양정보 분석 - 전문가 출연자를 중심으로 -)

  • Kim, Soon Mi;Lee, Sunyong
    • Journal of the Korean Society of Food Culture
    • /
    • v.31 no.6
    • /
    • pp.661-674
    • /
    • 2016
  • We analyzed information provided by diet-related programs of comprehensive programming channels and the relationship between composition of professional panelists and quality of provided information. We selected 82 items among eight programs by MBN, JTBC, and TV chosun. All 82 items provided information about food & nutrition and health & disease, but only 32 items (39.0%) and 35 items (42.7%) provided information on food culture and food safety, respectively. Among the food ingredients, phytochemicals (81.7%) were the most frequently mentioned, and the contents of functional ingredients occupied a large part. The inappropriate information on programs were broadcast on an average of 1.2 episodes per program, and the most pointed out item was information that could confuse viewers with drugs (29.3%). Among the professional panelists, medical doctors (38.9%) and Oriental medicine doctors (16.6%) had the highest number of appearances, and professors of food & nutrition constituted only 7.1%. However, the increase in the number of appearances of professors showed a positive effect on the quality of program information. Contents focused on balanced nutrient intake and dietary culture of Korea should be increased rather than focusing on the function of each nutrient in comprehensive programming channels.

Design of the 0-1 Knapsack Processor using VHDL (VHDL을 이용한 0-1 Knapsack 프로세서의 설계)

  • 이재진;송호정;송기용
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.341-344
    • /
    • 2000
  • The 0-1 knapsack processor performing dynamic programming is designed and implemented on a programmable logic device. Three types of a processor, each with different behavioral models, are presented, and the operation of a processor of each type is verified with an instance of the 0-1 knapsack problem.

  • PDF

The Application of the Scratch2.0 and the Sensor Board to the Programming Education of Elementary School (초등학교 프로그래밍 교육을 위한 스크래치2.0과 센서보드 활용)

  • Moon, Waeshik
    • Journal of The Korean Association of Information Education
    • /
    • v.19 no.1
    • /
    • pp.149-158
    • /
    • 2015
  • Programming education plays a very effective role in comprehensively learning problem analysis ability, logical thinking ability, procedural problem solving method, and imaginary problem solving method. Until recently, however, it is not applied to the elementary and the middle school in Korea, which is very different from the other IT centerd countries such as the U.S., etc., where coding class is actively implemented. Fortunately, Korean government recognized this reality and decided to implement programming education as a regular subject in the elementary school from 2017. In this situation, many researchers' programming education model research is urgently required for the students to learn in the elementary and the middle school. This research developed and suggested 17 sessions of programing education model connected with scratch language and sensor board, which is hardware, to be applied to the class of the 5th and 6th graders. As the result of implementing the joint class of 5th and 6th graders during the after-school class based on programming education process suggested to verify the suitability for elementary school programing education, satisfactory achievement was attained by the assessed students. The researcher plans to develop an optimum model proper for the elementary school students' intellectual capacity by more improving programming education model.