SciELO - Scientific Electronic Library Online

 
vol.26 número3Desenvolvimento de um protótipo de um sistema de informação geográfica para abordagem do problema de localização de antenasHeurísticas para o problema de corte de estoque unidimensional inteiro índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

Compartilhar


Pesquisa Operacional

versão impressa ISSN 0101-7438versão On-line ISSN 1678-5142

Resumo

RIBEIRO, Glaydston Mattos  e  LORENA, Luiz Antonio Nogueira. Lagrangean relaxation bounds for point-feature cartographic label placement problem. Pesqui. Oper. [online]. 2006, vol.26, n.3, pp.459-471. ISSN 0101-7438.  https://doi.org/10.1590/S0101-74382006000300002.

The objective of the point-feature cartographic label placement problem (PFCLP) is to give more legibility to an automatic map creation, placing point labels in clear positions. Many researchers consider distinct approaches for PFCLP, such as to obtain the maximum number of labeled points that can be placed without overlapping or to obtain the maximum number of labeled points without overlaps considering that all points must be labeled. This paper considers another variant of the problem in which one has to minimize the number of overlaps while all points are labeled in the map. A conflict graph is initially defined and a mathematical formulation of binary integer linear programming is presented. Commercial optimization packages could not solve large instances exactly using this formulation over instances proposed in the literature. A heuristic is then examined considering a Lagrangean relaxation performed after an initial partition of the conflict graph into clusters. This decomposition allowed us to introduce tight lower and upper bounds for PFCLP.

Palavras-chave : label placement; modeling; Lagrangean relaxation.

        · resumo em Português     · texto em Inglês     · Inglês ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons