Optical nonlinear enhancement from binary optimization of plasmonic nano-bi-domes

2016 ◽  
Vol 25 (02) ◽  
pp. 1650018 ◽  
Author(s):  
Milad Kaboli ◽  
Majid Akhlaghi

Here, we theoretically suggest the possibility of optical nonlinear enhancement by employing the binary optimization of plasmonic nano-bi-domes. Since the nonlinear coefficient depends strongly on the number of plasmonic nanoparticles and the nanoparticles location, binary particle swarm optimization (BPSO) algorithm is proposed to design an optimized array of the plasmonic nano-bi-domes in order to achieve the maximum nonlinear coefficient in the optical frequency. In BPSO, a swarm consists of a matrix with binary entries, control the presence (‘1’) or the absence (‘0’) of nano-bi-domes in the array. It is shown that the interaction between six nano-bi-domes leads to a very strong amplification of the Electro Magnetic (EM) fields inside and in the near-field range outside the particles. Correspondingly, such systems exhibit strong resonance peaks in the nonlinear coefficient spectrum.

2017 ◽  
Vol 14 (1) ◽  
pp. 670-684 ◽  
Author(s):  
Mehmet Akif Sahman ◽  
Adem Alpaslan Altun ◽  
Abdullah Oktay Dündar

Recently, many Computational-Intelligence algorithms have been proposed for solving continuous problem. The Differential Search Algorithm (DSA), a computational-intelligence based algorithm inspired by the migration movements of superorganisms, is developed to solve continuous problems. However, DSA proposed for solving problems with continuous search space proposed for solving should be modified for solving binary structured problems. When the DSA is intended for use in binary problems, continuous variables need to be converted into binary format due to solution space structure of this type of problem. In this study, the DSA is modified to solve binary optimization problems by using a conversion approach from continuous values to binary values. The new algorithm has been designated as the binary DSA or BDSA for short. First, when finding donors with the BDSA, four search methods (Bijective, Surjective, Elitist1 and Elitist2) with different iteration numbers are used and tested on 15 UFLP benchmark problems. The Elitist2 approach, which provides the best solution of the four methods, is used in the BDSA, and the results are compared with Continuous Particle Swarm Optimization (CPSO), Continuous Artificial Bee Colony (ABCbin), Improved Binary Particle Swarm Optimization (IBPSO), Binary Artificial Bee Colony (binABC) and Discrete Artificial Bee Colony (DisABC) algorithms using UFLP benchmark problems. Results from the tests and comparisons show that the BDSA is fast, effective and robust for binary optimization.


Sign in / Sign up

Export Citation Format

Share Document