• Title/Summary/Keyword: binary optimization

Search Result 238, Processing Time 0.021 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.

Measurement and Prediction of the Flash Points for Flammable Liquid Mixtures with Non-flammable Component

  • Ha, Dong-Myeong;Yu, Hyun-Sik;Kang, Gyeun-Hee;Ann, Jeong-Jin;Lee, Sung-Jin
    • International Journal of Safety
    • /
    • v.7 no.2
    • /
    • pp.12-16
    • /
    • 2008
  • Lower flash points for the binary systems, carbon tetrachloride+o-xylene and water+n-butanol were measured by Pensky-Martens closed cup tester. The Raoult's law and optimization method using van Laar equation were used to predict the lower flash points and were compared with experimental data. The calculated values based on the optimization method were found to be better than those based on the Raoult's law.

Topology Optimization of a Brake Pad to Avoid the Brake Moan Noise Using Genetic Algorithm (Brake Moan Noise 소피를 위한 Brake Pad 위상최적화의 GA적용)

  • 한상훈;윤덕현;이종수;유정훈
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.10 no.4
    • /
    • pp.216-222
    • /
    • 2002
  • Brake Moan is a laud and strong noise occurring at any vehicle speed over 2 mph as a low frequency in below 600Hz. In this study, we targeted to shift the unstable mode that causes the brake moan from the moats frequency range to sufficiently higher frequency range to avoid the moan phenomenon. We simulated the finite element model and found out the nodes in which the brake moan occurs the most and we regarded the boundary and its relationship between the brake pad and the rotor as a spring coefficient k. With the binary set of the spring coefficient k, we finally used genetic algorithm (GA) to get the optimal topology of the brake pad and its shape to avoid the brake moan. The final result remarkably shows that genetic algorithm can be used in topology optimization procedures requiring complex eigenvalue problems.

Joint Radio Selection and Relay Scheme through Optimization Model in Multi-Radio Sensor Networks

  • Lee, HyungJune
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4451-4466
    • /
    • 2014
  • We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

A Novel Approach for the Unit Commitment with Vehicle-to-grid

  • Jin, Lei;Yang, Huan;Zhou, Yuying;Zhao, Rongxiang
    • Journal of international Conference on Electrical Machines and Systems
    • /
    • v.2 no.3
    • /
    • pp.367-374
    • /
    • 2013
  • The electrical vehicles (EV) with vehicle-to-grid (V2G) capability can be used as loads, energy sources and energy storage in MicroGrid integrated with renewable energy sources. The output power of generators will be reallocated in the considering of V2G. An intelligent unit commitment (UC) with V2G for cost optimization is presented in this paper. A new constraint of UC with V2G is considered to satisfy daily use of EVs. A hybrid optimiza-tion algorithm combined Binary Particle Swarm Optimization (BPSO) with Lagrange Mul-tipliers Method (LMM) is proposed. The difference between results of UC with V2G and UC without V2G is presented.

A Hybrid PSO-BPSO Based Kernel Extreme Learning Machine Model for Intrusion Detection

  • Shen, Yanping;Zheng, Kangfeng;Wu, Chunhua
    • Journal of Information Processing Systems
    • /
    • v.18 no.1
    • /
    • pp.146-158
    • /
    • 2022
  • With the success of the digital economy and the rapid development of its technology, network security has received increasing attention. Intrusion detection technology has always been a focus and hotspot of research. A hybrid model that combines particle swarm optimization (PSO) and kernel extreme learning machine (KELM) is presented in this work. Continuous-valued PSO and binary PSO (BPSO) are adopted together to determine the parameter combination and the feature subset. A fitness function based on the detection rate and the number of selected features is proposed. The results show that the method can simultaneously determine the parameter values and select features. Furthermore, competitive or better accuracy can be obtained using approximately one quarter of the raw input features. Experiments proved that our method is slightly better than the genetic algorithm-based KELM model.

