년 - 년
Chaotic Monkey Algorithm Based Optimal Sensor Placement SCOPUS
보안공학연구지원센터(IJCA) International Journal of Control and Automation Vol.9 No.1 2016.01 pp.423-434
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
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.
A hybrid Genetic-Monkey Algorithm for the Vehicle Routing Problem
보안공학연구지원센터(IJHIT) International Journal of Hybrid Information Technology Vol.9 No.1 2016.01 pp.397-404
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
The vehicle routing problem (VRP) is one of the most challenging problems in the op-timization of distribution. Genetic algorithm (GA) has been proved capable of solving VRPs. However, the resolution effectiveness of GA decreases with the increase of nodes within VRPs. It often appears premature convergence or poor ability of local search. In this paper, a hybrid genetic-monkey algorithm (HGMA), integrating monkey algorithm (MA) into genetic algorithm framework, is proposed to overcome the shortcomings above. Monkey climbing (A novel climb process is designed for VRP with discrete variables.) and somersault processes improve ability of local and global search. Furthermore, flexi-ble fitness function, through which infeasible solutions are allowed, are developed to ex-pand the search space. The experiment results indicate efficiency of the proposed algorithm.
Research of Software’s Detection Data Generation Based on Improved Monkey Algorithm SCOPUS
보안공학연구지원센터(IJDTA) International Journal of Database Theory and Application Vol.9 No.3 2016.03 pp.73-80
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
Health monitoring sensor placement optimization for Canton Tower using virus monkey algorithm
[Kisti 연계] 테크노프레스 Smart structures and systems Vol.15 No.5 2015 pp.1373-1392
※ 협약을 통해 무료로 제공되는 자료로, 원문이용 방식은 연계기관의 정책을 따르고 있습니다.
Placing sensors at appropriate locations is an important task in the design of an efficient structural health monitoring (SHM) system for a large-scale civil structure. In this paper, a hybrid optimization algorithm called virus monkey algorithm (VMA) based on the virus theory of evolution is proposed to seek the optimal placement of sensors. Firstly, the dual-structure coding method is adopted instead of binary coding method to code the solution. Then, the VMA is designed to incorporate two populations, a monkey population and a virus population, enabling the horizontal propagation between the monkey and virus individuals and the vertical inheritance of monkey's position information from the previous to following position. Correspondingly, the monkey population in this paper is divided into the superior and inferior monkey populations, and the virus population is divided into the serious and slight virus populations. The serious virus is used to infect the inferior monkey to make it escape from the local optima, while the slight virus is adopted to infect the superior monkey to let it find a better result in the nearby area. This kind of novel virus infection operator enables the coevolution of monkey and virus populations. Finally, the effectiveness of the proposed VMA is demonstrated by designing the sensor network of the Canton Tower, the tallest TV Tower in China. Results show that innovations in the VMA proposed in this paper can improve the convergence of algorithm compared with the original monkey algorithm (MA).
0개의 논문이 장바구니에 담겼습니다.
선택하신 파일을 압축중입니다.
잠시만 기다려 주십시오.