A flexibility method for structural damage identification using continuous ant colony optimization

2015 ◽  
Vol 11 (2) ◽  
pp. 186-201 ◽  
Author(s):  
Maryam Daei ◽  
S. Hamid Mirmohammadi
Keyword(s):  
Experimental Data ◽  
Damage Detection ◽  
Ant Colony Optimization ◽  
Structural Damage ◽  
Optimization Problem ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Computational Time ◽  
Content Type ◽  
Flexibility Matrix

Purpose – The interest in the ability to detect damage at the earliest possible stage is pervasive throughout the civil engineering over the last two decades. In general, the experimental techniques for damage detection are expensive and require that the vicinity of the damage is known and readily accessible; therefore several methods intend to detect damage based on numerical model and by means of minimum experimental data about dynamic properties or response of damaged structures. The paper aims to discuss these issues. Design/methodology/approach – In this paper, the damage detection problem is formulated as an optimization problem such as to obtain the minimum difference between the numerical and experimental variables, and then a modified ant colony optimization (ACO) algorithm is proposed for solving this optimization problem. In the proposed algorithm, the structural damage is detected by using dynamically measured flexibility matrix, since the flexibility matrix of the structure can be estimated from only the first few modes. The continuous version of ACO is employed as a probabilistic technique for solving this computational problem. Findings – Compared to classical methods, one of the main strengths of this meta-heuristic method is the generally better robustness in achieving global optimum. The efficiency of the proposed algorithm is illustrated by numerical examples. The proposed method enables the deduction of the extent and location of structural damage, while using short computational time and resulting good accuracy. Originality/value – Finding accurate results by means of minimum experimental data, while using short computational time is the final goal of all researches in the structural damage detection methods. In this paper, it gains by applying flexibility matrix in the definition of objective function, and also via using continuous ant colony algorithm as a powerful meta-heuristic techniques in the constrained nonlinear optimization problem.

Ant Colony Algorithm for Two Stage Supply Chain

2014 ◽  
pp. 143-155
Author(s):  
R. Sridharan ◽  
Vinay V. Panicker
Keyword(s):  
Supply Chain ◽  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Transportation Cost ◽  
Allocation Problem ◽  
Ant Colony ◽  
Computational Time ◽  
Fixed Cost ◽  
Two Stage ◽  
Transportation Routes

This chapter focuses on the distribution-allocation problem with fixed cost for transportation routes in a two-stage supply chain. The supply chain considered in this research consists of suppliers, distributors and customers. Each transportation route is associated with a fixed charge (or a fixed cost) and a transportation cost per unit transported. The presence of this fixed cost makes the problem difficult to solve. This motivates the researchers to develop heuristics based on non-traditional optimization techniques that can provide near-optimal solutions in reasonable time. In this research, an ant colony optimization based heuristic is proposed to solve a distribution-allocation problem with fixed cost for transportation routes in a two-stage supply chain. The comparative analysis carried out in this study reveals that the solutions obtained using proposed heuristic are better than those obtained using an existing heuristic in terms of total cost and computational time. In addition, special emphasis is placed in developing heuristics based on ant colony optimization for solving supply chain related problems and identifying opportunities for further research in this area.

FEM Free Damage Detection of Beam Structures Using the Deflections Estimated by Modal Flexibility Matrix

2021 ◽  
pp. 2150128
Author(s):  
Wen-Yu He ◽  
Wei-Xin Ren ◽  
Lei Cao ◽  
Quan Wang
Keyword(s):  
Damage Detection ◽  
Structural Damage ◽  
Damage Index ◽  
Element Model ◽  
Mode Shapes ◽  
Beam Structures ◽  
Flexibility Matrix ◽  
Damage Quantification ◽  
Modal Flexibility ◽  
The Cost

The deflection of the beam estimated from modal flexibility matrix (MFM) indirectly is used in structural damage detection due to the fact that deflection is less sensitive to experimental noise than the element in MFM. However, the requirement for mass-normalized mode shapes (MMSs) with a high spatial resolution and the difficulty in damage quantification restricts the practicability of MFM-based deflection damage detection. A damage detection method using the deflections estimated from MFM is proposed for beam structures. The MMSs of beams are identified by using a parked vehicle. The MFM is then formulated to estimate the positive-bending-inspection-load (PBIL) caused deflection. The change of deflection curvature (CDC) is defined as a damage index to localize damage. The relationship between the damage severity and the deflection curvatures is further investigated and a damage quantification approach is proposed accordingly. Numerical and experimental examples indicated that the presented approach can detect damages with adequate accuracy at the cost of limited number of sensors. No finite element model (FEM) is required during the whole detection process.

scholarly journals ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM

2011 ◽  
Vol 1 (1) ◽  
pp. 88-92
Author(s):  
Pallavi Arora ◽  
Harjeet Kaur ◽  
Prateek Agrawal
Keyword(s):  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Optimization Problem ◽  
Traditional Approach ◽  
Combinatorial Optimization Problem ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Analysis And Synthesis ◽  
Heuristic Technique ◽  
Travelling Salesperson Problem

