• Title/Summary/Keyword: Intelligent optimization

Search Result 738, Processing Time 0.025 seconds

Optimum Allocation of Pipe Support Using Combined Optimization Algorithm by Genetic Algorithm and Random Tabu Search Method (유전알고리즘과 Random Tabu 탐색법을 조합한 최적화 알고리즘에 의한 배관지지대의 최적배치)

  • 양보석;최병근;전상범;김동조
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.3
    • /
    • pp.71-79
    • /
    • 1998
  • This paper introduces a new optimization algorithm which is combined with genetic algorithm and random tabu search method. Genetic algorithm is a random search algorithm which can find the global optimum without converging local optimum. And tabu search method is a very fast search method in convergent speed. The optimizing ability and convergent characteristics of a new combined optimization algorithm is identified by using a test function which have many local optimums and an optimum allocation of pipe support. The caculation results are compared with the existing genetic algorithm.

  • PDF

Species Adaptation Evolutionary Algorithm for Solving the Optimization Problems

  • Lee, Dong-Wook;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.233-238
    • /
    • 2003
  • Living creatures maintain their variety through speciation, which helps them to have more fitness for an environment. So evolutionary algorithm based on biological evolution must maintain variety in order to adapt to its environment. In this paper, we utilize the concept of speciation. Each individual of population creates their offsprings using mutation, and next generation consists of them. Each individual explores search space determined by mutation. Useful search space is extended by differentiation, then population explorers whole search space very effectively. If evolvable hardware evolves through mutation, it is useful way to explorer search space because of less varying inner structure. We verify the effectiveness of the proposed method by applying it to two optimization problems.

Multi-Objective Optimization of Rotor-Bearing System with dynamic Constraints Using IGA

  • Choi, Byung-Gun;Yang, Bo-Suk;Jun, Yeo-Dong
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.403-410
    • /
    • 1998
  • An immune system has powerful abilities such as memory recognition and learning how to respond to invading antigens, and has been applied to many engineering algorithms in recent year. In this paper, the combined optimization algorithm (Immune-Genetic Algorithm: IGA) is proposed for multi-optimization problems by introduction the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The new combined algorithm is applied to minimize the total weight of the rotor shaft and the transmitted forces at the bearings in order to demonstrate the merit of the combined algorithm. The inner diameter of the shaft and the bearing stiffness are chosen as the design variables. the results show that the combined algorithm can reduce both the weight of the shaft and the transmitted forces at the bearing with dynamic constraints.

  • PDF

Optimization of Fuzzy Relational Models

  • Pedrycz, W.;de Oliveira, J. Valente
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1187-1190
    • /
    • 1993
  • The problem of the optimization of fuzzy relational models for dealing with (non-fuzzy) numerical data is investigated. In this context, interfaces optimization assumes particular importance, becoming a determinant factor in what concerns the overall model performance. Considering this, several scenarios for building fuzzy relational models are presented. These are: (i) optimizing I/O interfaces in advance (independently from the linguistic part of the model); (ii) optimizing I/O interfaces in advance and allowing that their optimized parameters may change during the learning of the linguistic part of the model; (iii) build simultaneously both interfaces and the linguistic subsystem; and (iv) build simultaneously both linguistic subsystem and interfaces, now subject to semantic integrity constraints. As linguistic subsystems, both a basic type and an extended versions of fuzzy relation equations are exploited in each one of these scenarios. A comparative analysis of the differ nt approaches is summarized.

  • PDF

Design of IG-based Fuzzy Models Using Improved Space Search Algorithm (개선된 공간 탐색 알고리즘을 이용한 정보입자 기반 퍼지모델 설계)

  • Oh, Sung-Kwun;Kim, Hyun-Ki
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.686-691
    • /
    • 2011
  • This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

Optimal Economical Running Patterns Based on Fuzzy Model (철도차량을 위한 퍼지모델기반 최적 경제운전 패턴 개발)

  • Lee, Tae-Hyung;Hwang, Hee-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.5
    • /
    • pp.594-600
    • /
    • 2006
  • The optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model has been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme ate utilized, respectively. As a result, two meta-models for trip time and energy consumption are constructed. The optimization to search an economical running pattern is achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

