Difference between revisions of "Talk:Presentation"

From Adaptive Population based Simplex
Jump to: navigation, search
m (Combinatorial APS?)
m (Combinatorial APS?)
Line 1: Line 1:
 
== Combinatorial APS? ==
 
== Combinatorial APS? ==
For some problems that are at least partly discrete, the basic APS applies a \emph{quantisation} operator. If the quantum is qd for
+
For some problems that are at least partly discrete, the basic APS applies a ''quantisation'' operator. If the quantum is qd for
 
the dimension d, the operator is defined by <br />
 
the dimension d, the operator is defined by <br />
  

Revision as of 22:55, 13 June 2013

Combinatorial APS?

For some problems that are at least partly discrete, the basic APS applies a quantisation operator. If the quantum is qd for the dimension d, the operator is defined by

xi,dqd(0.5+xi,d/qd)

where 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.