• Title/Summary/Keyword: Optimization Algorithm

Search Result 5,689, Processing Time 0.034 seconds

Flux Optimization Using Genetic Algorithms in Membrane Bioreactor

  • Kim Jung-Mo;Park Chul-Hwan;Kim Seung-Wook;Kim Sang-Yong
    • Journal of Microbiology and Biotechnology
    • /
    • v.16 no.6
    • /
    • pp.863-869
    • /
    • 2006
  • The behavior of submerged membrane bioreactor (SMBR) filtration systems utilizing rapid air backpulsing as a cleaning technique to remove reversible foulants was investigated using a genetic algorithm (GA). A customized genetic algorithm with suitable genetic operators was used to generate optimal time profiles. From experiments utilizing short and long periods of forward and reverse filtration, various experimental process parameters were determined. The GA indicated that the optimal values for the net flux fell between 263-270 LMH when the forward filtration time ($t_f$) was 30-37 s and the backward filtration time ($t_b$) was 0.19-0.27 s. The experimental data confirmed the optimal backpulse duration and frequency that maximized the net flux, which represented a four-fold improvement in 24-h backpulsing experiments compared with the absence of backpulsing. Consequently, the identification of a region of feasible parameters and nonlinear flux optimization were both successfully performed by the genetic algorithm, meaning the genetic algorithm-based optimization proved to be useful for solving SMBR flux optimization problems.

Path Optimization Using an Genetic Algorithm for Robots in Off-Line Programming (오프라인 프로그래밍에서 유전자 알고리즘을 이용한 로봇의 경로 최적화)

  • Kang, Sung-Gyun;Son, Kwon;Choi, Hyeuk-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.10
    • /
    • pp.66-76
    • /
    • 2002
  • Automated welding and soldering are an important manufacturing issue in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diversity problem. Unless an OLP system is ready for the path optimization in welding and soldering, the waste of time and cost is unavoidable due to inefficient paths in welding and soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of welding path optimization is defined as a conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering the both end points of each welding line read from database files, and then the transit problem of welding line was solved using the improved suggested genetic algorithm.

Optimization and Verification of Parameters Used in Successive Zooming Genetic Algorithm (순차적 주밍 유전자 알고리즘 기법에 사용되는 파라미터의 최적화 및 검증)

  • KWON YOUNG-DOO;KWON HYUN-WOOK;KIM JAE-YONG;JIN SEUNG-BO
    • Journal of Ocean Engineering and Technology
    • /
    • v.18 no.5
    • /
    • pp.29-35
    • /
    • 2004
  • A new approach, referred to as a successive zooming genetic algorithm (SZGA), is proposed for identifying a global solution, using continuous zooming factors for optimization problems. In order to improve the local fine-tuning of the GA, we introduced a new method whereby the search space is zoomed around the design variable with the best fitness per 100 generation, resulting in an improvement of the convergence. Furthermore, the reliability of the optimized solution is determined based on the theory of probability, and the parameter used for the successive zooming method is optimized. With parameter optimization, we can eliminate the time allocated for deciding parameters used in SZGA. To demonstrate the superiority of the proposed theory, we tested for the minimization of a multiple function, as well as simple functions. After testing, we applied the parameter optimization to a truss problem and wicket gate servomotor optimization. Then, the proposed algorithm identifies a more exact optimum value than the standard genetic algorithm.

FE MODEL UPDATING OF ROTOR SHAFT USING OPTIMIZATION TECHNIQUES (최적화 기법을 이용한 로터 축 유한요소모델 개선)

  • Kim, Yong-Han;Feng, Fu-Zhou;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.104-108
    • /
    • 2003
  • Finite element (FE) model updating is a procedure to minimize the differences between analytical and experimental results, which can be usually posed as an optimization problem. This paper aims to introduce a hybrid optimization algorithm (GA-SA), which consists of a Genetic algorithm (GA) stage and an Adaptive Simulated Annealing (ASA) stage, to FE model updating for a shrunk shaft. A good agreement of the first four natural frequencies has been achieved obtained from GASA based updated model (FEgasa) and experiment. In order to prove the validity of GA-SA, comparisons of natural frequencies obtained from the initial FE model (FEinit), GA based updated model (FEga) and ASA based updated model (FEasa) are carried out. Simultaneously, the FRF comparisons obtained from different FE models and experiment are also shown. It is concluded that the GA, ASA, GA-SA are powerful optimization techniques which can be successfully applied to FE model updating, the natural frequencies and FRF obtained from all the updated models show much better agreement with experiment than that obtained from FEinit model. However, FEgasa is proved to be the most reasonable FE model, and also FEasa model is better than FEga model.

  • PDF

