• 제목/요약/키워드: metaheuristic methods

Search Result 43, Processing Time 0.026 seconds

Virtual Machine Placement Methods using Metaheuristic Algorithms in a Cloud Environment - A Comprehensive Review

  • Alsadie, Deafallah
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.147-158
    • /
    • 2022
  • Cloud Computing offers flexible, on demand, ubiquitous resources for cloud users. Cloud users are provided computing resources in a virtualized environment. In order to meet the growing demands for computing resources, data centres contain a large number of physical machines accommodating multiple virtual machines. However, cloud data centres cannot utilize their computing resources to their total capacity. Several policies have been proposed for improving energy proficiency and computing resource utilization in cloud data centres. Virtual machine placement is an effective method involving efficient mapping of virtual machines to physical machines. However, the availability of many physical machines accommodating multiple virtual machines in a data centre has made the virtual machine placement problem a non deterministic polynomial time hard (NP hard) problem. Metaheuristic algorithms have been widely used to solve the NP hard problems of multiple and conflicting objectives, such as the virtual machine placement problem. In this context, we presented essential concepts regarding virtual machine placement and objective functions for optimizing different parameters. This paper provides a taxonomy of metaheuristic algorithms for the virtual machine placement method. It is followed by a review of prominent research of virtual machine placement methods using meta heuristic algorithms and comparing them. Finally, this paper provides a conclusion and future research directions in virtual machine placement of cloud computing.

Metaheuristic-hybridized multilayer perceptron in slope stability analysis

  • Ye, Xinyu;Moayedi, Hossein;Khari, Mahdy;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • v.26 no.3
    • /
    • pp.263-275
    • /
    • 2020
  • This research is dedicated to slope stability analysis using novel intelligent models. By coupling a neural network with spotted hyena optimizer (SHO), salp swarm algorithm (SSA), shuffled frog leaping algorithm (SFLA), and league champion optimization algorithm (LCA) metaheuristic algorithms, four predictive ensembles are built for predicting the factor of safety (FOS) of a single-layer cohesive soil slope. The data used to develop the ensembles are provided from a vast finite element analysis. After creating the proposed models, it was observed that the best population size for the SHO, SSA, SFLA, and LCA is 300, 400, 400, and 200, respectively. Evaluation of the results showed that the combination of metaheuristic and neural approaches offers capable tools for estimating the FOS. However, the SSA (error = 0.3532 and correlation = 0.9937), emerged as the most reliable optimizer, followed by LCA (error = 0.5430 and correlation = 0.9843), SFLA (error = 0.8176 and correlation = 0.9645), and SHO (error = 2.0887 and correlation = 0.8614). Due to the high accuracy of the SSA in properly adjusting the computational parameters of the neural network, the corresponding FOS predictive formula is presented to be used as a fast yet accurate substitution for traditional methods.

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.2
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

Hybrid GA-ANN and PSO-ANN methods for accurate prediction of uniaxial compression capacity of CFDST columns

  • Quang-Viet Vu;Sawekchai Tangaramvong;Thu Huynh Van;George Papazafeiropoulos
    • Steel and Composite Structures
    • /
    • v.47 no.6
    • /
    • pp.759-779
    • /
    • 2023
  • The paper proposes two hybrid metaheuristic optimization and artificial neural network (ANN) methods for the close prediction of the ultimate axial compressive capacity of concentrically loaded concrete filled double skin steel tube (CFDST) columns. Two metaheuristic optimization, namely genetic algorithm (GA) and particle swarm optimization (PSO), approaches enable the dynamic training architecture underlying an ANN model by optimizing the number and sizes of hidden layers as well as the weights and biases of the neurons, simultaneously. The former is termed as GA-ANN, and the latter as PSO-ANN. These techniques utilize the gradient-based optimization with Bayesian regularization that enhances the optimization process. The proposed GA-ANN and PSO-ANN methods construct the predictive ANNs from 125 available experimental datasets and present the superior performance over standard ANNs. Both the hybrid GA-ANN and PSO-ANN methods are encoded within a user-friendly graphical interface that can reliably map out the accurate ultimate axial compressive capacity of CFDST columns with various geometry and material parameters.

Comparative Study on Performance of Metaheuristics for Weapon-Target Assignment Problem (무기-표적 할당 문제에 대한 메타휴리스틱의 성능 비교)

  • Choi, Yong Ho;Lee, Young Hoon;Kim, Ji Eun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.3
    • /
    • pp.441-453
    • /
    • 2017
  • In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.
    • Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.226-249
    • /
    • 2016
  • The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

Simulated squirrel search algorithm: A hybrid metaheuristic method and its application to steel space truss optimization

  • Pauletto, Mateus P.;Kripka, Moacir
    • 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.

A Single-model Single-sided Assembly Line Balancing Problem Using Main-path Clustering Algorithm (단일모델 단측 조립라인 균형문제의 주경로 군집화 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.5
    • /
    • pp.89-98
    • /
    • 2014
  • This paper suggests heuristic algorithm for single-model simple assembly line balancing problem that is a kind of NP-hard problem. This problem primarily can be solved metaheuristic method. This heuristic algorithm set the main-path that has a most number of operations from start to end-product. Then the clustering algorithm can be assigns operations to each workstation within cycle time follow main-path. This algorithm decides minimum number of workstations and can be reduces the cycle time. This algorithm can be better performance then metaheuristic methods.

Stack Bin Packing Algorithm for Containers Pre-Marshalling Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.10
    • /
    • pp.61-68
    • /
    • 2015
  • This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

Optimum tuned mass damper design for preventing brittle fracture of RC buildings

  • Nigdeli, Sinan Melih;Bekdas, Gebrail
    • Smart Structures and Systems
    • /
    • v.12 no.2
    • /
    • pp.137-155
    • /
    • 2013
  • Brittle fracture of structures excited by earthquakes can be prevented by adding a tuned mass damper (TMD). This TMD must be optimum and suitable to the physical conditions of the structure. Compressive strength of concrete is an important factor for brittle fracture. The application of a TMD to structures with low compressive strength of concrete may not be possible if the weight of the TMD is too much. A heavy TMD is dangerous for these structures because of insufficient axial force capacity of structure. For the preventing brittle fracture, the damping ratio of the TMD must be sufficient to reduce maximum shear forces below the values proposed in design regulations. Using the formulas for frequency and damping ratio related to a preselected mass, this objective can be only achieved by increasing the mass of the TMD. By using a metaheuristic method, the optimum parameters can be searched in a specific limit. In this study, Harmony Search (HS) is employed to find optimum TMD parameters for preventing brittle fracture by reducing shear force in additional to other time and frequency responses. The proposed method is feasible for the retrofit of weak structures with insufficient compressive strength of concrete.