An Intelligent Machine Learning Inspired Optimization Algorithm to Enhance Secured Data Transmission in IoT Cloud Ecosystem

  • Ankam, Sreejyothsna;Reddy, N.Sudhakar
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.83-90
    • /
    • 2022
  • Traditional Cloud Computing would be unable to safely host IoT data due to its high latency as the number of IoT sensors and physical devices accommodated on the Internet grows by the day. Because of the difficulty of processing all IoT large data on Cloud facilities, there hasn't been enough research done on automating the security of all components in the IoT-Cloud ecosystem that deal with big data and real-time jobs. It's difficult, for example, to build an automatic, secure data transfer from the IoT layer to the cloud layer, which incorporates a large number of scattered devices. Addressing this issue this article presents an intelligent algorithm that deals with enhancing security aspects in IoT cloud ecosystem using butterfly optimization algorithm.

Weapon-Target Assignment by ACO, Lanchester′s method (ACO와 Lanchester법칙을 이용한 무장할당)

  • 김제은;이동명;김덕은;김수영
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.227-231
    • /
    • 2004
  • 본 연구에서는 군용선 설계 시 중요한 요소인 무장탑재 및 무장 할당 문제 해결을 위해, ACO(Ant Colony Optimization) 알고리즘과 Lanchester 법칙이 결합된 방법론을 제안하고 적용 결과를 검토하는 것을 내용으로 하고 있다.

  • PDF

An Efficient Optimization Technique for Node Clustering in VANETs Using Gray Wolf Optimization

  • Khan, Muhammad Fahad;Aadil, Farhan;Maqsood, Muazzam;Khan, Salabat;Bukhari, Bilal Haider
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4228-4247
    • /
    • 2018
  • Many methods have been developed for the vehicles to create clusters in vehicular ad hoc networks (VANETs). Usually, nodes are vehicles in the VANETs, and they are dynamic in nature. Clusters of vehicles are made for making the communication between the network nodes. Cluster Heads (CHs) are selected in each cluster for managing the whole cluster. This CH maintains the communication in the same cluster and with outside the other cluster. The lifetime of the cluster should be longer for increasing the performance of the network. Meanwhile, lesser the CH's in the network also lead to efficient communication in the VANETs. In this paper, a novel algorithm for clustering which is based on the social behavior of Gray Wolf Optimization (GWO) for VANET named as Intelligent Clustering using Gray Wolf Optimization (ICGWO) is proposed. This clustering based algorithm provides the optimized solution for smooth and robust communication in the VANETs. The key parameters of proposed algorithm are grid size, load balance factor (LBF), the speed of the nodes, directions and transmission range. The ICGWO is compared with the well-known meta-heuristics, Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) for clustering in VANETs. Experiments are performed by varying the key parameters of the ICGWO, for measuring the effectiveness of the proposed algorithm. These parameters include grid sizes, transmission ranges, and a number of nodes. The effectiveness of the proposed algorithm is evaluated in terms of optimization of number of cluster with respect to transmission range, grid size and number of nodes. ICGWO selects the 10% of the nodes as CHs where as CLPSO and MOPSO selects the 13% and 14% respectively.

Fuzzy Rule Generation and Optimization for the Intelligent Diagnosis System of Diseases associated with Acute Abdominal Pain Based on Fuzzy Relational Products (급성복통과 관련된 지능형 질환 진단시스템을 위한 퍼지 규칙 생성과 이의 최적화)

  • Hyun Woo-Seok
    • The KIPS Transactions:PartB
    • /
    • v.11B no.7 s.96
    • /
    • pp.855-860
    • /
    • 2004
  • This paper describes knowledge base optimization of an intelligent diagnosis system based on fuzzy relational products(IDS-DAAP) for the diseases with acute abdominal Pain. The knowledge base of IDS-DAAP is composed of the fuzzy rules and the fuzzy membership functions. The author here proposes an advanced intelligent diagnosis system (A-lDS-DAAP) in which the fuzzy rule generation algorithm is applied. Comparing with previous IDS-DAAP and IDS-DAAP-NN, a modified approach with A-IDS-DAAP shows that it improves the diagnosis rate and reduces the time to diagnose.