# Modified Cuckoo Search Algorithm with Variational Parameters and Logistic Map
## 2 Preliminary
### Boundary Is Constrained by Logistic Map of Each Dimension
Figure 2: _Cont._

## 5 Conclusions

In this paper, the VLCS algorithm consists of coefficient function, the standard CS algorithm and each dimension with one logistic map. The logistic map is used to handle the initial problem and boundary issue. Using the logistic map guarantees to reduce the complexity of the VLCS algorithm and improve the computational efficiency. The reasons are analyzed in Section 3.1. The coefficient function is used to calculate \(\alpha_{new}\) and \(p_{new}\). The coefficient function is used to change \(\alpha_{new}\) and \(p_{new}\) when the iteration increases. That is why the VLCS algorithm not only can reduce repeated calculation, but also can accelerate the speed of convergence. Furthermore, the VLCS algorithm can prevent itself from falling into a local optimum. The coefficient function is analyzed in Section 3.2. After the analysis of Section 4 simulation experiments, the VLCS algorithm is good at dealing with high dimension problems and low dimension problems. In the future, we will come up with a more precise way to deal with \(\alpha\) and \(p_{a}\) and use the VLCS algorithm to solve other practical engineering problems and real-world problems such as image hiding, power distribution, AODV routing protocol and so on. We believe that the VLCS will promote the development of the algorithm and be very useful in real-world problems. **Acknowledgments:** This work is supported by the National Natural Science Foundation of China (Grant No. 71633006 and Grant No. 61672540), and The Fund of Postgraduate Student Independent Innovation Project of Central South University (Grant No. 2017 zzts733). **Author Contributions:** [PERSON] and [PERSON] conceived and designed the experiments; [PERSON] performed the experiments; [PERSON] analyzed the data; [PERSON] contributed reagents/materials/analysis tools; [PERSON] wrote the paper. **Conflicts of Interest:** The authors declare no conflicts of interest. Figure 2: Convergence performance of the CS and the VLCS. ## References

* (1) [PERSON] Optimization Problem Formulation for Multidisciplinary Design. _Siam J. Optim._**1993**, \(4\), 754-776. * (2) [PERSON]; [PERSON]; [PERSON]. A Survey on Multiobjective Evolutionary Algorithms for the Solution of the Portfolio Optimization Problem and Other Finance and Economics Applications. _IEEE Trans. Evolut. Comput._**2013**, _17_, 321-344. * (3) [PERSON]; [PERSON]; [PERSON] A Genetic Algorithm based Video Watermarking in the DWT Domain. In Proceedings of the International Conference on Computational Intelligence and Security, Guangzhou, China, 3-6 November 2006; pp. 1209-1212. * (4) [PERSON]; [PERSON]; [PERSON] Estimating system parameters from chaotic time series with synchronization optimized by a genetic algorithm. _Phys. Rev. E Stat. Nonlinear Soft Matter Phys._**2007**, _76_, 016209, doi:10.1103/PhysRevE.76.016209. * (5) [PERSON] Forecasting chaotic time series with genetic algorithms. _Phys. Rev. E Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top._**1997**, _55_, 2557-2568. * (6) [PERSON]; [PERSON]; [PERSON]; [PERSON] A Rule-Based Dynamic Decision-Making Stock Trading System Based on Quantum-Inspired Tabu Search Algorithm. _IEEE Access_**2014**, \(2\), 883-896. * (7) [PERSON]; [PERSON]; [PERSON]; [PERSON] Reconstructing permutation table to improve the Tabu Search for the PFSP on GPU. _J. Supercomput._**2017**, _73_, 4711-4738. * (8) [PERSON]; [PERSON]; [PERSON]; [PERSON] Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem. _Ann. Oper. Res._**2017**, 1-17, doi:10.1007/s10479-017-2675-0. * (9) [PERSON]; [PERSON]; [PERSON]; [PERSON] A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA. _IEEE Trans. Evolut. Comput._**2008**, _12_, 269-283. * (10) [PERSON]; [PERSON] SANA: Simulated annealing far outperforms many other search algorithms for biological network alignment. _Bioinformatics_**2017**, _33_, 2156-2164. * (11) [PERSON]; [PERSON]; [PERSON]; [PERSON] Angular filter refractometry analysis using simulated annealing.