2006
DOI: 10.1504/ijcse.2006.012769
|View full text |Cite
|
Sign up to set email alerts
|

Semi-deterministic versus genetic algorithms for global optimisation of multichannel optical filters

Abstract: Abstract:A new global optimization algorithm is presented and applied to the design of high-channel-count multichannel filters based on sampled Fiber Bragg Gratings. We focus on the realization of particular designs corresponding to multichannel filters that consist of 16 and 38 totally reflective identical channels spaced 100 GHz. The results are compared with those obtained by a hybrid genetic algorithm and by the classical sinc method.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 13 publications
(16 reference statements)
0
21
0
Order By: Relevance
“…In order to solve (D V ar ; IP; α; β), which seems to be a non-convex problem (the cost function associated to the problem appears to have various local minima, see Figure 2), we use a particular global optimization algorithm based on the steepest descent algorithm, where the initial condition is generated using the secant method [25]. A complete description and validation of this algorithm can be found in the following literature [20,18,13,22,21,16,17]. The obtained solutions are denoted by λ (α,β) .…”
Section: Numerical Problemmentioning
confidence: 99%
“…In order to solve (D V ar ; IP; α; β), which seems to be a non-convex problem (the cost function associated to the problem appears to have various local minima, see Figure 2), we use a particular global optimization algorithm based on the steepest descent algorithm, where the initial condition is generated using the secant method [25]. A complete description and validation of this algorithm can be found in the following literature [20,18,13,22,21,16,17]. The obtained solutions are denoted by λ (α,β) .…”
Section: Numerical Problemmentioning
confidence: 99%
“…In other words, the zone near this element will be better explored. In other cases, the secant method used in Step 2.2 allows to redistribute the initial population far from the current solution (See [7,10,11] for more details).…”
Section: End Of the Loop Formentioning
confidence: 99%
“…It has been applied and compared with a classical genetic algorithm on various benchmark test cases [7] and industrial applications [10,11,12,13].…”
Section: Parameters In Algorithmsmentioning
confidence: 99%
“…We would like therefore to use a low complexity global minimization algorithm previously applied with success to various nonlinear industrial optimization problems [13,14,16].…”
Section: Cost Functionsmentioning
confidence: 99%
“…This algorithm allows to escape from local minima at a lower cost than genetic algorithms [12,13,14].…”
Section: Introductionmentioning
confidence: 99%