A Staged Continuous Tabu Search Algorithm for the Global Optimization and its Applications to the Design of Fiber Bragg Gratings
- 128 Downloads
A novel staged continuous Tabu search (SCTS) algorithm is proposed for solving global optimization problems of multi-minima functions with multi-variables. The proposed method comprises three stages that are based on the continuous Tabu search (CTS) algorithm with different neighbor-search strategies, with each devoting to one task. The method searches for the global optimum thoroughly and efficiently over the space of solutions compared to a single process of CTS. The effectiveness of the proposed SCTS algorithm is evaluated using a set of benchmark multimodal functions whose global and local minima are known. The numerical test results obtained indicate that the proposed method is more efficient than an improved genetic algorithm published previously. The method is also applied to the optimization of fiber grating design for optical communication systems. Compared with two other well-known algorithms, namely, genetic algorithm (GA) and simulated annealing (SA), the proposed method performs better in the optimization of the fiber grating design.
Keywordsstaged continuous Tabu search global optimization multi-variables fiber gratings
Unable to display preview. Download preview PDF.
- 2.J. Bae and J. Chun, “Design of fiber bragg gratings using the simulated annealing technique for an ideal WDM filter bank,” IEEE MILCOM 2000. 21st Century Military Communications Conference Proceedings, 2000, vol. 2, pp. 892–896.Google Scholar
- 4.F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1998.Google Scholar
- 6.C. Houck, J. Joines, and M. Kay, A Genetic Algorithm for Function Optimization: A Matlab Implementation, NCSU-IE TR 95-09, 1995. http://www.ie.ncsu.edu/mirage/GAToolBox/gaot/.
- 8.D. Karaboga, D.H. Horrocks, N. Karaboga, and A. Kalinli, “Designing digital FIR filters using tabu search algorithm,” in IEEE International Symposium on Circuits and Systems, Hong Kong, June 9–12, 1997, pp. 2236–2239.Google Scholar