• Title/Summary/Keyword: meta-heuristic methods

Search Result 62, Processing Time 0.029 seconds

Task Sequence Optimization for 6-DOF Manipulator in Press Forming Process (프레스 공정에서 6자유도 로봇의 작업 시퀀스 최적화)

  • Yoon, Hyun Joong;Chung, Seong Youb
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.2
    • /
    • pp.704-710
    • /
    • 2017
  • Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).

An Energy- Efficient Optimal multi-dimensional location, Key and Trust Management Based Secure Routing Protocol for Wireless Sensor Network

  • Mercy, S.Sudha;Mathana, J.M.;Jasmine, J.S.Leena
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.10
    • /
    • pp.3834-3857
    • /
    • 2021
  • The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

Feature Selection for Anomaly Detection Based on Genetic Algorithm (유전 알고리즘 기반의 비정상 행위 탐지를 위한 특징선택)

  • Seo, Jae-Hyun
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.7
    • /
    • pp.1-7
    • /
    • 2018
  • Feature selection, one of data preprocessing techniques, is one of major research areas in many applications dealing with large dataset. It has been used in pattern recognition, machine learning and data mining, and is now widely applied in a variety of fields such as text classification, image retrieval, intrusion detection and genome analysis. The proposed method is based on a genetic algorithm which is one of meta-heuristic algorithms. There are two methods of finding feature subsets: a filter method and a wrapper method. In this study, we use a wrapper method, which evaluates feature subsets using a real classifier, to find an optimal feature subset. The training dataset used in the experiment has a severe class imbalance and it is difficult to improve classification performance for rare classes. After preprocessing the training dataset with SMOTE, we select features and evaluate them with various machine learning algorithms.

Simulation Analysis to Optimize the Management of Military Maintenance Facility (군 정비시설 운용 최적화를 위한 시뮬레이션 분석 연구)

  • Kim, Kyung-Rok;Rhee, Jong-Moon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.2724-2731
    • /
    • 2014
  • As the future national defense plan of government focus on advanced weapon system, military maintenance facility becomes more important. However, military maintenance facility has been managed by director's experience and simple mathematical calculation until now. Thus, the optimization for the management of military maintenance facility is suggested by more scientistic and logical methods in this study. The study follows the procedure below. First, simulation is designed according to the analysis of military maintenance facility. Second, independent variable and dependent variable are defined for optimization. Independent Variable includes the number of maintenance machine, transportation machine, worker in the details of military maintenance facility operation, and dependent variable involves total maintenance time affected by independent variable. Third, warmup analysis is performed to get warmup period, based on the simulation model. Fourth, the optimal combination is computed with evolution strategy, meta-heuristic, to enhance military maintenance management. By the optimal combination, the management of military maintenance facility can gain the biggest effect against the limited cost. In the future, the multipurpose study, to analyze the military maintenance facility covering various weapon system equipments, will be performed.

Optimal Design of a Hybrid Structural Control System using a Self-Adaptive Harmony Search Algorithm (자가적응 화음탐색 알고리즘을 이용한 복합형 최적 구조제어 시스템 설계)

  • Park, Wonsuk
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.31 no.6
    • /
    • pp.301-308
    • /
    • 2018
  • This paper presents an optimal design method of a hybrid structural control system considering multi-hazard. Unlike a typical structural control system in which one system is designed for one specific type of hazard, a simultaneous optimal design method for both active and passive control systems is proposed for the mitigation of seismic and wind induced vibration responses of structures. As a numerical example, an optimal design problem is illustrated for a hybrid mass damper(HMD) and 30 viscous dampers which are installed on a 30 story building structure. In order to solve the optimization problem, a self-adaptive Harmony Search(HS) algorithm is adopted. Harmony Search algorithm is one of the meta-heuristic evolutionary methods for the global optimization, which mimics the human player's tuning process of musical instruments. A self-adaptive, dynamic parameter adjustment algorithm is also utilized for the purpose of broad search and fast convergence. The optimization results shows that the performance and effectiveness of the proposed system is superior with respect to a reference hybrid system in which the active and passive systems are independently optimized.

An optimal feature selection algorithm for the network intrusion detection system (네트워크 침입 탐지를 위한 최적 특징 선택 알고리즘)

  • Jung, Seung-Hyun;Moon, Jun-Geol;Kang, Seung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.342-345
    • /
    • 2014
  • Network intrusion detection system based on machine learning methods is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features from generally used features to detect network intrusion requires extensive computing resources. For instance, the number of possible feature combinations from given n features is $2^n-1$. In this paper, to tackle this problem we propose a optimal feature selection algorithm. Proposed algorithm is based on the local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In addition, the accuracy of clusters which obtained using selected feature components and k-means clustering algorithm is adopted to evaluate a feature assembly. In order to estimate the performance of our proposed algorithm, comparing with a method where all features are used on NSL-KDD data set and multi-layer perceptron.

  • PDF

