• Title/Summary/Keyword: Meta-heuristic algorithm

Search Result 168, Processing Time 0.024 seconds

An Optimization Algorithm for Minimum Energy Broadcast Problem in Wireless Sensor Networks (무선 센서 네트워크에서 최소 전력 브로드캐스트 문제를 위한 최적화 알고리즘)

  • Jang, Kil-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.236-244
    • /
    • 2012
  • The minimum energy broadcast problem is for all deployed nodes to minimize a total transmission energy for performing a broadcast operation in wireless networks. In this paper, we propose a Tabu search algorithm to solve efficiently the minimum energy broadcast problem on the basis of meta-heuristic approach in wireless sensor networks. In order to make a search more efficient, we propose a novel neighborhood generating method and a repair function of the proposed algorithm. We compare the performance of the proposed algorithm with other existing algorithms through some experiments in terms of the total transmission energy of nodes and algorithm computation time. Experimental results show that the proposed algorithm is efficient for the minimum energy broadcast problem in wireless sensor networks.

A Study on the Performance Improvement of Harmony Search Optimization Algorithm (HS 최적화 알고리즘 성능 향상에 관한 연구)

  • Lee, Tae-Bong
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.5
    • /
    • pp.403-408
    • /
    • 2021
  • Harmony Search(HS) algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and has been successfully applied to solve different optimization problems. In order to further improve the performance of HS, this paper proposes a new method which is called Fast Harmony Search(FSH) algorithm. For the purpose, this paper suggest a method to unify two independent improvisation processes by newly defining the boundary value of a object variable using HM. As the result, the process time of the algorithm is shorten and explicit decision of bandwidth is no more needed. Furthermore, exploitative power of random selection is improved. The numerical results reveal that the proposed algorithm can find better solutions and is faster when compared to the conventional HS.

Simultaneous Optimization of Level of Repair and Spare Parts Allocation for MIME Systems under Availability Constraint with Simulation and a Meta-heuristic (가용도 제약하에 시뮬레이션과 메타 휴리스틱을 이용한 MIME 시스템의 수리수준 및 수리부속 할당 동시 최적화)

  • Chung, Il-Han;Yun, Won-Young;Kim, Ho-Gyun
    • Korean Management Science Review
    • /
    • v.26 no.1
    • /
    • pp.209-223
    • /
    • 2009
  • In this paper, an analysis problem of repair levels and spare part allocation for MIME(Multi indenture multi echelon) systems is studied using simulation and meta-heuristics. We suggest a method to determine simultaneously repair levels and spare parts allocation to minimize the life cycle cost of MIME system under availability constraint. A simulated annealing method is used to analyze the repair levels and genetic algorithm is used to obtain the optimal allocation of spare parts. We also develop a simulation system to calculate the life cycle cost and system availability. Some numerical examples are also studied.

Design of steel frames by an enhanced moth-flame optimization algorithm

  • Gholizadeh, Saeed;Davoudi, Hamed;Fattahi, Fayegh
    • Steel and Composite Structures
    • /
    • v.24 no.1
    • /
    • pp.129-140
    • /
    • 2017
  • Structural optimization is one of the popular and active research areas in the field of structural engineering. In the present study, the newly developed moth-flame optimization (MFO) algorithm and its enhanced version termed as enhanced moth-flame optimization (EMFO) are employed to implement the optimization process of planar and 3D steel frame structures with discrete design variables. The main inspiration of this optimizer is the navigation method of moths in nature called transverse orientation. A number of benchmark steel frame optimization problems are solved by the MFO and EMFO algorithms and the results are compared with those of other meta-heuristics. The obtained numerical results indicate that the proposed EMFO algorithm possesses better computational performance compared with other existing meta-heuristics.

Facility Layout Planning Using Ant Algorithm (개미 알고리듬을 이용한 설비배치계획)

  • Lee Seong Yeol;Lee Wol Seon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.1065-1070
    • /
    • 2003
  • Facility Layout Planning is concerned with how to arrange facilities necessary for production in a given space. Its objective is often to minimize the total sum of all material flows multiplied by the distance among facilities. FLP belongs to NP complete problem; i.e., the number of possible layout solutions increases with the increase of the number of facilities. Thus, meta heuristics such as Genetic Algorithm (GA) and Simulated Annealing have been investigated to solve the FLP problems. However, one of the biggest problems which lie in the existing meta heuristics including GA is hard to find an appropriate combinations of parameters which result in optimal solutions for the specific problem. The Ant System algorithm with elitist and ranking strategies is used to solve the FLP problem as an another good alternative. Experimental results show that the AS algorithm is able to produce the same level of solution quality with less sensitive parameters selection comparing to the ones obtained by applying other existing meta heuristic algorithms.

  • PDF

Development of New Meta-Heuristic For a Bivariate Polynomial (이변수 다항식 문제에 대한 새로운 메타 휴리스틱 개발)

  • Chang, Sung-Ho;Kwon, Moonsoo;Kim, Geuntae;Lee, Jonghwan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.2
    • /
    • pp.58-65
    • /
    • 2021
  • Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.

