# An Ant Colony Optimization Algorithm for Microwave Corrugated Filters Design

Authors: Ivan A. Mantilla-Gaviria; Alejandro Díaz-Morcillo; Juan V. Balbastre-Tejedor
Journal: Journal of Computational Engineering
 (2013)

---

## Abstract

A practical and useful application of the Ant Colony Optimization (ACO) method for microwave corrugated filter design is shown. The classical, general purpose ACO method is adapted to deal with the microwave filter design problem. The design strategy used in this paper is an iterative procedure based on the use of an optimization method along with an electromagnetic simulator. The designs of  high-pass and band-pass microwave rectangular waveguide filters working in the C-band and X-band, respectively, for communication applications, are shown. The average convergence performance of the ACO method is characterized by means of Monte Carlo simulations and compared with that obtained with the well-known Genetic Algorithm (GA). The overall performance, for the simulations presented herein, of the ACO is found to be better than that of the GA.


---

## Body

## 1. Introduction

Several kinds of microwave filter design procedures have been proposed in the literature along the time. Almost all of them can be grouped into two categories; one of them includes those methods consisting of two stages; synthesis and optimization [1]. In the synthesis stage, techniques based on lumped elements and equivalences between these and physical models are used. The other category includes those approaches which are only based on the use of optimization techniques along with an electromagnetic simulator [1–4]. The procedure considered herein lays on the latter category.As described in [4], it is often necessary to implement two kinds of optimization: first, a global optimization method is used to find a roughly good solution and then local optimization is carried out to improve the previous solution. For the global optimization phase it is common to use some heuristic strategies [2–6] while for local optimization deterministic methods like the simplex method [7] or gradient based algorithms (e.g., the Broyden-Fletcher-Goldfarb-Shanno applied in [4]) are usually employed.The Ant Colony Optimization (ACO) is a kind of metaheuristic optimization method developed by Dorigo [8, 9]. The ACO is based on the communication system used by ants when they are looking for food sources. This system is an indirect system based on the modification of the physical environment by means of the segregation of a substance called pheromone [8, 9]. It has been widely applied to different engineering problems. However, in the electromagnetic community it has been mainly applied to the synthesis of antenna arrays [10–15], whilst only few applications have been found for the design of microwave filters. Particularly, in [16], the design, optimization and experimental validation of a microwave filter with Split Ring Resonators (SRR) is shown. In that work the parameters of the SRR (four parameters) were optimized by means of a particular ACO algorithm (described in [12]), used more as a local search algorithm than a global search one.The aim of this work is to apply this novel and robust metaheuristic optimization technique, the ACO, to the design of microwave corrugated filters based on the strategy commented above. Herein, the ACO method is only used for global optimization phase and the results are compared with those obtained with the well-established Genetic Algorithm (GA) method. The paper is organized as follows. In Section2, a short summary of the ACO method is presented. Then, the application of the ACO method to the H-plane microwave corrugated filters is shown in Section 3, where the bases of the method are outlined and the modifications implemented in the original algorithm, described in [17], are explained in some detail. Finally, numerical examples are shown in Section 4 and the results are compared with those obtained using the well-known GA method.


## 2. Ant Colony Optimization Algorithm

The ACO method is based on the communication system used by ants when they are looking for food sources. This system is an indirect system that is based on the modification of the physical environment by means of segregation of a substance called pheromone.When a bifurcation of the path appears, ants choose one of these with a probabilistic rule biased by the amount of pheromone. This probability is directly proportional to the level of pheromone, that is, the higher pheromone level in a path the higher probability to be chosen. In Figure1 the foraging process is described.Ant colony behaviour.
(a)
(b)
(c)
(d)Figure1 shows the ant colony nest (it is assumed a number of eight ants for this example), a source food, and two possible paths between them. The colour intensity represents the pheromone level for every path. Moreover, it is assumed that the shortest path is the path A and it has a travel time of one time unit, whilst the path B is the longest one with a travel time of two time units. For t=0, the ants are in the nest and go out to search for food. The initial selection of one path is random. It is assumed that half of the colony chooses the path A and the remaining one the path B. For t=1, the ants which travelled on the path A are in the food source and they have segregated an amount τ of pheromone in that path. On the other hand, ants that chose path B are still in the middle of the course. When ants that chose path A in the first travel are coming back to the nest, three of them choose path A and one chooses path B because of the pheromone level. For t=2, ants that chose path A (in t=1) are now in the nest and they have increased the pheromone level in this path, whilst the ant that chose path B (in t=1) instead path A, to come back to the nest, is still in the middle of this path. The ants that chose path B in t=0 are just arriving to the food source. When they return to the nest, due to the greater pheromone concentration, three choose path A and only one chooses path B. Finally for t=3, there are seven ants crossing the path A and only one the path B. For later times, path A will have a greater probability to be chosen than path B, since the pheromone concentration decreases in path B (due to the fact that it is not used) and increases in path A. However, there are always some ants exploring new paths. The later allow to ants no stagnate only in one path, giving to the optimization technique its global nature.The process described above shows how the ants are led for the shortest path between the nest and the food source. This communication process is called artificial stigmergic [9].


