• Title/Summary/Keyword: Metaheuristic Method

Search Result 90, Processing Time 0.024 seconds

Active structural control via metaheuristic algorithms considering soil-structure interaction

  • Ulusoy, Serdar;Bekdas, Gebrail;Nigdeli, Sinan Melih
    • Structural Engineering and Mechanics
    • /
    • v.75 no.2
    • /
    • pp.175-191
    • /
    • 2020
  • In this study, multi-story structures are actively controlled using metaheuristic algorithms. The soil conditions such as dense, normal and soft soil are considered under near-fault ground motions consisting of two types of impulsive motions called directivity effect (fault normal component) and the flint step (fault parallel component). In the active tendon-controlled structure, Proportional-Integral-Derivative (PID) type controller optimized by the proposed algorithms was used to achieve a control signal and to produce a corresponding control force. As the novelty of the study, the parameters of PID controller were determined by different metaheuristic algorithms to find the best one for seismic structures. These algorithms are flower pollination algorithm (FPA), teaching learning based optimization (TLBO) and Jaya Algorithm (JA). Furthermore, since the influence of time delay on the structural responses is an important issue for active control systems, it should be considered in the optimization process and time domain analyses. The proposed method was applied for a 15-story structural model and the feasible results were found by limiting the maximum control force for the near-fault records defined in FEMA P-695. Finally, it was determined that the active control using metaheuristic algorithms optimally reduced the structural responses and can be applied for the buildings with the soil-structure interaction (SSI).

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.

A Study on Developing Vehicle Scheduling System using Constraint Programming and Metaheuristics (제약 프로그래밍과 메타휴리스틱을 활용한 차량 일정계획 시스템 개발에 관한 연구)

  • Kim Yong-Hwan;Jang Yong-Sung;Ryu Hwan-Ju
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.979-986
    • /
    • 2002
  • Constraint Programming is an appealing technology for modeling and solving various real-world problems. and metaheuristic is the most successful technique available for solving large real-world vehicle routing problems. Constraint Programming and metaheuristic are complementary to each other. This paper describes how iterative improvement techniques can be used in a Constraint Programming framework(LOG Solver and ILOG Dispatcher) for Vehicle Routing Problem. As local search gets trapped in local solution, the improvement techniques are used in conjunction with metaheuristic method.

  • PDF

A Study on the PAPR Reduction Using Phase Rotation Method Applying Metaheuristic Algorithm (Metaheuristic 알고리즘을 적용한 위상회전 기법에 의한 PAPR 감소에 관한 연구)

  • Yoo, Sun-Yong;Park, Bee-Ho;Kim, Wan-Tae;Cho, Sung-Joon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.26-35
    • /
    • 2009
  • OFDM (Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OFDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PAPR(Peak-to-Average Power Ratio). Phase rotation method can reduce the PAPR without nonlinear distortion by multiplying phase weighting factors. But computational complexity of searching phase weighting factors is increased exponentially with the number of subblocks and considered phase factor. Therefore, a new method, which can reduce computational complexity and detect phase weighting factors efficiently, should be developed. In this paper, a modeling process is introduced, which apply metaheuristic algerian in phase rotation method and optimize in PTS (Particle Swarm Optimization) scheme. Proposed algorithm can solve the computational complexity and guarantee to reduce PAPR We analyzed the efficiency of the PAPR reduction through a simulation when we applied the proposed method to telecommunication systems.

CO2 emissions optimization of reinforced concrete ribbed slab by hybrid metaheuristic optimization algorithm (IDEACO)

  • Shima Bijari;Mojtaba Sheikhi Azqandi
    • Advances in Computational Design
    • /
    • v.8 no.4
    • /
    • pp.295-307
    • /
    • 2023
  • This paper presents an optimization of the reinforced concrete ribbed slab in terms of minimum CO2 emissions and an economic justification of the final optimal design. The design variables are six geometry variables including the slab thickness, the ribs spacing, the rib width at the lower and toper end, the depth of the rib and the bar diameter of the reinforcement, and the seventh variable defines the concrete strength. The objective function is considered to be the minimum amount of carbon dioxide gas (CO2) emission and at the same time, the optimal design is economical. Seven significant design constraints of American Concrete Institute's Standard were considered. A robust metaheuristic optimization method called improved dolphin echolocation and ant colony optimization (IDEACO) has been used to obtain the best possible answer. At optimal design, the three most important sources of CO2 emissions include concrete, steel reinforcement, and formwork that the contribution of them are 63.72, 32.17, and 4.11 percent respectively. Formwork, concrete, steel reinforcement, and CO2 are the four most important sources of cost with contributions of 67.56, 19.49, 12.44, and 0.51 percent respectively. Results obtained by IDEACO show that cost and CO2 emissions are closely related, so the presented method is a practical solution that was able to reduce the cost and CO2 emissions simultaneously.

A Metaheuristic Algorithm based Redesign Methodology for Green Product Family Considering Environmental Performance (환경성을 고려한 메타 휴리스틱 알고리즘 기반의 그린 Product Family 재설계 방법론)

  • Seo, Kwang-Kyu
    • Journal of Digital Convergence
    • /
    • v.12 no.5
    • /
    • pp.125-130
    • /
    • 2014
  • The competitiveness in today's global market forces many companies to develop families of products to provide enough variety for the marketplace. The challenge when designing a product family is in resolving the tradeoff between product commonality and distinctiveness. Simultaneously it is necessary to consider environmental performance to design a product family as well as to shorten lead-times, improve quality and reduce costs. This paper proposes a metaheuristic algorithm based redesign methodology for green product family considering environmental performance. The proposed method uses a genetic algorithm as metaheuristic algorithm and green product family index (GPFI) to support green product family design. In addition, it provides the redesign methodology such as product family level and component level. A case study used table lamps as an product family's example shows the verification and effectiveness of the proposed method.

Metaheuristic Optimization Techniques for an Electromagnetic Multilayer Radome Design

  • Nguyen, Trung Kien;Lee, In-Gon;Kwon, Obum;Kim, Yoon-Jae;Hong, Ic-Pyo
    • Journal of electromagnetic engineering and science
    • /
    • v.19 no.1
    • /
    • pp.31-36
    • /
    • 2019
  • In this study, an effective method for designing an electromagnetic multilayer radome is introduced. This method is achieved by using ant colony optimization for a continuous domain in the transmission coefficient maximization with stability for a wide angle of incidence in both perpendicular and parallel polarizations in specific X- and Ku-bands. To obtain the optimized parameter for a C-sandwich radome, particle swarm optimization algorithm is operated to give a clear comparison on the effectiveness of ant colony optimization for a continuous domain. The qualification of an optimized multilayer radome is also compared with an effective solid radome type in transmitted power stability and presented in this research.

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.

Optimum cost design of RC columns using artificial bee colony algorithm

  • Ozturk, Hasan Tahsin;Durmus, Ahmet
    • Structural Engineering and Mechanics
    • /
    • v.45 no.5
    • /
    • pp.643-654
    • /
    • 2013
  • Optimum cost design of columns subjected to axial force and uniaxial bending moment is presented in this paper. In the formulation of the optimum design problem, the height and width of the column, diameter and number of reinforcement bars are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the column consisting the cost of concrete, steel, and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The Artificial Bee Colony Algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

Metaheuristics for reliable server assignment problems

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.38 no.10
    • /
    • pp.1340-1346
    • /
    • 2014
  • Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.