• Structural Engineering and Mechanics
• /
• v.81 no.1
• /
• pp.93-102
• /
• 2022

The optimum design of reinforced concrete cantilever retaining walls subjected to seismic loads is an extremely important challenge in structural and geotechnical engineering, especially in seismic zones. This study proposes an adaptive sperm swarm optimization algorithm (ASSO) for economic design of retaining structure under static and seismic loading. The proposed ASSO algorithm utilizes a time-varying velocity damping factor to provide a fine balance between the explorative and exploitative behavior of the original method. In addition, the new method considers a reasonable velocity limitation to avoid the divergence of the sperm movement. The proposed algorithm is benchmarked with a set of test functions and the results are compared with the standard sperm swarm optimization (SSO) and some other robust metaheuristic from the literature. For seismic optimization of retaining structures, Mononobe-Okabe method is employed for dynamic loading conditions and total construction cost of the structure is considered as the single objective function. The optimization constraints include both geotechnical and structural restrictions and the design variables are the geometrical dimensions of the wall and the amount of steel reinforcement. Finally, optimization of two benchmark retaining structures under static and seismic loads using the ASSO algorithm is presented. According to the numerical results, the ASSO may provide better optimal solutions, and the designs obtained by ASSO have a lower cost by up to 20% compared with some other methods from the literature.

• ETRI Journal
• /
• v.39 no.6
• /
• pp.782-793
• /
• 2017

This paper considers the use of the Partial Transmit Sequence (PTS) technique to reduce the Peak-to-Average Power Ratio (PAPR) of an Orthogonal Frequency Division Multiplexing signal in wireless communication systems. Search complexity is very high in the traditional PTS scheme because it involves an extensive random search over all combinations of allowed phase vectors, and it increases exponentially with the number of phase vectors. In this paper, a suboptimal metaheuristic algorithm for phase optimization based on an improved harmony search (IHS) is applied to explore the optimal combination of phase vectors that provides improved performance compared with existing evolutionary algorithms such as the harmony search algorithm and firefly algorithm. IHS enhances the accuracy and convergence rate of the conventional algorithms with very few parameters to adjust. Simulation results show that an improved harmony search-based PTS algorithm can achieve a significant reduction in PAPR using a simple network structure compared with conventional algorithms.

• Earthquakes and Structures
• /
• v.12 no.4
• /
• pp.389-395
• /
• 2017

In this paper a simple approach is presented for spectral matching of ground motions utilizing the wavelet transform and a recently developed metaheuristic optimization technique. For this purpose, wavelet transform is used to decompose the original ground motions to several levels, where each level covers a special range of frequency, and then each level is multiplied by a variable. Subsequently, the vibrating particles system (VPS) algorithm is employed to calculate the variables such that the error between the response and target spectra is minimized. The application of the proposed method is illustrated through modifying 12 sets of ground motions. The results achieved by this method demonstrate its capability in solving the problem. The outcomes of the VPS algorithm are compared to those of the standard colliding bodies optimization (CBO) to illustrate the importance of the enhancement of the algorithm.

• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.1-12
• /
• 2016

The Harmony Search Algorithm (HSA) is one of the recently developed metaheuristic optimization algorithms. Since the development of HSA, it has been applied by many researchers from various fields. The increasing complexity of problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms are required. In this study, to improve the HSA in terms of a structural setting, a new HSA that has structural characteristics, called the Multi-layered Harmony Search Algorithm (MLHSA) was proposed. In this new method, the structural characteristics were added to HSA to improve the exploration and exploitation capability. In addition, the MLHSA was applied to optimization problems, including unconstrained benchmark functions and water distribution system pipe diameter design problems to verify the efficiency and applicability of the proposed algorithm. The results revealed the strength of MLHSA and its competitiveness.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.129-140
• /
• 2008

