원문정보
초록
영어
Optimal sensor placement (OSP) techniques are of vital importance for the monitoring of large-scale structures or complex mechanical systems. In order to overcome the defects of slow convergence speed and easily falling into local optimum in monkey algorithm (MA), a new MA, called chaotic monkey algorithm (CMA), is proposed by introducing chaos search strategy to implement the OSP. In this algorithm, the initial monkeys are generated by using chaos variable and binary coding to enhance the global search capability, and a greedy strategy is adopted to improve the efficiency of local search. Numerical experiments are conducted on the sensor placement of a suspension bridge. The results verify that the new CMA can solve the OSP problem well and has better search capability than MA.
목차
1. Introduction
2. Mathematical Model of A Suspension Bridge
2.1. Finite Element Model
2.2. Mathematical Model
3. Chaos Monkey Algorithm
3.1. Binary Coding
3.2. Initialization
3.3 Climb Process
3.4 Watch-Jump Process
3.5 Somersault Process
4. Analysis of the Results
5. Conclusions
References