• 제목/요약/키워드: heuristic optimization algorithms

검색결과 188건 처리시간 0.023초

Weight optimization of coupling with bolted rim using metaheuristics algorithms

  • Mubina Nancy;S. Elizabeth Amudhini Stephen
    • Coupled systems mechanics
    • /
    • 제13권1호
    • /
    • pp.1-19
    • /
    • 2024
  • The effectiveness of coupling with a bolted rim is assessed in this research using a newly designed optimization algorithm. The current study, which is provided here, evaluates 10 contemporary metaheuristic approaches for enhancing the coupling with bolted rim design problem. The algorithms used are particle swarm optimization (PSO), crow search algorithm (CSA), enhanced honeybee mating optimization (EHBMO), Harmony search algorithm (HSA), Krill heard algorithm (KHA), Pattern search algorithm (PSA), Charged system search algorithm (CSSA), Salp swarm algorithm (SSA), Big bang big crunch optimization (B-BBBCO), Gradient based Algorithm (GBA). The contribution of the paper isto optimize the coupling with bolted rim problem by comparing these 10 algorithms and to find which algorithm gives the best optimized result. These algorithm's performance is evaluated statistically and subjectively.

자원제약 프로젝트 스케쥴링 문제에 적용 가능한 부분 최적화 방법들의 성능 분석 (Performance Analysis of Local Optimization Algorithms in Resource-Constrained Project Scheduling Problem)

  • 임동순
    • 대한산업공학회지
    • /
    • 제37권4호
    • /
    • pp.408-414
    • /
    • 2011
  • The objective of this paper is to define local optimization algorithms (LOA) to solve Resource-Constrained Project Scheduling Problem (RCPSP) and analyze the performance of these algorithms. By representing solutions with activity list, three primitive LOAs, i.e. forward and backward improvement-based, exchange-based, and relocation-based LOAs are defined. Also, combined LOAs integrating two primitive LOAs are developed. From the experiments with standard test set J120 generated using ProGen, the FBI-based LOA demonstrates to be an efficient algorithm. Moreover, algorithms combined with FBI-based LOA and other LOA generate good solutions in general. Among the considered algorithms, the combined algorithm of FBI-based and exchangebased shows best performance in terms of solution quality and computation time.

구속조건의 효율적인 처리를 위한 유전자 알고리즘의 개발 (Development of Genetic Algorithms for Efficient Constraints Handling)

  • 조영석;최동훈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집A
    • /
    • pp.725-730
    • /
    • 2000
  • Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.

  • PDF

Design of multi-span steel box girder using lion pride optimization algorithm

  • Kaveh, A.;Mahjoubi, S.
    • Smart Structures and Systems
    • /
    • 제20권5호
    • /
    • pp.607-618
    • /
    • 2017
  • In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution

  • Zhang, Yan;Wu, Tengyu;Ding, Xiaoyue
    • Journal of Information Processing Systems
    • /
    • 제18권5호
    • /
    • pp.665-676
    • /
    • 2022
  • In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved.

외판원문제에 대한 효율적인 새로운 경험적 방법 개발 (A New Heuristic Algorithm for Traveling Salesman Problems)

  • 백시현;김내헌
    • 산업경영시스템학회지
    • /
    • 제22권51호
    • /
    • pp.21-28
    • /
    • 1999
  • The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.

  • PDF

Analysis of trusses by total potential optimization method coupled with harmony search

  • Toklu, Yusuf Cengiz;Bekdas, Gebrail;Temur, Rasim
    • Structural Engineering and Mechanics
    • /
    • 제45권2호
    • /
    • pp.183-199
    • /
    • 2013
  • Current methods of analysis of trusses depend on matrix formulations based on equilibrium equations which are in fact derived from energy principles, and compatibility conditions. Recently it has been shown that the minimum energy principle, by itself, in its pure and unmodified form, can well be exploited to analyze structures when coupled with an optimization algorithm, specifically with a meta-heuristic algorithm. The resulting technique that can be called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) has already been applied to analyses of linear and nonlinear plane trusses successfully as coupled with simulated annealing and local search algorithms. In this study the technique is applied to both 2-dimensional and 3-dimensional trusses emphasizing robustness, reliability and accuracy. The trials have shown that the technique is robust in two senses: all runs result in answers, and all answers are acceptable as to the reliability and accuracy within the prescribed limits. It has also been shown that Harmony Search presents itself as an appropriate algorithm for the purpose.

군집지능과 모델개선기법을 이용한 구조물의 결함탐지 (Structural Damage Detection Using Swarm Intelligence and Model Updating Technique)

  • 최종헌;고봉환
    • 한국소음진동공학회논문집
    • /
    • 제19권9호
    • /
    • pp.884-891
    • /
    • 2009
  • This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.

Multi Case Non-Convex Economic Dispatch Problem Solving by Implementation of Multi-Operator Imperialist Competitive Algorithm

  • Eghbalpour, Hamid;Nabatirad, Mohammadreza
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권4호
    • /
    • pp.1417-1426
    • /
    • 2017
  • Power system analysis, Non-Convex Economic Dispatch (NED) is considered as an open and demanding optimization problem. Despite the fact that realistic ED problems have non-convex cost functions with equality and inequality constraints, conventional search methods have not been able to effectively find the global answers. Considering the great potential of meta-heuristic optimization techniques, many researchers have started applying these techniques in order to solve NED problems. In this paper, a new and efficient approach is proposed based on imperialist competitive algorithm (ICA). The proposed algorithm which is named multi-operator ICA (MuICA) merges three operators with the original ICA in order to simultaneously avoid the premature convergence and achieve the global optimum answer. In this study, the proposed algorithm has been applied to different test systems and the results have been compared with other optimization methods, tending to study the performance of the MuICA. Simulation results are the confirmation of superior performance of MuICA in solving NED problems.

Optimum design of cantilever retaining walls under seismic loads using a hybrid TLBO algorithm

  • Temur, Rasim
    • Geomechanics and Engineering
    • /
    • 제24권3호
    • /
    • pp.237-251
    • /
    • 2021
  • The main purpose of this study is to investigate the performance of the proposed hybrid teaching-learning based optimization algorithm on the optimum design of reinforced concrete (RC) cantilever retaining walls. For this purpose, three different design examples are optimized with 100 independent runs considering continuous and discrete variables. In order to determine the algorithm performance, the optimization results were compared with the outcomes of the nine powerful meta-heuristic algorithms applied to this problem, previously: the big bang-big crunch (BB-BC), the biogeography based optimization (BBO), the flower pollination (FPA), the grey wolf optimization (GWO), the harmony search (HS), the particle swarm optimization (PSO), the teaching-learning based optimization (TLBO), the jaya (JA), and Rao-3 algorithms. Moreover, Rao-1 and Rao-2 algorithms are applied to this design problem for the first time. The objective function is defined as minimizing the total material and labor costs including concrete, steel, and formwork per unit length of the cantilever retaining walls subjected to the requirements of the American Concrete Institute (ACI 318-05). Furthermore, the effects of peak ground acceleration value on minimum total cost is investigated using various stem height, surcharge loads, and backfill slope angle. Finally, the most robust results were obtained by HTLBO with 50 populations. Consequently the optimization results show that, depending on the increase in PGA value, the optimum cost of RC cantilever retaining walls increases smoothly with the stem height but increases rapidly with the surcharge loads and backfill slope angle.