Comparison of Three Parameter Estimation Methods for Mixture Distributions (혼합분포모형의 매개변수 추정방법 비교)

  • Shin, Ju-Young;Kim, Sooyoung;Kim, Taereem;Heo, Jun-Haeng
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2017.05a
    • /
    • pp.45-45
    • /
    • 2017
  • 상이한 자연현상으로 발생된 자료들은 때때로 통계적으로 다른 특성을 가지는 경우가 있다. 이런 자료들은 다른 두 개 이상의 모집단에서 자료가 발생한 것으로 가정할 수 가 있다. 기존에 널리 사용되어온 분포형 모형의 경우 단일한 모집단으로부터 자료가 발생한다는 가정하에서 개발된 모형들로 위에서 언급한 자료들을 적절히 모의할 수 없다. 이런 상이한 모집단에서 발생된 자료를 모형화 하기 위해서 혼합분포모형(mixture distribution)이 개발되었다. 홍수나 가뭄 등과 같은 극치 사상의 경우 다양한 자연현상들로부터 발생하기에 혼합분포모형을 적용할 경우 보다 정확한 모의가 가능하다. 혼합분포모형은 두 개 이상의 비혼합분포모형들을 가중합하여 만들어진다. 혼합 분포모형의 형태로 인하여 기존의 분포형 모형의 매개변수 추정 모형으로 널리 사용되던 최우도법 (maximum likelihood method), 모멘트법(method of moment), 확률가중모멘트법 (probability weighted moment method) 등을 이용하여 혼합분포모형의 매개변수를 추정하는 것이 용이 하지 않다. 혼합분포모형의 매개변수 추정 방법으로는 Expectation-Maximization (EM) 알고리즘, Meta-Heuristic Maximum Likelihood (MHML) 방법, Markov Chain Monte Carlo (MCMC) 방법 등이 적용되고 있다. 현재까지 수자원 분야에서 사용되는 극치 자료를 혼합분포모형을 이용하여 모의할 때 매개변수 추정방법에 따른 특성에 대한 연구가 진행되지 않았다. 본 연구에서는 우리나라 연최대강우량 자료를 이용하여 혼합분포모형의 매개변수 추정방법 (EM 알고리즘, MHML 방법, MCMC 방법) 들의 특성들을 비교 분석하였다. 혼합분포모형으로는 Gumbel-Gumbel 혼합분포 모형을 적용하였다. 본 연구의 결과는 향후 혼합분포모형을 이용한 연구에 좋은 기초자료로 사용될 수 있을 것으로 판단된다.

  • PDF

Short-term Scheduling Optimization for Subassembly Line in Ship Production Using Simulated Annealing (시뮬레이티드 어닐링을 활용한 조선 소조립 라인 소일정계획 최적화)

  • Hwang, In-Hyuck;Noh, Jac-Kyou;Lee, Kwang-Kook;Shin, Jon-Gye
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

Intelligent prediction of engineered cementitious composites with limestone calcined clay cement (LC3-ECC) compressive strength based on novel machine learning techniques

  • Enming Li;Ning Zhang;Bin Xi;Vivian WY Tam;Jiajia Wang;Jian Zhou
    • Computers and Concrete
    • /
    • v.32 no.6
    • /
    • pp.577-594
    • /
    • 2023
  • Engineered cementitious composites with calcined clay limestone cement (LC3-ECC) as a kind of green, low-carbon and high toughness concrete, has recently received significant investigation. However, the complicated relationship between potential influential factors and LC3-ECC compressive strength makes the prediction of LC3-ECC compressive strength difficult. Regarding this, the machine learning-based prediction models for the compressive strength of LC3-ECC concrete is firstly proposed and developed. Models combine three novel meta-heuristic algorithms (golden jackal optimization algorithm, butterfly optimization algorithm and whale optimization algorithm) with support vector regression (SVR) to improve the accuracy of prediction. A new dataset about LC3-ECC compressive strength was integrated based on 156 data from previous studies and used to develop the SVR-based models. Thirteen potential factors affecting the compressive strength of LC3-ECC were comprehensively considered in the model. The results show all hybrid SVR prediction models can reach the Coefficient of determination (R2) above 0.95 for the testing set and 0.97 for the training set. Radar and Taylor plots also show better overall prediction performance of the hybrid SVR models than several traditional machine learning techniques, which confirms the superiority of the three proposed methods. The successful development of this predictive model can provide scientific guidance for LC3-ECC materials and further apply to such low-carbon, sustainable cement-based materials.

Development of the Meta-heuristic Optimization Algorithm: Exponential Bandwidth Harmony Search with Centralized Global Search (새로운 메타 휴리스틱 최적화 알고리즘의 개발: Exponential Bandwidth Harmony Search with Centralized Global Search)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.8-18
    • /
    • 2020
  • An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).