Ant Colony optimization is a heuristic technique which has been applied to a number of combinatorial optimization problem and is based on the foraging behavior of the ants. Travelling Salesperson problem is a combinatorial optimization problem which requires that each city should be visited once. In this research paper we use the K means clustering technique and Enhanced Ant Colony Optimization algorithm to solve the TSP problem. We show a comparison of the traditional approach with the proposed approach. The simulated results show that the proposed algorithm is better compared to the traditional approach.

scholarly journals Mobile Robot Path Planning in an Obstacle-free Static Environment using Multiple Optimization Algorithms

2020 ◽  
Vol 17 (3) ◽  
pp. 165-173
Author(s):  
C.O. Yinka-Banjo ◽  
U. Agwogie
Keyword(s):  
Mobile Robot ◽  
Ant Colony Optimization ◽  
Optimal Path ◽  
Fruit Fly ◽  
Convergence Speed ◽  
Ant Colony ◽  
Computational Time ◽  
Robot Path Planning ◽  
Nature Inspired Algorithms ◽  
Robot Path

This article presents the implementation and comparison of fruit fly optimization (FOA), ant colony optimization (ACO) and particle swarm optimization (PSO) algorithms in solving the mobile robot path planning problem. FOA is one of the newest nature-inspired algorithms while PSO and ACO has been in existence for a long time. PSO has been shown by other studies to have long search time while ACO have fast convergence speed. Therefore there is need to benchmark FOA performance with these older nature-inspired algorithms. The objective is to find an optimal path in an obstacle free static environment from a start point to the goal point using the aforementioned techniques. The performance of these algorithms was measured using three criteria: average path length, average computational time and average convergence speed. The results show that the fruit fly algorithm produced shorter path length (19.5128 m) with faster convergence speed (3149.217 m/secs) than the older swarm intelligence algorithms. The computational time of the algorithms were in close range, with ant colony optimization having the minimum (0.000576 secs). Keywords:  Swarm intelligence, Fruit Fly algorithm, Ant Colony Optimization, Particle Swarm Optimization, optimal path, mobile robot.

Ant Colony Optimization and Multiple Knapsack Problem

2007 ◽  
pp. 498-509 ◽  
Author(s):  
S. Fidanova
Keyword(s):  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Knapsack Problem ◽  
Optimization Problem ◽  
Combinatorial Optimization Problem ◽  
Ant Colony ◽  
Multiple Knapsack Problem ◽  
Constraint Problem ◽  
Multiple Knapsack ◽  
Ant Colony Optimization Algorithms

The ant colony optimization algorithms and their applications on the multiple knapsack problem (MKP) are introduced. The MKP is a hard combinatorial optimization problem with wide application. Problems from different industrial fields can be interpreted as a knapsack problem including financial and other management. The MKP is represented by a graph, and solutions are represented by paths through the graph. Two pheromone models are compared: pheromone on nodes and pheromone on arcs of the graph. The MKP is a constraint problem which provides possibilities to use varied heuristic information. The purpose of the chapter is to compare a variety of heuristic and pheromone models and different variants of ACO algorithms on MKP.

scholarly journals Damaged Flexibility Matrix Method for Damage Detection of Frame Buildings

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Luis S. Vaca Oyola ◽  
Mónica R. Jaime Fonseca ◽  
Ramsés Rodríguez Rocha
Keyword(s):  
Damage Detection ◽  
Matrix Method ◽  
Structural Damage ◽  
Numerical Models ◽  
Structural Elements ◽  
Structural Element ◽  
New Approach ◽  
Building Model ◽  
Flexibility Matrix ◽  
Frame Buildings

This study presents the damaged flexibility matrix method (DFM) to identify and determine the magnitude of damage in structural elements of plane frame buildings. Damage is expressed as the increment in flexibility along the damaged structural element. This method uses a new approach to assemble the flexibility matrix of the structure through an iterative process, and it adjusts the eigenvalues of the damaged flexibility matrices of each system element. The DFM was calibrated using numerical models of plane frames of buildings studied by other authors. The advantage of the DFM, with respect to other flexibility-based methods, is that DFM minimizes the adverse effect of modal truncation. The DFM demonstrated excellent accuracy with complete modal information, even when it was applied to a more realistic scenario, considering frequencies and modal shapes measured from the recorded accelerations of buildings stories. The DFM also presents a new approach to simulate the effects of noise by perturbing matrices of flexibilities. This approach can be useful for research on realistic damage detection. The combined effects of incomplete modal information and noise were studied in a ten-story four-bay building model taken from the literature. The ability of the DFM to assess structural damage was corroborated. Application of the proposed method to a ten-story four-bay building model demonstrates its efficiency to identify the flexibility increment in damaged structural elements.

Sign in / Sign up

Export Citation Format

Share Document