• Title/Summary/Keyword: meta-heuristic optimization algorithm

Search Result 123, Processing Time 0.029 seconds

Secant Method for Economic Dispatch with Generator Constraints and Transmission Losses

  • Chandram, K.;Subrahmanyam, N.;Sydulu, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.3 no.1
    • /
    • pp.52-59
    • /
    • 2008
  • This paper describes the secant method for solving the economic dispatch (ED) problem with generator constraints and transmission losses. The ED problem is an important optimization problem in the economic operation of a power system. The proposed algorithm involves selection of minimum and maximum incremental costs (lambda values) and then the evaluation of optimal lambda at required power demand is done by secant method. The proposed algorithm has been tested on a power system having 6, 15, and 40 generating units. Studies have been made on the proposed method to solve the ED problem by taking 120 and 200 units with generator constraints. Simulation results of the proposed approach were compared in terms of solution quality, convergence characteristics, and computation efficiency with conventional methods such as lambda iterative method, heuristic methods such as genetic algorithm, and meta-heuristic methods like particle swarm optimization. It is observed from different case studies that the proposed method provides qualitative solutions with less computational time compared to various methods available in the literature.

Solving the Constrained Job Sequencing Problem using Candidate Order based Tabu Search (후보순위 기반 타부 서치를 이용한 제약 조건을 갖는 작업 순서결정 문제 풀이)

  • Jeong, Sung-Wook;Kim, Jun-Woo
    • The Journal of Information Systems
    • /
    • v.25 no.1
    • /
    • pp.159-182
    • /
    • 2016
  • Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

A multi-objective decision making model based on TLBO for the time - cost trade-off problems

  • Eirgash, Mohammad A.;Togan, Vedat;Dede, Tayfun
    • Structural Engineering and Mechanics
    • /
    • v.71 no.2
    • /
    • pp.139-151
    • /
    • 2019
  • In a project schedule, it is possible to reduce the time required to complete a project by allocating extra resources for critical activities. However, accelerating a project causes additional expense. This issue is addressed by finding optimal set of time-cost alternatives and is known as the time-cost trade-off problem in the literature. The aim of this study is to identify the optimal set of time-cost alternatives using a multiobjective teaching-learning-based optimization (TLBO) algorithm integrated with the non-dominated sorting concept and is applied to successfully optimize the projects ranging from a small to medium large projects. Numerical simulations indicate that the utilized model searches and identifies optimal / near optimal trade-offs between project time and cost in construction engineering and management. Therefore, it is concluded that the developed TLBO-based multiobjective approach offers satisfactorily solutions for time-cost trade-off optimization problems.

Harmony Search Algorithm-Based Approach For Discrete Size Optimization of Truss Structures

  • Lee Kang-Seok;Kim Jeong-Hee;Choi Chang-Sik;Lee Li-Hyung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2005.04a
    • /
    • pp.351-358
    • /
    • 2005
  • Many methods have been developed and are in use for structural size optimization problems, In which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary In this paper, a discrete search strategy using the HS algorithm is presented in detail and its effectiveness and robustness, as compared to current discrete optimization methods, are demonstrated through a standard truss example. The numerical results reveal that the proposed method is a powerful search and design optimization tool for structures with discrete-sized members, and may yield better solutions than those obtained using current method.

  • PDF

Optimal design of double layer barrel vaults considering nonlinear behavior

  • Gholizadeh, Saeed;Gheyratmand, Changiz;Davoudi, Hamed
    • Structural Engineering and Mechanics
    • /
    • v.58 no.6
    • /
    • pp.1109-1126
    • /
    • 2016
  • The present paper focuses on size optimization of double layer barrel vaults considering nonlinear behavior. In order to tackle the optimization problem an improved colliding bodies optimization (ICBO) algorithm is proposed. The important task that should be achieved before optimization of structural systems is to determine the best form having the least cost. In this study, an attempt is done to find the best form then it is optimized considering linear and non-linear behaviors. In the optimization process based on nonlinear behavior, the geometrical and material nonlinearity effects are included. A large-scale double layer barrel vault is presented as the numerical example of this study and the obtained results indicate that the proposed ICBO has better computational performance compared with other algorithms.

