Difference between revisions of "Talk:Presentation"

From Adaptive Population based Simplex
Jump to: navigation, search
(Created page with "== Combinatorial APS? == For some problems that are at least partly discrete, the basic APS applies a \emph{quantisation} operator. If the quantum is $q_{d}$ for the dimension...")
 
m (Combinatorial APS?)
Line 9: Line 9:
 
where $\left\lfloor \right.$ is the floor operator.  
 
where $\left\lfloor \right.$ is the floor operator.  
  
Now, for combinatorial, it is certainly better to define specific operators for Expansion, Contraction, and Local search, as it has been done, for example, for PSO.
+
Now, for combinatorial problems, it is certainly better to define specific operators for Expansion, Contraction, and Local search, similarly to what has been done, for example, for PSO.

Revision as of 22:46, 13 June 2013

Combinatorial APS?

For some problems that are at least partly discrete, the basic APS applies a \emph{quantisation} operator. If the quantum is $q_{d}$ for the dimension $d$, the operator is defined by

$$ x_{i,d}\leftarrow q_{d}\left\lfloor \left(0.5+x_{i,d}/q_{d}\right)\right.\tag{1} $$

where $\left\lfloor \right.$ is the floor operator.

Now, for combinatorial problems, it is certainly better to define specific operators for Expansion, Contraction, and Local search, similarly to what has been done, for example, for PSO.