XPost: sci.math, comp.theory, bionet.biology.computational   
   From: vitorino.ramos@gmail.com   
      
   On Jul 20, 10:47 am, roberto03  wrote:   
   > Hello, i am trying to apply the "simulated annealing" methodology to a   
   > problem where i have to determine an optimal (according to some cost   
   > function) sequence of N bits, k of which are 1 and (N-k) are 0; i can   
   > switch at will the 1's and the 0's between them, but the total number   
   > of 1's should be kept constant, say k = N_0, chosen by the user;   
   >   
   > now i'd like to know if anyone has applied this methodology to this   
   > kind of problem where one has to optimize a bit string in some sense.   
   >   
   > Thanks for any answer.   
   > Roberto.   
   >   
      
   Dear Roberto   
      
   Have a look on the "Royal Road" problem, commonly used to test   
   Evolutionary Algorithms (e.g. Genetic Algorithms - GAs).   
   You have also an "oscillatory" harder version of the problem   
   (dynamic). For instance here solved sucessfully with Swarm   
   Intelligence approaches: http://www.laseeb.org/vramos/ref69.html   
   GA's normally solve the problem very well.   
      
   Best, Vitorino   
      
   ~ v.ramos, LaSEEB, IST, http://www.laseeb.org/vramos/   
   [...] Interactions among many sporuliferous and ubiquitous   
   abstractions   
   may lead to increasing reality [...] Vitorino Ramos, 2001.   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)