Close

1. Identity statement
Reference TypeJournal Article
Sitemtc-m16b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Repositorysid.inpe.br/mtc-m17@80/2007/06.04.13.30   (restricted access)
Last Update2008:06.05.19.04.57 (UTC) administrator
Metadata Repositorysid.inpe.br/mtc-m17@80/2007/06.04.13.30.08
Metadata Last Update2018:06.05.03.30.23 (UTC) administrator
Secondary KeyINPE--PRE/
DOI10.1016/j.cageo.2007.01.007
ISSN0098-3004
Citation KeyCravoRibeLore:2008:GrRaAd
TitleA greedy randomized adaptive search procedure for the point-feature cartographic label placement
Year2008
MonthApr.
Access Date2024, Apr. 28
Secondary TypePRE PI
Number of Files1
Size1059 KiB
2. Context
Author1 Cravo, G. L.
2 Riberiro, G. M.
3 Lorena, Luiz Antonio Nogueira
Resume Identifier1
2
3 8JMKD3MGP5W/3C9JHMQ
Group1
2
3 LAC-CTE-INPE-MCT-BR
Affiliation1 Faculdade de Aracruz (UNIARACRUZ)
2 Universidade Federal do Espírito Santo (UFES)
3 Instituto Nacional de Pesquisas Espaciais (INPE)
JournalComputers and Geosciences
Volume34
Number4
Pages373-386
History (UTC)2008-06-05 19:04:58 :: simone -> administrator ::
2010-05-11 02:41:22 :: administrator -> simone ::
2011-10-31 12:02:51 :: simone -> administrator :: 2008
2012-10-10 12:26:20 :: administrator -> simone :: 2008
2013-02-20 15:19:57 :: simone -> administrator :: 2008
2018-06-05 03:30:23 :: administrator -> marciana :: 2008
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Version Typepublisher
KeywordsGRASP
Heuristic
Label placement
COMPUTAÇÂO APLICADA
AbstractThe point-feature cartographic label placement problem (PFCLP) is an NP-hard problem which appears during the production of maps. The labels must be placed in predefined places avoiding overlaps and considering cartographic preferences. Due to its high complexity several heuristics have been presented searching for approximated solutions. This paper proposes a greedy randomized adaptive search procedure (GRASP) for the PFCLP that is based on its associated conflict graph. The computational results show that this metaheuristic is a good strategy for PFCLP, generating better solutions than all those reported in the literature in reasonable computational times.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > A greedy randomized...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filea greedy randomized.pdf
User Groupadministrator
simone
Visibilityshown
Archiving Policydenypublisher denyfinaldraft24
Read Permissiondeny from all and allow from 150.163
Update Permissionnot transferred
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationWEBSCI; PORTALCAPES.
Host Collectionlcp.inpe.br/ignes/2004/02.12.18.39
cptec.inpe.br/walmeida/2003/04.25.17.12
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel e-mailaddress electronicmailaddress format identifier isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url
7. Description control
e-Mail (login)marciana
update 


Close