Vibration Ride Quality Optimization of a Suspension Seat System Using Genetic Algorithm (유전자 알고리즘을 이용한 SUSPENSION SEAT SYSTEM의 진동 승차감 최적화)

  • Park, S.K.;Choi, Y.H.;Choi, H.O.;Bae, B.T.
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.584-589
    • /
    • 2001
  • This paper presents the dynamic parameter design optimization of a suspension seat system using the genetic algorithm. At first, an equivalent 1-D.O.F. mass-spring-damper model of a suspension seat system was constructed for the purpose of its vibration analysis. Vertical vibration response and transmissibility of the equivalent model due to base excitations, which are defined in the ISO's seat vibration test codes, were computed. Furthermore, seat vibration test, that is ISO's damping test, was carried out in order to investigate the validity of the equivalent suspension seat model. Both analytical and experimental results showed good agreement each other. For the design optimization, the acceleration transmissibility of the suspension seat model was adopted as an object function. A simple genetic algorithm was used to search the optimum values of the design variables, suspension stiffness and damping coefficient. Finally, vibration ride performance test results showed that the optimum suspension parameters gives the lowest vibration transmissibility. Accordingly the genetic algorithm and the equivalent suspension seat modelling can be successfully adopted in the vibration ride quality optimization of a suspension seat system.

  • PDF

Energy-Aware Hybrid Cooperative Relaying with Asymmetric Traffic

  • Chen, Jian;Lv, Lu;Geng, Wenjin;Kuo, Yonghong
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.717-726
    • /
    • 2015
  • In this paper, we study an asymmetric two-way relaying network where two source nodes intend to exchange information with the help of multiple relay nodes. A hybrid time-division broadcast relaying scheme with joint relay selection (RS) and power allocation (PA) is proposed to realize energy-efficient transmission. Our scheme is based on the asymmetric level of the two source nodes' target signal-to-noise ratio indexes to minimize the total power consumed by the relay nodes. An optimization model with joint RS and PA is studied here to guarantee hybrid relaying transmissions. Next, with the aid of our proposed intelligent optimization algorithm, which combines a genetic algorithm and a simulated annealing algorithm, the formulated optimization model can be effectively solved. Theoretical analyses and numerical results verify that our proposed hybrid relaying scheme can substantially reduce the total power consumption of relays under a traffic asymmetric scenario; meanwhile, the proposed intelligent optimization algorithm can eventually converge to a better solution.

An Evaluation of the Second-order Approximation Method for Engineering Optimization (최적설계시 이차근사법의 수치성능 평가에 관한 연구)

  • 박영선;박경진;이완익
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.16 no.2
    • /
    • pp.236-247
    • /
    • 1992
  • Optimization has been developed to minimize the cost function while satisfying constraints. Nonlinear Programming method is used as a tool for the optimization. Usually, cost and constraint function calculations are required in the engineering applications, but those calculations are extremely expensive. Especially, the function and sensitivity analyses cause a bottleneck in structural optimization which utilizes the Finite Element Method. Also, when the functions are quite noisy, the informations do not carry out proper role in the optimization process. An algorithm called "Second-order Approximation Method" has been proposed to overcome the difficulties recently. The cost and constraint functions are approximated by the second-order Taylor series expansion on a nominal points in the algorithm. An optimal design problem is defined with the approximated functions and the approximated problem is solved by a nonlinear programming numerical algorithm. The solution is included in a candidate point set which is evaluated for a new nominal point. Since the functions are approximated only by the function values, sensitivity informations are not needed. One-dimensional line search is unnecessary due to the fact that the nonlinear algorithm handles the approximated functions. In this research, the method is analyzed and the performance is evaluated. Several mathematical problems are created and some standard engineering problems are selected for the evaluation. Through numerical results, applicabilities of the algorithm to large scale and complex problems are presented.presented.