In this paper, we propose a novel ant colony optimization (ACO)-based test scheduling method for testing network-on-chip (NoC)-based systems-on-chip (SoCs), on the assumption that the test platform, including specific methods and configurations such as test packet routing, generation, and absorption, is installed. The ACO metaheuristic model, inspired by the ant's foraging behavior, can autonomously find better results by exploring more solution space. The proposed method efficiently combines the rectangle packing method with ACO and improves the scheduling results by dynamically choosing the test-access-mechanism widths for cores and changing the testing orders. The power dissipation and variable test clock mode are also considered. Experimental results using ITC'02 benchmark circuits show that the proposed algorithm can efficiently reduce overall test time. Moreover, the computation time of the algorithm is less than a few seconds in most cases.

• Industrial Engineering and Management Systems
• /
• v.11 no.4
• /
• pp.310-330
• /
• 2012

Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

• Advances in Computational Design
• /
• v.1 no.2
• /
• pp.175-194
• /
• 2016

Nature has provided inspiration for most of the man-made technologies. Scientists believe that dolphins are the second to humans in smartness and intelligence. Echolocation is the biological sonar used by dolphins for navigation and hunting in various environments. This ability of dolphins is mimicked in this paper to develop a new optimization method. Dolphin Echolocation Optimization (DEO) is an optimization method based on dolphin's approach for hunting food and exploration of environment. DEO has already been developed for discrete optimization search space and here it is extended to continuous search space. DEO has simple rules and is adjustable for predetermined computational cost. DEO provides the optimum results and leads to alternative optimality curves suitable for the problem. This algorithm has a few parameters and it is applicable to a wide range of problems like other metaheuristic algorithms. In the present work, the efficiency of this approach is demonstrated using standard benchmark problems.

• Smart Structures and Systems
• /
• v.29 no.5
• /
• pp.677-691
• /
• 2022

Water cycle algorithm (WCA) has been a very effective optimization technique for complex engineering problems. This study employs the WCA for simultaneous prediction of heating load (L_H) and cooling load (L_C) in residential buildings. This algorithm is responsible for optimally tuning a neural network (NN). Utilizing 614 records, the behavior of the L_H and L_C is explored and the captured knowledge is then used to predict for 154 unanalyzed building conditions. Since the WCA is a population-based algorithm, different numbers of the searching agents were tested to find the most optimum configuration. It was observed that the best solution is discovered by 500 agents. A comparison with five newly-developed benchmark optimizers, namely equilibrium optimizer (EO), multi-tracker optimization algorithm (MTOA), slime mould algorithm (SMA), multi-verse optimizer (MVO), and electromagnetic field optimization (EFO) revealed that the WCANN predicts the desired parameters with considerably larger accuracy. Obtained root mean square errors (1.4866, 2.1296, 2.8279, 2.5727, 2.5337, and 2.3029 for the L_H and 2.1767, 2.6459, 3.1821, 2.9732, 2.9616, and 2.6890 for the L_C) indicated that the most reliable prediction was presented by the proposed model. The EFONN, however, provided a more time-effective solution. Lastly, an explicit predictive formula was elicited from the WCANN.

• Structural Engineering and Mechanics
• /
• v.69 no.1
• /
• pp.21-31
• /
• 2019

Optimizing composite structures to exploit their maximum potential is a realistic application with promising returns. In this research, simultaneous maximization of the fundamental frequency and frequency separation between the first two modes by optimizing the fiber angles is considered. A high-fidelity design optimization methodology is developed by combining the high-accuracy of finite element method with iterative improvement capability of metaheuristic algorithms. Three powerful nature-inspired optimization algorithms viz. a genetic algorithm (GA), a particle swarm optimization (PSO) variant and a cuckoo search (CS) variant are used. Advanced memetic features are incorporated in the PSO and CS to form their respective variants-RPSOLC (repulsive particle swarm optimization with local search and chaotic perturbation) and CHP (co-evolutionary host-parasite). A comprehensive set of benchmark solutions on several new problems are reported. Statistical tests and comprehensive assessment of the predicted results show CHP comprehensively outperforms RPSOLC and GA, while RPSOLC has a little superiority over GA. Extensive simulations show that the on repeated trials of the same experiment, CHP has very low variability. About 50% fewer variations are seen in RPSOLC as compared to GA on repeated trials.