• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3665-3674
• /
• 2021

One of the important parts of the in-core fuel management is loading pattern optimization (LPO). The loading pattern optimization as a reasonable design of the in-core fuel management can improve both economic and safe aspects of the nuclear reactor. This work proposes the hybrid of fuzzy logic controller with harmony search algorithm (HS) for loading pattern optimization in a pressurized water reactor. The music improvisation process to find a pleasing harmony is inspiring the harmony search algorithm. In this work, the adjustment of the harmony search algorithm parameters such as the bandwidth and the pitch adjustment rate are increasing performance of the proposed algorithm which is done through a fuzzy logic controller. Hence, membership functions and fuzzy rules are designed to improve the performance of the HS algorithm and achieve optimal results. The objective of the method is finding an optimum core arrangement according to safety and economic aspects such as reduction of power peaking factor (PPF) and increase of effective multiplication factor (Keff). The proposed approach effectiveness has been tried in two cases, Michalewicz's bivariate function problem and NEACRP LWR core. The results show that by using fuzzy harmony search algorithm the value of the fitness function is improved by 15.35%. Finally, with regard to the new solutions proposed in this research it could be used as a trustworthy method for other optimization issues of engineering field.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.11-17
• /
• 2001

Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.829-839
• /
• 2004

Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale. Heuristic methods such as neighborhood search, on the other hand, can handle large-scaled problems without too much difficulty and can be applied to problems having any form of objective functions and constraints. However, neighborhood search often gets stuck at local optima when faced with complex search spaces. This paper presents ,i hybrid algorithm of neighborhood search and integer programming, which nicely combines the advantages of both methods. The hybrid algorithm has been successfully tested on a large-scaled crew pairing optimization problem for a real subway line.

• Smart Structures and Systems
• /
• v.26 no.3
• /
• pp.345-360
• /
• 2020

Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.152-152
• /
• 2000

In this paper, we propose a new approach to intelligent motion and autonomous maneuvering of mobile robots using hybrid system. In high Level, the discrete states are defined by using the sensor-based search windows and the reference motions of a mobile robot as a low vevel are specified in the abstracted motions, The mobile robots can perform both the motion planning and autonomous maneuvering with obstacle avoidance in indoor navigation problem. Simulation and experimental results show that hybrid system approach is an effective method for the autonomous maneuvering in indoor environments.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.23 no.3
• /
• pp.213-217
• /
• 2014

A hybrid search method based on the artificial bee colony algorithm (ABCA) with harmony search (HS) is suggested for finding a global solution in the field of optimization. Three cases of the suggested algorithm were examined for improving the accuracy and convergence rate. The results showed that the case in which the harmony search was implemented with the onlooker phase in ABCA was the best among the three cases. Although the total computation time of the best case is a little bit longer than the original ABCA under the prescribed conditions, the global solution improved and the convergence rate was slightly faster than those of the ABCA. It is concluded that the suggested algorithm improves the accuracy and convergence rate, and it is expected that it can effectively be applied to optimization problems with many design variables and local solutions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• Steel and Composite Structures
• /
• v.45 no.4
• /
• pp.579-590
• /
• 2022

One of the biggest problems in structural steel calculation is the design of structures using the lowest possible material weight, making this a slow and costly process. To achieve this objective, several optimization methods have been developed and tested. Nevertheless, a method that performs very efficiently when applied to different problems is not yet available. Based on this assumption, this work proposes a hybrid metaheuristic algorithm for geometric and dimensional optimization of space trusses, called Simulated Squirrel Search Algorithm, which consists of an association of the well-established neighborhood shifting algorithm (Simulated Annealing) with a recently developed promising population algorithm (Squirrel Search Algorithm, or SSA). In this study, two models are tried, being respectively, a classical model from the literature (25-bar space truss) and a roof system composed of space trusses. The structures are subjected to resistance and displacement constraints. A penalty function using Fuzzy Logic (FL) is investigated. Comparative analyses are performed between the Squirrel Search Algorithm (SSSA) and other optimization methods present in the literature. The results obtained indicate that the proposed method can be competitive with other heuristics.

• Industrial Engineering and Management Systems
• /
• v.12 no.4
• /
• pp.306-316
• /
• 2013

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

• Industrial Engineering and Management Systems
• /
• v.6 no.1
• /
• pp.64-71
• /
• 2007

J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.