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

검색결과 174건 처리시간 0.026초

A Hybrid Metaheuristic for the Series-parallel Redundancy Allocation Problem in Electronic Systems of the Ship

  • Son, Joo-Young;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제35권3호
    • /
    • pp.341-347
    • /
    • 2011
  • The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

Mine 알고리즘 : 인간의 행동을 모방한 메타휴리스틱 (Mine Algorithm : A Metaheuristic Imitating The Action of The Human Being)

  • 고성범
    • 정보처리학회논문지B
    • /
    • 제16B권5호
    • /
    • pp.411-426
    • /
    • 2009
  • 대부분의 메타휴리스틱들은 동물의 행동을 모방한 것이다. 본 논문에서는 Mine 알고리즘을 제안한다. Mine 알고리즘(Mine Algorithm)은 인간의 행동을 모방한 메타휴리스틱이다. 탐색의 관점에서 인간의 노하우와 휴리스틱이 가장 잘 녹아 있는 업종은 광산업(mining industry)이다. Mine 알고리즘에서는 광산 업무에 초점을 맞추어서 인간의 행동패턴을 형식화한다. Mine 알고리즘은 다양한 탐색기법을 유연하게 구사하며, 그 때문에 광범위한 문제에서 고른 성능을 보인다. 즉, 범용성이 양호하다. 우리는 기존 메타휴리스틱들과의 비교 실험을 통하여 Mine 알고리즘의 개선된 범용성을 보인다.

Metaheuristic-reinforced neural network for predicting the compressive strength of concrete

  • Hu, Pan;Moradi, Zohre;Ali, H. Elhosiny;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • 제30권2호
    • /
    • pp.195-207
    • /
    • 2022
  • Computational drawbacks associated with regular predictive models have motivated engineers to use hybrid techniques in dealing with complex engineering tasks like simulating the compressive strength of concrete (CSC). This study evaluates the efficiency of tree potential metaheuristic schemes, namely shuffled complex evolution (SCE), multi-verse optimizer (MVO), and beetle antennae search (BAS) for optimizing the performance of a multi-layer perceptron (MLP) system. The models are fed by the information of 1030 concrete specimens (where the amount of cement, blast furnace slag (BFS), fly ash (FA1), water, superplasticizer (SP), coarse aggregate (CA), and fine aggregate (FA2) are taken as independent factors). The results of the ensembles are compared to unreinforced MLP to examine improvements resulted from the incorporation of the SCE, MVO, and BAS. It was shown that these algorithms can considerably enhance the training and prediction accuracy of the MLP. Overall, the proposed models are capable of presenting an early, inexpensive, and reliable prediction of the CSC. Due to the higher accuracy of the BAS-based model, a predictive formula is extracted from this algorithm.

Teaching-learning-based strategy to retrofit neural computing toward pan evaporation analysis

  • Rana Muhammad Adnan Ikram;Imran Khan;Hossein Moayedi;Loke Kok Foong;Binh Nguyen Le
    • Smart Structures and Systems
    • /
    • 제32권1호
    • /
    • pp.37-47
    • /
    • 2023
  • Indirect determination of pan evaporation (PE) has been highly regarded, due to the advantages of intelligent models employed for this objective. This work pursues improving the reliability of a popular intelligent model, namely multi-layer perceptron (MLP) through surmounting its computational knots. Available climatic data of Fresno weather station (California, USA) is used for this study. In the first step, testing several most common trainers of the MLP revealed the superiority of the Levenberg-Marquardt (LM) algorithm. It, therefore, is considered as the classical training approach. Next, the optimum configurations of two metaheuristic algorithms, namely cuttlefish optimization algorithm (CFOA) and teaching-learning-based optimization (TLBO) are incorporated to optimally train the MLP. In these two models, the LM is replaced with metaheuristic strategies. Overall, the results demonstrated the high competency of the MLP (correlations above 0.997) in the presence of all three strategies. It was also observed that the TLBO enhances the learning and prediction accuracy of the classical MLP (by nearly 7.7% and 9.2%, respectively), while the CFOA performed weaker than LM. Moreover, a comparison between the efficiency of the used metaheuristic optimizers showed that the TLBO is a more time-effective technique for predicting the PE. Hence, it can serve as a promising approach for indirect PE analysis.

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

  • Shima Bijari;Mojtaba Sheikhi Azqandi
    • Advances in Computational Design
    • /
    • 제8권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.

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

  • 유선용;박비호;김완태;조성준
    • 대한전자공학회논문지TC
    • /
    • 제46권5호
    • /
    • pp.26-35
    • /
    • 2009
  • OFDM (Orthogonal Frequency Division Multiplexing) 시스템은 주파수 선택적 페이딩 (frequency selective fading)과 협대역 간섭 (narrowband interference)에 강한 전송 방식으로 대용량 데이터 통신에 적합하다. 하지만 독립적으로 변조된 다수의 부반송파들이 동위상으로 중첩되면서 신호의 진폭이 증가하여 PAPR (Peak-to-Average Power Ratio)이 증가하는 문제가 발생한다. PAPR 문제를 해결하기 위해 제안된 위상회전 기법은 OFDM 신호에 위상 가중치를 곱하여 신호의 비선형 왜곡 없이 PAPR을 감소시킬 수 있지만, 위상 가중치를 탐색하는 과정에서 계산의 복잡도가 부블록 수에 따라 지수적으로 증가하는 단점이 있다. 따라서 위상회전 기법의 위상 탐색 과정에 계산의 복잡도를 감소시키면서 효율적으로 위상 가중치를 구할 수 있는 기술의 연구가 필요하다. 본 논문에서는 최적해를 구하기 위하여 사용되는 Metaheuristic 알고리즘을 위상탐색 과정에 적용하기 위한 모델링 과정을 제시하고 PTS 기법에 최적화함으로써 PAPR을 감소시키는 구조를 제안한다. 이 구조는 PTS 기법의 위상 탐색 과정에서 계산 복잡도가 지수적으로 증가하는 문제를 해결하고 PAPR 감소 성능도 보장할 수 있다. 제안하는 알고리즘을 통신 시스템에 적용하였을 때 PAPR 감소 효율을 시뮬레이션을 통해 분석했다.

Optimum cost design of RC columns using artificial bee colony algorithm

  • Ozturk, Hasan Tahsin;Durmus, Ahmet
    • Structural Engineering and Mechanics
    • /
    • 제45권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
    • /
    • 제38권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.

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

  • 최용호;이영훈;김지은
    • 한국군사과학기술학회지
    • /
    • 제20권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.