1. Identity statement | |
Reference Type | Journal Article |
Site | mtc-m16.sid.inpe.br |
Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
Identifier | 6qtX3pFwXQZsFDuKxG/D9vo2 |
Repository | sid.inpe.br/marciana/2004/08.13.16.27 (restricted access) |
Last Update | 2004:08.13.03.00.00 (UTC) administrator |
Metadata Repository | sid.inpe.br/marciana/2004/08.13.16.27.33 |
Metadata Last Update | 2018:06.05.01.28.42 (UTC) administrator |
Secondary Key | INPE-11211-PRE/6660 |
ISBN/ISSN | 0340-1200 |
ISSN | 0340-1200 |
Citation Key | Linhares:1998:TrSaEx |
Title | State-space search strategies gleaned from animal behavior: a traveling salesman experiment |
Project | Inteligência Artificial |
Year | 1998 |
Month | Apr. |
Access Date | 2024, Apr. 27 |
Secondary Type | PRE PI |
Number of Files | 1 |
Size | 658 KiB |
|
2. Context | |
Author | Linhares, Alexandre |
Group | LAC-INPE-MCT-BR |
Affiliation | Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC) |
Journal | Biological Cybernetics |
Volume | 78 |
Number | 3 |
Pages | 167-173 |
History (UTC) | 2005-06-28 18:07:03 :: sergio -> administrator :: 2006-09-28 22:36:19 :: administrator -> sergio :: 2008-01-07 12:49:56 :: sergio -> administrator :: 2018-06-05 01:28:42 :: administrator -> marciana :: 1998 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Keywords | COMPUTER SCIENCE Optimization Computation Algorithms Artificial intelligence Animal behavior Traveling salesman problem COMPUTAÇÃO APLICADA Otimização Computação Algoritmos Inteligência artificial Comportamento animal Problemas do agente de viagem |
Abstract | A widespread search strategy employed by predators in both vertebrate and invertebrate phyla is the well-known area-restricted search strategy. The generality, simplicity, and effectiveness of this strategy have made it emerge many times during the course of natural selection. In this work, an artificial intelligence state-space search procedure is developed using search guidelines gleaned from the foraging behavior of predators. This procedure, which we call predatory search, has been implemented on a NP-Hard combinatorial problem: the traveling salesman problem. Numerical results are presented for a limited set of benchmark problems, and area-restricted search seems to be effective: We have been able to find the optimal solution to, among others, a 400-city Manhattan problem. |
Area | COMP |
Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > State-space search strategies... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
Language | en |
Target File | state-space.pdf |
User Group | administrator sergio |
Visibility | shown |
Copy Holder | SID/SCD |
Archiving Policy | denypublisher denyfinaldraft12 |
Read Permission | deny from all and allow from 150.163 |
|
5. Allied materials | |
Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
Dissemination | WEBSCI |
Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
|
6. Notes | |
Empty Fields | alternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup resumeid rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
|
7. Description control | |
e-Mail (login) | marciana |
update | |
|