Cost effective design of RC building frame employing unified particle swarm optimization

  • Payel Chaudhuri;Swarup K. Barman
    • Advances in Computational Design
    • /
    • v.9 no.1
    • /
    • pp.1-23
    • /
    • 2024
  • Present paper deals with the cost effective design of reinforced concrete building frame employing unified particle swarm optimization (UPSO). A building frame with G+8 stories have been adopted to demonstrate the effectiveness of the present algorithm. Effect of seismic loads and wind load have been considered as per Indian Standard (IS) 1893 (Part-I) and IS 875 (Part-III) respectively. Analysis of the frame has been carried out in STAAD Pro software.The design loads for all the beams and columns obtained from STAAD Pro have been given as input of the optimization algorithm. Next, cost optimization of all beams and columns have been carried out in MATLAB environment using UPSO, considering the safety and serviceability criteria mentioned in IS 456. Cost of formwork, concrete and reinforcement have been considered to calculate the total cost. Reinforcement of beams and columns has been calculated with consideration for curtailment and feasibility of laying the reinforcement bars during actual construction. The numerical analysis ensures the accuracy of the developed algorithm in providing the cost optimized design of RC building frame considering safety, serviceability and constructional feasibilities. Further, Monte Carlo simulations performed on the numerical results, proved the consistency and robustness of the developed algorithm. Thus, the present algorithm is capable of giving a cost effective design of RC building frame, which can be adopted directly in construction site without making any changes.

Optimization Algorithm for Minimizing Network Energy Consumption with Traffic Redundancy Elimination (트래픽 중복 제거로 네트워크 에너지 소비를 최소화하기 위한 최적화 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.930-939
    • /
    • 2021
  • In recent years, the use of broadband bandwidth and redundant links for stable transmission in networks has resulted in excessive energy consumption and reduced transmission efficiency. In this paper, we propose an optimization algorithm that reduces the number of transmission links and minimizes transmission energy by removing redundant traffic in networks where traffic redundancy is allowed. The optimization algorithm proposed in this paper uses the meta-heuristic method using Tabu search algorithm. The proposed optimization algorithm minimizes transmission energy by designing a neighborhood generation method that efficiently routes overlapping traffic. The performance evaluation of the proposed optimization algorithm was performed in terms of the number of links used to transmit all traffic generated in the network and the transmission energy consumed. From the performance evaluation results, it was confirmed that the proposed algorithm is superior to other algorithms previously proposed.

Prolong life-span of WSN using clustering method via swarm intelligence and dynamical threshold control scheme

  • Bao, Kaiyang;Ma, Xiaoyuan;Wei, Jianming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2504-2526
    • /
    • 2016
  • Wireless sensors are always deployed in brutal environments, but as we know, the nodes are powered only by non-replaceable batteries with limited energy. Sending, receiving and transporting information require the supply of energy. The essential problem of wireless sensor network (WSN) is to save energy consumption and prolong network lifetime. This paper presents a new communication protocol for WSN called Dynamical Threshold Control Algorithm with three-parameter Particle Swarm Optimization and Ant Colony Optimization based on residual energy (DPA). We first use the state of WSN to partition the region adaptively. Moreover, a three-parameter of particle swarm optimization (PSO) algorithm is proposed and a new fitness function is obtained. The optimal path among the CHs and Base Station (BS) is obtained by the ant colony optimization (ACO) algorithm based on residual energy. Dynamical threshold control algorithm (DTCA) is introduced when we re-select the CHs. Compared to the results obtained by using APSO, ANT and I-LEACH protocols, our DPA protocol tremendously prolongs the lifecycle of network. We observe 48.3%, 43.0%, and 24.9% more percentages of rounds respectively performed by DPA over APSO, ANT and I-LEACH.