Subspace search mechanism and cuckoo search algorithm for size optimization of space trusses

  • Kaveh, A.;Bakhshpoori, T.
    • Steel and Composite Structures
    • /
    • v.18 no.2
    • /
    • pp.289-303
    • /
    • 2015
  • This study presents a strategy so-called Subspace Search Mechanism (SSM) for reducing the computational time for convergence of population based metaheusristic algorithms. The selected metaheuristic for this study is the Cuckoo Search algorithm (CS) dealing with size optimization of trusses. The complexity of structural optimization problems can be partially due to the presence of high-dimensional design variables. SSM approach aims to reduce dimension of the problem. Design variables are categorized to predefined groups (subspaces). SSM focuses on the multiple use of the metaheuristic at hand for each subspace. Optimizer updates the design variables for each subspace independently. Updating rules require candidate designs evaluation. Each candidate design is the assemblage of responsible set of design variables that define the subspace of interest. SSM is incorporated to the Cuckoo Search algorithm for size optimizing of three small, moderate and large space trusses. Optimization results indicate that SSM enables the CS to work with less number of population (42%), as a result reducing the time of convergence, in exchange for some accuracy (1.5%). It is shown that the loss of accuracy can be lessened with increasing the order of complexity. This suggests its applicability to other algorithms and other complex finite element-based engineering design problems.

Harmony search algorithm and its application to optimization problems in civil and water resources engineering (화음탐색법과 토목 및 수자원공학 최적화문제에의 적용)

  • Kim, Joong Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.4
    • /
    • pp.281-291
    • /
    • 2018
  • Harmony search algorithm (HSA), developed by Hydrosystem lab. in Korea University in 2001, was a new meta-heuristic optimization algorithm inspired by the iterative improvision process of Jazz music players where the best harmony is eventually produced. HSA is now one of the most well-known meta-heuristic algorithms (as proven by its cited number of the first published paper more than 3,600 times as of January 11th 2018 based on Google Scholar citation) and has been applied to diverse research domains such as not only water resources and civil engineering but also in medical science, business, and humanities. This paper is a review article written with the wish for wider application of HSA and other optimization algorithms, especially in the domain of water resources engineering. Therefore, this paper first briefly introduces the mechanism and operators of HSA and then reviews its application area and citation frequency per research domain. In addition, recent globalization of HSA will be investigated and summarized by checking the current status of related international conferences and on-going research projects. After reviewing previous domestic papers with optimization algorithms specifically published in the water resources domain, this paper is finalized by delivering some suggestions to encourage the application of optimization algorithms including HSA.

Optimal design of pitched roof frames with tapered members using ECBO algorithm

  • Kaveh, Ali;Mahdavi, Vahid Reza;Kamalinejad, Mohammad
    • Smart Structures and Systems
    • /
    • v.19 no.6
    • /
    • pp.643-652
    • /
    • 2017
  • Pitched roof frames are widely used in construction of the industrial buildings, gyms, schools and colleges, fire stations, storages, hangars and many other low rise structures. The weight and shape of the gable frames with tapered members, as a familiar group of the pitched roof frames, are highly dependent on the properties of the member cross-sectional. In this work Enhanced Colliding Bodies Optimization (ECBO) is utilized for optimal design of three gable frames with tapered members. In order to optimize the frames, the design is performed using the AISC specifications for stress, displacement and stability constraints. The design constraints and weight of the gable frames are computed from the cross-section of members. These optimum weights are obtained using aforementioned optimization algorithms considering the cross-sections of the members and design constraints as optimization variables and constraints, respectively. A comparative study of the PSO and CBO with ECBO is also performed to illustrate the importance of the enhancement of the utilized optimization algorithm.

A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System (직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.2
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

A TSK fuzzy model optimization with meta-heuristic algorithms for seismic response prediction of nonlinear steel moment-resisting frames

  • Ebrahim Asadi;Reza Goli Ejlali;Seyyed Arash Mousavi Ghasemi;Siamak Talatahari
    • Structural Engineering and Mechanics
    • /
    • v.90 no.2
    • /
    • pp.189-208
    • /
    • 2024
  • Artificial intelligence is one of the efficient methods that can be developed to simulate nonlinear behavior and predict the response of building structures. In this regard, an adaptive method based on optimization algorithms is used to train the TSK model of the fuzzy inference system to estimate the seismic behavior of building structures based on analytical data. The optimization algorithm is implemented to determine the parameters of the TSK model based on the minimization of prediction error for the training data set. The adaptive training is designed on the feedback of the results of previous time steps, in which three training cases of 2, 5, and 10 previous time steps were used. The training data is collected from the results of nonlinear time history analysis under 100 ground motion records with different seismic properties. Also, 10 records were used to test the inference system. The performance of the proposed inference system is evaluated on two 3 and 20-story models of nonlinear steel moment frame. The results show that the inference system of the TSK model by combining the optimization method is an efficient computational method for predicting the response of nonlinear structures. Meanwhile, the multi-vers optimization (MVO) algorithm is more accurate in determining the optimal parameters of the TSK model. Also, the accuracy of the results increases significantly with increasing the number of previous steps.