The optimization study of core power control based on meta-heuristic algorithm for China initiative accelerator driven subcritical system

  • Jin-Yang Li;Jun-Liang Du;Long Gu;You-Peng Zhang;Cong Lin;Yong-Quan Wang;Xing-Chen Zhou;Huan Lin
    • Nuclear Engineering and Technology
    • /
    • v.55 no.2
    • /
    • pp.452-459
    • /
    • 2023
  • The core power control is an important issue for the study of dynamic characteristics in China initiative accelerator driven subcritical system (CiADS), which has direct impact on the control strategy and safety analysis process. The CiADS is an experimental facility that is only controlled by the proton beam intensity without considering the control rods in the current engineering design stage. In order to get the optimized operation scheme with the stable and reliable features, the variation of beam intensity using the continuous and periodic control approaches has been adopted, and the change of collimator and the adjusting of duty ratio have been proposed in the power control process. Considering the neutronics and the thermal-hydraulics characteristics in CiADS, the physical model for the core power control has been established by means of the point reactor kinetics method and the lumped parameter method. Moreover, the multi-inputs single-output (MISO) logical structure for the power control process has been constructed using proportional integral derivative (PID) controller, and the meta-heuristic algorithm has been employed to obtain the global optimized parameters for the stable running mode without producing large perturbations. Finally, the verification and validation of the control method have been tested based on the reference scenarios in considering the disturbances of spallation neutron source and inlet temperature respectively, where all the numerical results reveal that the optimization method has satisfactory performance in the CiADS core power control scenarios.

A Hierarchical Hybrid Meta-Heuristic Approach to Coping with Large Practical Multi-Depot VRP

  • Shimizu, Yoshiaki;Sakaguchi, Tatsuhiko
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.2
    • /
    • pp.163-171
    • /
    • 2014
  • Under amazing increase in markets and certain demand on qualified service in the delivery system, global logistic optimization is becoming a keen interest to provide an essential infrastructure coping with modern competitive prospects. As a key technology for such deployment, we have been engaged in the practical studies on vehicle routing problem (VRP) in terms of Weber model, and developed a hybrid approach of meta-heuristic methods and the graph algorithm of minimum cost flow problem. This paper extends such idea to multi-depot VRP so that we can give a more general framework available for various real world applications including those in green or low carbon logistics. We show the developed procedure can handle various types of problem, i.e., delivery, direct pickup, and drop by pickup problems in a common framework. Numerical experiments have been carried out to validate the effectiveness of the proposed method. Moreover, to enhance usability of the method, Google Maps API is applied to retrieve real distance data and visualize the numerical result on the map.

TMD parameters optimization in different-length suspension bridges using OTLBO algorithm under near and far-field ground motions

  • Alizadeh, Hamed;Lavasani, H.H.
    • Earthquakes and Structures
    • /
    • v.18 no.5
    • /
    • pp.625-635
    • /
    • 2020
  • Suspension bridges have the extended in plan configuration which makes them prone to dynamic events like earthquake. The longer span lead to more flexibility and slender of them. So, control systems seem to be essential in order to protect them against ground motion excitation. Tuned mass damper or in brief TMD is a passive control system that its efficiency is practically proven. Moreover, its parameters i.e. mass ratio, tuning frequency and damping ratio can be optimized in a manner providing the best performance. Meta-heuristic optimization algorithm is a powerful tool to gain this aim. In this study, TMD parameters are optimized in different-length suspension bridges in three distinct cases including 3, 4 and 5 TMDs by observer-teacher-learner based algorithm under a complete set of ground motions formed from both near-field and far-field instances. The Vincent Thomas, Tacoma Narrows and Golden Gate suspension bridges are selected for case studies as short, mean and long span ones, respectively. The results indicate that All cases of used TMDs result in response reduction and case 4TMD can be more suitable for bridges in near and far-field conditions.

Optimal Block Lifting Scheduling Considering the Minimization of Travel Distance at an Idle State and Wire Replacement of a Goliath Crane (골리앗 크레인의 공주행 거리와 와이어 교체 최소를 고려한 최적 블록 리프팅 계획)

  • Roh, Myung-Il;Lee, Kyu-Yeul
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently, a shipyard is making every effort to efficiently manage equipments of resources such as a gantry crane, transporter, and so on. So far block lifting scheduling of a gantry crane has been manually performed by a manager of the shipyard, and thus it took much time to get scheduling results and moreover the quality of them was not optimal. To improve this, a block lifting scheduling system of the gantry crane using optimization techniques was developed in this study. First, a block lifting scheduling problem was mathematically formulated as a multi-objective optimization problem, considering the minimization of travel distance at an idle state and wire replacement during block lifting. Then, to solve the problem, a meta-heuristic optimization algorithm based on the genetic algorithm was proposed. To evaluate the efficiency and applicability of the developed system, it was applied to an actual block lifting scheduling problem of the shipyard. The result shows that blocks can be efficiently lifted by the gantry crane using the developed system, compared to manual scheduling by a manager.