Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier6qtX3pFwXQZsFDuKxG/D9vo2
Repositorysid.inpe.br/marciana/2004/08.13.16.27   (restricted access)
Last Update2004:08.13.03.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/marciana/2004/08.13.16.27.33
Metadata Last Update2018:06.05.01.28.42 (UTC) administrator
Secondary KeyINPE-11211-PRE/6660
ISBN/ISSN0340-1200
ISSN0340-1200
Citation KeyLinhares:1998:TrSaEx
TitleState-space search strategies gleaned from animal behavior: a traveling salesman experiment
ProjectInteligência Artificial
Year1998
MonthApr.
Access Date2024, Apr. 27
Secondary TypePRE PI
Number of Files1
Size658 KiB
2. Context
AuthorLinhares, Alexandre
GroupLAC-INPE-MCT-BR
AffiliationInstituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada (INPE.LAC)
JournalBiological Cybernetics
Volume78
Number3
Pages167-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 Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsCOMPUTER 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
AbstractA 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.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > State-space search strategies...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filestate-space.pdf
User Groupadministrator
sergio
Visibilityshown
Copy HolderSID/SCD
Archiving Policydenypublisher denyfinaldraft12
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI
Host Collectionsid.inpe.br/banon/2003/08.15.17.40
6. Notes
Empty Fieldsalternatejournal 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 


Close