Re: SA and bit sequence optimization

Article View: comp.ai

Article #9106

#9106

From: Vitorino RAMOS
Date: Thu, 09 Aug 2007 08:28

31 lines
2517 bytes

On Jul 20, 10:47 am, roberto03 <robert...@gmail.com> 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. ]

Technical Details

Message-ID: <46bacfb1$1@news.unimelb.edu.au>

Path:

arc1-ca.pugleaf.net!g2news2.google.com!news1.google.com!border1.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!news1.optus.net.au!optus!news.optus.net.au!53ab2750!not-for-mail

References: <46a084a1$1@news.unimelb.edu.au>

Show Full Headers

Complete Article Headers

X-Google-Thread: 10461e,ca2096b8c13d827e
X-Google-Thread: 109d8a,ca2096b8c13d827e
X-Google-Thread: f8362,ca2096b8c13d827e
X-Google-Thread: 10e2ff,ca2096b8c13d827e
X-Google-Attributes: gid10461e,gid109d8a,gidf8362,gid10e2ff,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: arc1-ca.pugleaf.net!g2news2.google.com!news1.google.com!border1.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!news1.optus.net.au!optus!news.optus.net.au!53ab2750!not-for-mail
Newsgroups: comp.ai,sci.math,comp.theory,bionet.biology.computational
Approved: ai@cs.mu.oz.au (Moderator comp.ai)
From: Vitorino RAMOS <vitorino.ramos@gmail.com>
X-No-Markup: yes
Subject: Re: SA and bit sequence optimization
X-Date: Wed, 08 Aug 2007 19:25:10 -0700
Organization: ?
References: <46a084a1$1@news.unimelb.edu.au>
X-Mod: ?
User-Agent: nn/6.6.4
X-Original-NNTP-Posting-Host: mulga.csse.unimelb.edu.au
Message-ID: <46bacfb1$1@news.unimelb.edu.au>
X-Original-Trace: 9 Aug 2007 18:26:25 +1100, mulga.csse.unimelb.edu.au
Lines: 31
Date: Thu, 09 Aug 2007 08:28:49 GMT
NNTP-Posting-Host: 128.250.20.3
X-Trace: news.optus.net.au 1186648129 128.250.20.3 (Thu, 09 Aug 2007 18:28:49 EST)
NNTP-Posting-Date: Thu, 09 Aug 2007 18:28:49 EST
X-Original-Bytes: 2143

Reply to Parent Message