Talk:Presentation
From Adaptive Population based Simplex
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,d←qd⌊(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.