## 3. ACO Applied to Microwave Corrugated Filter Design

### 3.1. Problem Description

The ACO method is applied in this paper to the design of H-plane cavity corrugated filters. Since the structure is invariant in height, the filter can be considered as the cascade association of a set of cavities of lengthDi coupled through centred irises of width  Wj, as it is shown in Figure 2. The design consists in finding the set Di and Wj  letting to an  S21 parameter (or transmission parameter) that matches a given goal transfer function satisfying a specified error criteria. Because the ACO method is in essence discrete, it is necessary to use a discrete search space. This fact is commented in some detail later on (namely, in Section 4).Figure 2
Number of iris segments and iris apertures to be obtained.For a filter of ordern, n+2 cavity segments and n+1 iris apertures are necessary as Figure 2 shows and thus the total number of elements to be found is nt=2n+3.These filters are widely used for high frequency (GHz) and high power communication applications (e.g., satellite communications or radar) and consist of a metallic rectangular waveguide with rectangular irises along it (see [18–21] for more details).


### 3.2. ACO Algorithm Implementation

In this work, a modified version of the ACO algorithm described in [17] is developed, taking into account those differences between the microwave filter design problem and the problems (i.e., the Travelling Salesman Problem—TSP) dealt with in that reference; for example, in [17] once an ant has crossed one node (city), due the nature of the problem, this node is partially removed from the search space (the ant has to be only once in each node). In the application handled in this work, once an ant has selected one node (filter element) it remains in the search space, increasing in this way the complexity of the problem.For the current application, a colony ofN ants is used to find the best solution (a combination of 2n+3 filter elements) in a search space of dimension M. The value of M is not relevant at all, but for the computational effort. In Section 4, it will be described how to choose M taking into account the size of the filter and the required mechanical tolerance. The elements are chosen depending on their pheromone concentration and some heuristic information (the a priori preference that any possible element has to be used in a filter position). Each ant represents a solution consisting in an nt×1 array, where each entry represents one chosen element in the search space (namely, Di or Wj, as defined in Figure 2).The algorithm described in [17] consists of several steps: parameter initialization, pseudorandom proportional rule, local pheromone update, evaluation of the partial solutions by means of a fitness function, global pheromone update, and finally, heuristic information update as it is described in Figure 3. For the method presented in this paper, the global pheromone update and heuristic information update procedures have been modified regarding those presented in [17].Figure 3
ACO algorithm flowchart.The algorithm starts by initializing some specific variables and the initial point, which is randomly selected. Then, each ant selects one element (for every filter position) based on a probabilistic decision criteria (the elements for a filter are numbered from 1 tont). Since each ant selects an element for each filter position, a local pheromone update is performed for this element. This process is repeated until all the ants have selected all the elements for the sets  Di and Wj. After this step, the electromagnetic problem is solved (the transmission parameter is obtained) and the partial solutions found by the ants are scored. The score (Error) of every partial solution is obtained by using a fitness function. Finally, a global pheromone and heuristic information updates are performed. In the following the modified steps (i.e., the global pheromone and heuristic information update steps) are fully described.The probabilistic criterion decision used herein is calledpseudorandom-proportionalrule [9, 17] and it can be described as follows. Let the variable q0∈[0,1]  be an initial and fixed parameter of the algorithm and q a random value such that q∈[0,1]; the probability pi,jk(t) that some jth element has to be chosen for the ith filter position by the kth ant, at some instant t, is defined as follows:
(1)ifq≤q0,pi,jk={1ifj=argmaxj∈Ji{τi,j(ηi,jk)β}0otherwise,ifq>q0,pi,jk=τi,j(ηi,jk)β∑j∈Jiτi,j(ηi,jk)β,
where τi,j is the pheromone concentration of the jth element when it is used for the ith filter position and  ηi,jk  is the heuristic information that scores the a priori preference of a jth element to be chosen by the kth ant for the ith filter position. The parameter β scores the influence of the heuristic information on the pseudorandom-proportional rule and Ji is the set of available elements for a specific ith filter position.Pheromone concentration controls the relevance of an element of the search space on the obtained response when it is used in one filter position (i.e., in a given entry of the ant array). In ACO algorithm two kinds of pheromone update are used: thelocal pheromone update and the global pheromone update. The local pheromone update is performed by [9, 17]:
(2)τi,j=(1-φ)τi,j+φτ0,
where τ0 is the initial amount of pheromone concentration and φ is the local evaporation coefficient.Theglobal pheromone is updated for the jth element in the search space when it is chosen by the best ant at time  t and then introduced at the ith position in the corresponding best solution array. The functions used in [17] to implement the pheromone update take into account only the fitness function value at time t. In this work, a modified fitness function involving the values at times t and t-1 is proposed. This modification helps the algorithm to give more importance to those elements belonging to solutions that have improved the design regarding the previous one. It is shown in the following
(3)τi,j(t+1)=(1-ρ)τi,j(t)+Δτi,j(t),Δτi,j(t)=QErrortbestErrort-1best,
where parameter ρ is the global evaporation coefficient, Q is a fixed value that controls the order of magnitude of the pheromone increment, and Errorbest is the best fitness function value found by the colony. The fitness function is basically given by the mean of the standard deviation values between each point in frequency of the goal transfer function and their corresponding in the transfer function found by an ant. It is expressed, for the kth ant, as follows:
(4)Errork=1nf∑i=1nf(|S21k(i)|-mi)2+(|S21obj(i)|-mi)2,
where nf is the number of frequency points, S21k is the filter response given by the partial solution found by the kth ant, S21obj is the goal filter response, and mi=(S21k(i)+S21obj(i))/2. The efficiency of the ACO method mainly depends on the choice of the fitness function. If the value calculated by this function is not an accurate representation of the actual situation, ants easily will be in wrong search space zones, that is, in zones with values that do not minimize (4).Finally, the heuristic information scores the a priori preference of using one element in one filter position. For the problems dealt with in [17], an a priori evaluation of ethe problem, taking into account all the possibilities is used to calculate a heuristic value. This is possible because the nature of those problems makes it computationally feasible. However, this strategy is not applicable to the electromagnetic problems considered here (microwave corrugated filters) due to its computational cost. On the other hand, there are no criteria to know, a priori, whether some elements of the search space are suitable or not for the filter in a given position. For this reason, in this work a new and practical strategy to calculate the heuristic information is proposed. This strategy is based on the improvement directions of each ant regarding the best solution found by the colony. Figure 4 shows the flowchart describing this innovative approach.Figure 4
Heuristic information update.In Figure4 the parameter ηk stands for the heuristic information that has the kth ant, Filtertk is the filter found by the kth ant in time t, Filterbest  is the best filter found by the colony until time t, and U is a 1×(ub-lb+1) random array with uniform probability distribution. This rule suggests that those elements of the search space lying between the value of a given entry of the filter vector found in time t by the kth ant and the value of the same entry of the best found filter will have a greater preference than the rest of the possible elements.Finally, the algorithm parameters directly depend on the problem to be solved and it is very common to use an empirical selection [9, 10, 17].The heuristic information update, developed in this work, avoids the electromagnetic problem evaluation for every ant and iteration or for all the search space components as it is proposed in other works (e.g., [10, 12, 17]). This also allows an important reduction of the computational effort. This aspect is particularly useful for electromagnetic problems where heavy numerical algorithms must be run to solve the physical phenomenon.


## 3.1. Problem Description

The ACO method is applied in this paper to the design of H-plane cavity corrugated filters. Since the structure is invariant in height, the filter can be considered as the cascade association of a set of cavities of lengthDi coupled through centred irises of width  Wj, as it is shown in Figure 2. The design consists in finding the set Di and Wj  letting to an  S21 parameter (or transmission parameter) that matches a given goal transfer function satisfying a specified error criteria. Because the ACO method is in essence discrete, it is necessary to use a discrete search space. This fact is commented in some detail later on (namely, in Section 4).Figure 2
Number of iris segments and iris apertures to be obtained.For a filter of ordern, n+2 cavity segments and n+1 iris apertures are necessary as Figure 2 shows and thus the total number of elements to be found is nt=2n+3.These filters are widely used for high frequency (GHz) and high power communication applications (e.g., satellite communications or radar) and consist of a metallic rectangular waveguide with rectangular irises along it (see [18–21] for more details).


## 3.2. ACO Algorithm Implementation

In this work, a modified version of the ACO algorithm described in [17] is developed, taking into account those differences between the microwave filter design problem and the problems (i.e., the Travelling Salesman Problem—TSP) dealt with in that reference; for example, in [17] once an ant has crossed one node (city), due the nature of the problem, this node is partially removed from the search space (the ant has to be only once in each node). In the application handled in this work, once an ant has selected one node (filter element) it remains in the search space, increasing in this way the complexity of the problem.For the current application, a colony ofN ants is used to find the best solution (a combination of 2n+3 filter elements) in a search space of dimension M. The value of M is not relevant at all, but for the computational effort. In Section 4, it will be described how to choose M taking into account the size of the filter and the required mechanical tolerance. The elements are chosen depending on their pheromone concentration and some heuristic information (the a priori preference that any possible element has to be used in a filter position). Each ant represents a solution consisting in an nt×1 array, where each entry represents one chosen element in the search space (namely, Di or Wj, as defined in Figure 2).The algorithm described in [17] consists of several steps: parameter initialization, pseudorandom proportional rule, local pheromone update, evaluation of the partial solutions by means of a fitness function, global pheromone update, and finally, heuristic information update as it is described in Figure 3. For the method presented in this paper, the global pheromone update and heuristic information update procedures have been modified regarding those presented in [17].Figure 3
ACO algorithm flowchart.The algorithm starts by initializing some specific variables and the initial point, which is randomly selected. Then, each ant selects one element (for every filter position) based on a probabilistic decision criteria (the elements for a filter are numbered from 1 tont). Since each ant selects an element for each filter position, a local pheromone update is performed for this element. This process is repeated until all the ants have selected all the elements for the sets  Di and Wj. After this step, the electromagnetic problem is solved (the transmission parameter is obtained) and the partial solutions found by the ants are scored. The score (Error) of every partial solution is obtained by using a fitness function. Finally, a global pheromone and heuristic information updates are performed. In the following the modified steps (i.e., the global pheromone and heuristic information update steps) are fully described.The probabilistic criterion decision used herein is calledpseudorandom-proportionalrule [9, 17] and it can be described as follows. Let the variable q0∈[0,1]  be an initial and fixed parameter of the algorithm and q a random value such that q∈[0,1]; the probability pi,jk(t) that some jth element has to be chosen for the ith filter position by the kth ant, at some instant t, is defined as follows:
(1)ifq≤q0,pi,jk={1ifj=argmaxj∈Ji{τi,j(ηi,jk)β}0otherwise,ifq>q0,pi,jk=τi,j(ηi,jk)β∑j∈Jiτi,j(ηi,jk)β,
where τi,j is the pheromone concentration of the jth element when it is used for the ith filter position and  ηi,jk  is the heuristic information that scores the a priori preference of a jth element to be chosen by the kth ant for the ith filter position. The parameter β scores the influence of the heuristic information on the pseudorandom-proportional rule and Ji is the set of available elements for a specific ith filter position.Pheromone concentration controls the relevance of an element of the search space on the obtained response when it is used in one filter position (i.e., in a given entry of the ant array). In ACO algorithm two kinds of pheromone update are used: thelocal pheromone update and the global pheromone update. The local pheromone update is performed by [9, 17]:
(2)τi,j=(1-φ)τi,j+φτ0,
where τ0 is the initial amount of pheromone concentration and φ is the local evaporation coefficient.Theglobal pheromone is updated for the jth element in the search space when it is chosen by the best ant at time  t and then introduced at the ith position in the corresponding best solution array. The functions used in [17] to implement the pheromone update take into account only the fitness function value at time t. In this work, a modified fitness function involving the values at times t and t-1 is proposed. This modification helps the algorithm to give more importance to those elements belonging to solutions that have improved the design regarding the previous one. It is shown in the following
(3)τi,j(t+1)=(1-ρ)τi,j(t)+Δτi,j(t),Δτi,j(t)=QErrortbestErrort-1best,
where parameter ρ is the global evaporation coefficient, Q is a fixed value that controls the order of magnitude of the pheromone increment, and Errorbest is the best fitness function value found by the colony. The fitness function is basically given by the mean of the standard deviation values between each point in frequency of the goal transfer function and their corresponding in the transfer function found by an ant. It is expressed, for the kth ant, as follows:
(4)Errork=1nf∑i=1nf(|S21k(i)|-mi)2+(|S21obj(i)|-mi)2,
where nf is the number of frequency points, S21k is the filter response given by the partial solution found by the kth ant, S21obj is the goal filter response, and mi=(S21k(i)+S21obj(i))/2. The efficiency of the ACO method mainly depends on the choice of the fitness function. If the value calculated by this function is not an accurate representation of the actual situation, ants easily will be in wrong search space zones, that is, in zones with values that do not minimize (4).Finally, the heuristic information scores the a priori preference of using one element in one filter position. For the problems dealt with in [17], an a priori evaluation of ethe problem, taking into account all the possibilities is used to calculate a heuristic value. This is possible because the nature of those problems makes it computationally feasible. However, this strategy is not applicable to the electromagnetic problems considered here (microwave corrugated filters) due to its computational cost. On the other hand, there are no criteria to know, a priori, whether some elements of the search space are suitable or not for the filter in a given position. For this reason, in this work a new and practical strategy to calculate the heuristic information is proposed. This strategy is based on the improvement directions of each ant regarding the best solution found by the colony. Figure 4 shows the flowchart describing this innovative approach.Figure 4
Heuristic information update.In Figure4 the parameter ηk stands for the heuristic information that has the kth ant, Filtertk is the filter found by the kth ant in time t, Filterbest  is the best filter found by the colony until time t, and U is a 1×(ub-lb+1) random array with uniform probability distribution. This rule suggests that those elements of the search space lying between the value of a given entry of the filter vector found in time t by the kth ant and the value of the same entry of the best found filter will have a greater preference than the rest of the possible elements.Finally, the algorithm parameters directly depend on the problem to be solved and it is very common to use an empirical selection [9, 10, 17].The heuristic information update, developed in this work, avoids the electromagnetic problem evaluation for every ant and iteration or for all the search space components as it is proposed in other works (e.g., [10, 12, 17]). This also allows an important reduction of the computational effort. This aspect is particularly useful for electromagnetic problems where heavy numerical algorithms must be run to solve the physical phenomenon.


## 4. Results

The optimization technique developed in this paper has been applied to the design of a microwave rectangular waveguide high-pass filter at C-band (4–10 GHz) and of a band-pass filter at X-band (10.7–11.3 GHz). TheS21 parameter is obtained and compared with that obtained by the classical Genetic Algorithm (GA). The GA Matlab toolbox has been used for this task. Also the average convergence performance for ACO is analyzed and compared with GA by means of Monte Carlo simulations.The discretization step used forDi and Wj is 0.1 mm (which is less than a hundredth of the wavelength at the operating frequencies). This value, along with the physical filter dimensions, yields the search space dimension, M. Nevertheless, this method is also valid for any discretization step; this value only affects the desired design accuracy and computation time. The electromagnetic problem has been solved using a Mode-Matching (MM) method tool [22].The main parameters for the ACO algorithm areβ=2, ρ=0.1, Q=10, q0=0.7, and φ=0.1. Additionally, for both optimization algorithms, the same number of artificial agents (ants for ACO and individuals for GA) has been used (10 agents) in order to make a fair comparison. The initial population is randomly established and it is set equal for both methods. For convenience and to illustrate, in some way, the quality of the results, the filter response due to the initial population is also shown along with those obtained by ACO and GA (see Figures 5 and 7). Moreover, also the same fitness function (4) is used for ACO and GA. The simulations are performed in a desktop computer of 2.2 GHz of processor and 4 GHz of Random Access Memory (RAM).Figure 5
High-pass filter response.On the other hand, the main parameters used for GA are elite count equal to 2, crossover fraction equal to 0.01, crossover function intermediate, mutation function uniform, and mutation rate equal to 0.01.As it is commented in [23, 24] the comparison of this kind of algorithms is not evident nor trivial. However, the aim in this work is to demonstrate the validity of the proposed algorithm rather than to demonstrate whether it is better or not than other ones; therefore, a more practical strategy to do this comparison is used and the guidelines proposed in [23, 24] are avoided.


### 4.1. High-Pass Filter

The filter has been designed in a WR-137 (34.85 × 15.8 mm) waveguide. For this filter the defined search space for iris apertures is 4–34.8 mm and 5–20 mm for iris segments. The parameterI in Figure 2 is set to 0.5 mm. The order of this filter is 6 with a cut-off frequency of 5.4 GHz. The goal S21 parameter has been taken from [18] and for convenience is shown in Figure 5.The dimensions of fifteen filter elements have to be calculated for this filter. However, as it is well known [4, 18, 20], a typical waveguide filter design is a symmetric structure. This property is used in this simulation; thus, only a total of eight element dimensions have been calculated.Figure5 shows the responses for the designs found by ACO and GA methods. Both methods have found very accurate designs. However, for the same number of cycles (500) the ACO method has obtained the best fitness function value (0.0018879). On the other hand, Figure 6 shows the average convergence performance obtained for both ACO and GA methods by means of Monte Carlo simulations (100 trials). In this figure, the mean of the fitness values, for each point in frequency, of the solution in each trial is shown. From this figure it can be observed that the ACO method reaches more accurate designs faster than the used GA method. In practical terms, the ACO method finds a good design after 100 cycles whilst GA needs at least 400 cycles.Figure 6
Average convergence performance for high-pass filter.Figure 7
Band-pass filter response.Regarding to the processing time per cycle, the same amount of time has been found for both methods. Firstly, it is because they use the same number of artificial agents (10 agents), and secondly, because in this kind of problems that processing time is dominated by the solution of the fitness function (i.e., the solution of an electromagnetic problem that is the order of 1–3 seconds) rather than the implementation of the optimization algorithm itself. Thus, neglecting the time for solving the fitness function, which is not directly part of an optimization algorithm, the processing time per cycle for both ACO and GA was found of the order of hundred of microseconds. Finally, regarding the memory consumption any rigorous analysis was performed but it is important to emphasize that with a desktop computer like the one described in Section4 any memory overload was found for any of the tested algorithms. Therefore, under these conditions, the most equitable parameter to measure the algorithms efficiency is the number of required cycles to obtain a suitable solution.


### 4.2. Band-Pass Filter

This filter has been designed in a WR-75 (19.05 × 9.525 mm) waveguide. For this filter, the defined search space for iris apertures was 3–19 mm and 10–20 mm for iris segments. The parameterI in Figure 2 is set to 2 mm. The order of this filter is 4, with a central frequency of 11 GHz and a bandwidth of 300 MHz. The goal S21 parameter is a standard four-pole Chebyshev curve and for convenience is shown in Figure 7.For this filter the dimensions of eleven filter elements have to be calculated. The symmetry property is also used for this simulation; thus, only six elements dimensions have been calculated.Figure7 shows the responses for the designs found by ACO and GA methods. It is evident that the ACO design is closer to the goal than the one found by GA. In this example, the ACO method gives up to the double of the accuracy regarding the GA response as it can be observed in the fitness values in the legend of Figure 7.On the other hand, Figure8 shows the average convergence performance obtained for both the ACO and the GA methods by means of Monte Carlo simulations (100 trials). It can be seen that the ACO method also for this design obtains a much faster convergence than the GA method, that is, a better fitness value in fewer cycles.Figure 8
Average convergence performance for band-pass filter.As it was commented in Section1, the design of a filter generally requires two optimization steps, one for a global search and another one (subsequent) for a local search. The results shown in this work can be significantly improved by using a local search algorithm; however, it is not the aim of this work to implement a second search step, but to demonstrate the usefulness of the proposed ACO algorithm to design microwave corrugated filters.


## 4.1. High-Pass Filter

The filter has been designed in a WR-137 (34.85 × 15.8 mm) waveguide. For this filter the defined search space for iris apertures is 4–34.8 mm and 5–20 mm for iris segments. The parameterI in Figure 2 is set to 0.5 mm. The order of this filter is 6 with a cut-off frequency of 5.4 GHz. The goal S21 parameter has been taken from [18] and for convenience is shown in Figure 5.The dimensions of fifteen filter elements have to be calculated for this filter. However, as it is well known [4, 18, 20], a typical waveguide filter design is a symmetric structure. This property is used in this simulation; thus, only a total of eight element dimensions have been calculated.Figure5 shows the responses for the designs found by ACO and GA methods. Both methods have found very accurate designs. However, for the same number of cycles (500) the ACO method has obtained the best fitness function value (0.0018879). On the other hand, Figure 6 shows the average convergence performance obtained for both ACO and GA methods by means of Monte Carlo simulations (100 trials). In this figure, the mean of the fitness values, for each point in frequency, of the solution in each trial is shown. From this figure it can be observed that the ACO method reaches more accurate designs faster than the used GA method. In practical terms, the ACO method finds a good design after 100 cycles whilst GA needs at least 400 cycles.Figure 6
Average convergence performance for high-pass filter.Figure 7
Band-pass filter response.Regarding to the processing time per cycle, the same amount of time has been found for both methods. Firstly, it is because they use the same number of artificial agents (10 agents), and secondly, because in this kind of problems that processing time is dominated by the solution of the fitness function (i.e., the solution of an electromagnetic problem that is the order of 1–3 seconds) rather than the implementation of the optimization algorithm itself. Thus, neglecting the time for solving the fitness function, which is not directly part of an optimization algorithm, the processing time per cycle for both ACO and GA was found of the order of hundred of microseconds. Finally, regarding the memory consumption any rigorous analysis was performed but it is important to emphasize that with a desktop computer like the one described in Section4 any memory overload was found for any of the tested algorithms. Therefore, under these conditions, the most equitable parameter to measure the algorithms efficiency is the number of required cycles to obtain a suitable solution.


## 4.2. Band-Pass Filter

This filter has been designed in a WR-75 (19.05 × 9.525 mm) waveguide. For this filter, the defined search space for iris apertures was 3–19 mm and 10–20 mm for iris segments. The parameterI in Figure 2 is set to 2 mm. The order of this filter is 4, with a central frequency of 11 GHz and a bandwidth of 300 MHz. The goal S21 parameter is a standard four-pole Chebyshev curve and for convenience is shown in Figure 7.For this filter the dimensions of eleven filter elements have to be calculated. The symmetry property is also used for this simulation; thus, only six elements dimensions have been calculated.Figure7 shows the responses for the designs found by ACO and GA methods. It is evident that the ACO design is closer to the goal than the one found by GA. In this example, the ACO method gives up to the double of the accuracy regarding the GA response as it can be observed in the fitness values in the legend of Figure 7.On the other hand, Figure8 shows the average convergence performance obtained for both the ACO and the GA methods by means of Monte Carlo simulations (100 trials). It can be seen that the ACO method also for this design obtains a much faster convergence than the GA method, that is, a better fitness value in fewer cycles.Figure 8
Average convergence performance for band-pass filter.As it was commented in Section1, the design of a filter generally requires two optimization steps, one for a global search and another one (subsequent) for a local search. The results shown in this work can be significantly improved by using a local search algorithm; however, it is not the aim of this work to implement a second search step, but to demonstrate the usefulness of the proposed ACO algorithm to design microwave corrugated filters.


## 5. Conclusions

A new, practical, and useful application of the Ant Colony Optimization (ACO) method for the design of microwave waveguide filters has been presented. The modifications of the ACO algorithm, to adapt it for microwave filter designs, were also fully described.The ACO method used here has been validated with two examples: a high-pass filter at C-band and a band-pass filter in X-band. Accurate results have been reached comparable or better than those obtained by the well-established Genetic Algorithms (GA) for both examples. Moreover, it was found that ACO method achieved a much faster average convergence than GA also for both examples.A practical and useful strategy to update the heuristic information, which avoids the previous evaluation of the electromagnetic problem, has been developed and described.The results obtained with this ACO method can be used as final designs (in some cases) or as a very good starting point for a local optimization stage of a design procedure. Also this ACO method can be used along with other electromagnetic simulators in order to solve other kinds of problems, for example, as that solved in [4].



---

*Source: 942126-2013-06-23.xml*