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

Computers and Geosciences

Volumn 34, Issue 4, 2008, Pages 373-386

  Cravo, Gildásio Lecchi ^a   Ribeiro, Glaydston Mattos ^b,c   Lorena, Luiz Antonio Nogueira ^c  

^a UNIARACRUZ   (Brazil)

^b FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

^c INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

GRASP; Heuristic; Label placement

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; RANDOM PROCESSES;

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; POINT-FEATURE CARTOGRAPHIC LABEL PLACEMENT PROBLEM;

MAPPING;

APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; MAPPING; RANDOM PROCESSES;

CARTOGRAPHY; GRAPHICAL METHOD; HEURISTICS; MAPPING METHOD; NUMERICAL METHOD;

EID: 38049001529     PISSN: 00983004     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cageo.2007.01.007     Document Type: Article

References (41)

1. Abello, J., Pardalos, P.M., Resende, M.G.C., 1999. On maximum clique problems in very large graphs. In: Abello, J., Vitter, J. (Eds.), External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 119-130.
2. Aiex R.M., Binato S., and Resende M.G.C. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing 29 (2003) 393-430
3. Atkinson J.B. A greedy randomized search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. Journal of the Operational Research Society 49 (1998) 700-708
4. Bard J.F., and Feo T.A. Operations sequencing in discrete parts manufacturing. Management Science 35 (1989) 249-255
5. Christensen J., Marks J., and Shieber S. Placing text labels on maps and diagrams. In: Heckbert P. (Ed). Graphics Gems IV (1994), Academic Press Graphics Gems Series, Boston 497-504
6. Christensen J., Marks J., and Shieber S. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics 14 (1995) 203-232
7. Feo T.A., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
8. Feo T.A., and Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
9. Feo T.A., Venkatraman K., and Bard J.F. A GRASP for a difficult single machine scheduling problem. Computers & Operations Research 18 (1991) 635-643
10. Feo T.A., Resende M.G.C., and Smith S.H. A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42 (1994) 860-878
11. Festa P., and Resende M.G.C. GRASP: an annotated bibliography. In: Ribeiro C.C., and Hansen P. (Eds). Essays and Surveys on Metaheuristics (2002), Kluwer Academic Publishers, Dordrecht 325-367
12. Formann, M., Wagner, F., 1991. A packing problem with applications to lettering of maps. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, New Hampshire, pp. 281-288.
13. Glover F. Tabu Search and adaptive memory programming: advances, applications and challenges. In: Barr R.S., Helgason R.V., and Kennington J.L. (Eds). Interfaces in Computer Science and Operations Research (1996), Kluwer Academic Publishers, Dordrecht 1-75
14. Hirsch S.A. An algorithm for automatic name placement around point data. American Cartographer 9 (1982) 5-17
15. Klau G.W., and Mutzel P. Optimal labeling of point features in the slider model. In: Du D.-Z., Eades P., Estivill-Castro V., Lin X., and Sharma A. (Eds). Proceeding of the Sixth Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science 1858 (2000), Springer, Berlin 340-350
16. Klau G.W., and Mutzel P. Optimal labeling of point features in rectangular labeling models. Mathematical Programming Series B 94 (2003) 435-458
17. Laguna M., and Martí R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11 (1999) 44-52
18. Laguna M., and Velarde J.L.G. A search heuristic for just-in-time scheduling in parallel machines. Journal of Intelligent Manufacturing 2 (1991) 253-260
19. Lorena L.A.N., and Furtado J.C. Constructive genetic algorithm for clustering problems. Evolutionary Computation 9 (2001) 309-327
20. Marks, J., Shieber, S., 1991. The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard University, 28pp.
21. Moon I.D., and Chaudhry S. An analysis of network location problems with distance constraints. Management Science 30 (1984) 290-307
22. Murray A.T., and Church R.L. Solving the anti-covering location problem using Lagrangian relaxation. Computers & Operations Research 24 (1996) 127-140
23. Prais M., and Ribeiro C.C. Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12 (2000) 164-176
24. Resende, L.I.P., Resende, M.G.C., 1999. A GRASP for frame relay PVC routing. In: Proceedings of the Third Meta-heuristics International Conference, Angra dos Reis, Brazil, pp. 397-402.
25. Resende M.G.C., and Ribeiro C.C. A GRASP for graph planarization. Networks 9 (1997) 173-189
26. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers, Dordrecht 219-249
27. Resende M.G.C., and Ribeiro C.C. GRASP with path-relinking: recent advances and applications. In: Ibaraki T., Nonobe K., and Yagiura M. (Eds). Metaheuristics: Progress as Real Problem Solvers (2005), Kluwer Academic Publishers, Dordrecht 29-63
28. Ribeiro G.M., and Lorena L.A.N. Heuristics for cartographic label placement problems. Computers & Geosciences 32 (2005) 739-748
29. Ribeiro, G.M., Lorena, L.A.N., 2006. Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Computers & Operations Research, in press.
30. Schreyer, M., Raidl, G.R., 2002. Letting ants labeling point features. In: Proceedings of the 2002 IEEE Congress on Evolutionary Computation at the IEEE World Congress on Computational Intelligence, Honolulu, USA, pp. 1564-1569.
31. Strijk, T., Verweij, B., Aardal, K., 2000. Algorithms for maximum independent set applied to map labeling. Technical Report UU-CS-2000-22, Universiteit Utrecht, The Netherlands, 42pp.
32. Verner O.V., Wainwright R.L., and Schoenefeld D.A. Placing text labels on maps and diagrams using genetic algorithms with masking. INFORMS Journal on Computing 9 (1997) 266-275
33. Wagner F., Wolff A., Kapoor V., and Strijk T. Three rules suffice for good label placement. Algorithmica 30 (2001) 334-349
34. Wolff, A., 1999. Automated label placement in theory and practice. Ph.D. Dissertation, Fachbereich Mathematik und Informatik, Freie Universität, Berlin, 153pp.
35. Yamamoto M., and Lorena L.A.N. A constructive genetic approach to point-feature cartographic label placement. In: Ibaraki T., Nonobe K., and Yagiura M. (Eds). Metaheuristics: Progress as Real Problem Solvers (2005), Kluwer Academic Publishers, Dordrecht 285-300
36. Yamamoto M., Camara G., and Lorena L.A.N. Tabu Search heuristic for point-feature cartographic label placement. Geoinformatica 6 (2002) 77-90
37. Yamamoto, M., Camara, G., Lorena, L.A.N., 2005. Fast point-feature label placement for real time screen maps. In: Proceedings of the Seventh Brazilian Symposium on GeoInformatics, Campos do Jordão, Brazil, pp. 1-13.
38. Zoraster S. Integer programming applied to the map label placement problem. Cartographica 23 (1986) 16-27
39. Zoraster S. The solution of large 0-1 integer programming problems encountered in automated cartography. Operations Research 38 (1990) 752-759
40. Zoraster S. Expert systems and the map label placement problem. Cartographica 28 (1991) 1-9
41. Zoraster S. Practical results using simulated annealing for point feature label placement. Cartography and GIS 24 (1997) 228-238