A Study on Strengthened Genetic Algorithm for Multi-Modal and Multiobjective Optimization (강화된 유전 알고리듬을 이용한 다극 및 다목적 최적화에 관한 연구)

  • Lee Won-Bo;Park Seong-Jun;Yoon En-Sup
    • Journal of the Korean Institute of Gas
    • /
    • v.1 no.1
    • /
    • pp.33-40
    • /
    • 1997
  • An optimization system, APROGA II using genetic algorithm, was developed to solve multi-modal and multiobjective problems. To begin with, Multi-Niche Crowding(MNC) algorithm was used for multi-modal optimization problem. Secondly, a new algorithm was suggested for multiobjective optimization problem. Pareto dominance tournaments and Sharing on the non-dominated frontier was applied to it to obtain multiple objectives. APROGA II uses these two algorithms and the system has three search engines(previous APROGA search engine, multi-modal search engine and multiobjective search engine). Besides, this system can handle binary and discrete variables. And the validity of APROGA II was proved by solving several test functions and case study problems successfully.

  • PDF

DSP Optimization for Rain Detection and Removal Algorithm (비 검출 및 제거 알고리즘의 DSP 최적화)

  • Choi, Dong Yoon;Seo, Seung Ji;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.96-105
    • /
    • 2015
  • This paper proposes a DSP optimization solution of rain detection and removal algorithm. We propose rain detection and removal algorithms considering camera motion, and also presents optimization results in algorithm level and DSP level. At algorithm level, this paper utilizes a block level binary pattern analysis, and reduces the operation time by using the fast motion estimation algorithm. Also, the algorithm is optimized at DSP level through inter memory optimization, EDMA, and software pipelining for real-time operation. Experiment results show that the proposed algorithm is superior to the other algorithms in terms of visual quality as well as processing speed.

Optimum parameterization in grillage design under a worst point load

  • Kim Yun-Young;Ko Jae-Yang
    • Journal of Navigation and Port Research
    • /
    • v.30 no.2
    • /
    • pp.137-143
    • /
    • 2006
  • The optimum grillage design belongs to nonlinear constrained optimization problem. The determination of beam scantlings for the grillage structure is a very crucial matter out of whole structural design process. The performance of optimization methods, based on penalty functions, is highly problem-dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm ($R{\mu}GA$) is proposed to find the optimum beam scantlings of the grillage structure without handling any of penalty functions. $R{\mu}GA$ can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. Direct stiffness method is used as a numerical tool for the grillage analysis. In optimization study to find minimum weight, sensitivity study is carried out with varying beam configurations. From the simulation results, it has been concluded that the proposed $R{\mu}GA$ is an effective optimization tool for solving continuous and/or discrete nonlinear real-world optimization problems.

Optimization Study for Pressure Swing Distillation Process for the Mixture of Isobutyl-Acetate and Isobutyl-Alcohol System (Isobutyl-Acetate와 Isobutyl-Alcohol 이성분계의 압력변환증류 공정 최적화 연구)

  • Cho, Sung Jin;Shin, Jae Sun;Choi, Suk Hoon;Lee, Euy Soo;Park, Sang Jin
    • Korean Chemical Engineering Research
    • /
    • v.52 no.3
    • /
    • pp.307-313
    • /
    • 2014
  • In this study, an optimization process design has been performed to separate 99.9 mol% of Isobutyl Acetate from binary azeotropic mixture of Isobutyl Acetate and Isobutyl Alcohol system using a Pressure Swing Distillation (PSD). PSD is used to separate binary azeotropic mixtures using the difference between the relative volatilities and azeotropic compositions by changing the system pressure. Non-Random Two Liquid (NRTL) model for liquid phase and the Peng-Robinson equation for vapor phase are used. An optimization study for the reflux ratio and feed stage locations which minimize the total reboiler heat duties are studied. Since PSD process consists of two columns, i.e. high pressure and low pressure, the effect of column sequence on the optimum conditions is reported.