A greedy randomized adaptive search procedure for the point-feature cartographic label placement

  • Authors:
  • Gildásio Lecchi Cravo;Glaydston Mattos Ribeiro;Luiz Antonio Nogueira Lorena

  • Affiliations:
  • UNIARACRUZ, Faculty of Aracruz, 29.194-910 Aracruz, ES, Brazil;UFES, Federal University of Espírito Santo, 29.933-480 São Mateus, ES, Brazil and INPE, Brazilian Space Research Institute, 12.227-010 São José dos Campos, SP, Brazil;INPE, Brazilian Space Research Institute, 12.227-010 São José dos Campos, SP, Brazil

  • Venue:
  • Computers & Geosciences
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The 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. Owing 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.