Moving Force Identification Based on Firefly Algorithm

2014 ◽  
Vol 919-921 ◽  
pp. 329-333 ◽  
Author(s):  
Chu Dong Pan ◽  
Ling Yu
Keyword(s):  
Firefly Algorithm ◽  
Optimization Problem ◽  
Structural Response ◽  
Strain Sensor ◽  
Constrained Optimization Problem ◽  
Force Identification ◽  
Moving Force ◽  
Structural Responses ◽  
Novel Method ◽  
Truss Bridge

Based on firefly algorithm (FA), a novel method is proposed for moving force identification (MFI) in this paper. The basic principle of FA is introduced, some key parameters, such as light intensity, attractiveness, and the rules of movement are defined. The inverse problem on MFI is transformed into a constrained optimization problem and then can be hopefully solved by FA. In order to assess the accuracy and the feasibility of the proposed method, a beam-like truss bridge subjected to moving forces is taken an example for numerical simulation. The robustness of the method is also evaluated by adding noise into the structural responses. The illustrated results show that the proposed method can accurately identify two moving forces from incomplete structural response at only one strain sensor with stronger robustness.

Force identification under unknown initial conditions by using concomitant mapping matrix and sparse regularization

2020 ◽  
pp. 107754632094469
Author(s):  
Xijun Ye ◽  
Chudong Pan
Keyword(s):  
Optimization Problem ◽  
Initial Conditions ◽  
Sparse Regularization ◽  
Force Identification ◽  
Moving Force ◽  
Dynamic Forces ◽  
Force Reconstruction ◽  
Structural Responses ◽  
One Step ◽  
Regularization Strategy

Unknown initial conditions can affect the identified accuracy of dynamic forces. Direct measurement of initial conditions is relatively difficult. This study proposes a sparse regularization–based method for identifying forces considering influences of unknown initial conditions. The initial conditions are embedded in a classical governing equation of force identification. The key idea is to introduce a concept of concomitant mapping matrix for reasonably expressing the initial conditions. First, a dictionary is introduced for expanding the dynamic forces. Then, the concomitant mapping matrix is formulated by using free vibrating responses, which correspond to structural responses happening after the structure is subjected to each atom of the force dictionary. A sparse regularization strategy is applied for solving the ill-conditioned equation. After that, the problem of force identification is converted into an optimization problem, and it can be solved by using a one-step strategy. Numerical simulations are carried out for verifying the feasibility and effectiveness of the proposed method. Illustrated results clearly show the applicability and robustness of the proposed method for dealing with force reconstruction and moving force identification.

Hybrid firefly algorithm with grouping attraction for constrained optimization problem

2021 ◽  
pp. 106937
Author(s):  
Zhiwen Cheng ◽  
Haohao Song ◽  
Jiquan Wang ◽  
Hongyu Zhang ◽  
Tiezhu Chang ◽  
...  
Keyword(s):  
Constrained Optimization ◽  
Firefly Algorithm ◽  
Optimization Problem ◽  
Constrained Optimization Problem ◽  
Hybrid Firefly Algorithm

scholarly journals Nonconvex constrained optimization by a filtering branch and bound

2020 ◽  
Author(s):  
Gabriele Eichfelder ◽  
Kathrin Klamroth ◽  
Julia Niebling
Keyword(s):  
Constrained Optimization ◽  
Optimization Problem ◽  
Feasible Solution ◽  
Constrained Optimization Problem ◽  
Numerical Tests ◽  
Nonconvex Constrained Optimization ◽  
Objective Value ◽  
Feasible Solutions ◽  
Quality Guarantee ◽  
Single Objective

AbstractA major difficulty in optimization with nonconvex constraints is to find feasible solutions. As simple examples show, the $$\alpha $$ α BB-algorithm for single-objective optimization may fail to compute feasible solutions even though this algorithm is a popular method in global optimization. In this work, we introduce a filtering approach motivated by a multiobjective reformulation of the constrained optimization problem. Moreover, the multiobjective reformulation enables to identify the trade-off between constraint satisfaction and objective value which is also reflected in the quality guarantee. Numerical tests validate that we indeed can find feasible and often optimal solutions where the classical single-objective $$\alpha $$ α BB method fails, i.e., it terminates without ever finding a feasible solution.

Moving force identification based on redundant concatenated dictionary and weighted l1-norm regularization

2018 ◽  
Vol 98 ◽  
pp. 32-49 ◽  
Author(s):  
Chu-Dong Pan ◽  
Ling Yu ◽  
Huan-Lin Liu ◽  
Ze-Peng Chen ◽  
Wen-Feng Luo
Keyword(s):  
L1 Norm ◽  
Force Identification ◽  
Moving Force

Test Data Generation and Selection Using Levy Flight-Based Firefly Algorithm

2021 ◽  
Vol 9 (2) ◽  
pp. 18-34
Author(s):  
Abhishek Pandey ◽  
Soumya Banerjee
Keyword(s):  
Test Data ◽  
Firefly Algorithm ◽  
Optimization Problem ◽  
Structural Testing ◽  
Software Test ◽  
Testing Time ◽  
Test Data Generation ◽  
Data Generation ◽  
Test Suite Optimization ◽  
Test Optimization

This article discusses the application of an improved version of the firefly algorithm for the test suite optimization problem. Software test optimization refers to optimizing test data generation and selection for structural testing criteria for white box testing. This will subsequently reduce the two most costly activities performed during testing: time and cost. Recently, various search-based approaches proved very interesting results for the software test optimization problem. Also, due to no free lunch theorem, scientists are continuously searching for more efficient and convergent methods for the optimization problem. In this paper, firefly algorithm is modified in a way that local search ability is improved. Levy flights are incorporated into the firefly algorithm. This modified algorithm is applied to the software test optimization problem. This is the first application of Levy-based firefly algorithm for software test optimization. Results are shown and compared with some existing metaheuristic approaches.

Sign in / Sign up

Export Citation Format

Share Document