IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v234y2014i3p802-808.html
   My bibliography  Save this article

A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem

Author

Listed:
  • Rabello, Rômulo Louzada
  • Mauri, Geraldo Regis
  • Ribeiro, Glaydston Mattos
  • Lorena, Luiz Antonio Nogueira

Abstract

The Point-Feature Cartographic Label Placement (PFCLP) problem consists of placing text labels to point features on a map avoiding overlaps to improve map visualization. This paper presents a Clustering Search (CS) metaheuristic as a new alternative to solve the PFCLP problem. Computational experiments were performed over sets of instances with up to 13,206 points. These instances are the same used in several recent and important researches about the PFCLP problem. The results enhance the potential of CS by finding optimal solutions (proven in previous works) and improving the best-known solutions for instances whose optimal solutions are unknown so far.

Suggested Citation

  • Rabello, Rômulo Louzada & Mauri, Geraldo Regis & Ribeiro, Glaydston Mattos & Lorena, Luiz Antonio Nogueira, 2014. "A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 802-808.
    • Handle: RePEc:eee:ejores:v:234:y:2014:i:3:p:802-808
    DOI: 10.1016/j.ejor.2013.10.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713008448
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.10.021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Oleg V. Verner & Roger L. Wainwright & Dale A. Schoenefeld, 1997. "Placing Text Labels on Maps and Diagrams using Genetic Algorithms with Masking," INFORMS Journal on Computing, INFORMS, vol. 9(3), pages 266-275, August.
    2. Steven Zoraster, 1990. "The Solution of Large 0–1 Integer Programming Problems Encountered in Automated Cartography," Operations Research, INFORMS, vol. 38(5), pages 752-759, October.
    3. Alvim, Adriana C.F. & Taillard, Éric D., 2009. "POPMUSIC for the point feature label placement problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 396-413, January.
    4. Ribeiro, Glaydston Mattos & Laporte, Gilbert & Mauri, Geraldo Regis, 2012. "A comparison of three metaheuristics for the workover rig routing problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 28-36.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alvim, Adriana C.F. & Taillard, Éric D., 2009. "POPMUSIC for the point feature label placement problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 396-413, January.
    2. Glaydston Mattos Ribeiro & Luiz Antonio Nogueira Lorena, 2008. "Column generation approach for the point-feature cartographic label placement problem," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 147-164, February.
    3. Doi, Tsubasa & Nishi, Tatsushi & Voß, Stefan, 2018. "Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time," European Journal of Operational Research, Elsevier, vol. 267(2), pages 428-438.
    4. Bakker, Steffen J. & Wang, Akang & Gounaris, Chrysanthos E., 2021. "Vehicle routing with endogenous learning: Application to offshore plug and abandonment campaign planning," European Journal of Operational Research, Elsevier, vol. 289(1), pages 93-106.
    5. Albert Einstein Fernandes Muritiba & Tibérius O. Bonates & Stênio Oliveira Da Silva & Manuel Iori, 2021. "Branch-and-Cut and Iterated Local Search for the Weighted k -Traveling Repairman Problem: An Application to the Maintenance of Speed Cameras," Transportation Science, INFORMS, vol. 55(1), pages 139-159, 1-2.
    6. Boldizsár Tüű-Szabó & Péter Földesi & László T. Kóczy, 2024. "An Efficient Tour Construction Heuristic for Generating the Candidate Set of the Traveling Salesman Problem with Large Sizes," Mathematics, MDPI, vol. 12(19), pages 1-21, September.
    7. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
    8. Zhang, Guoqing & Nishi, Tatsushi & Turner, Sarina D.O. & Oga, Keisuke & Li, Xindan, 2017. "An integrated strategy for a production planning and warehouse layout problem: Modeling and solution approaches," Omega, Elsevier, vol. 68(C), pages 85-94.
    9. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    10. Lin, Edward Y. H. & Bricker, Dennis L., 1996. "Computational comparison on the partitioning strategies in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 88(1), pages 182-202, January.
    11. Eduardo Lalla-Ruiz & Stefan Voß & Christopher Expósito-Izquierdo & Belén Melián-Batista & J. Marcos Moreno-Vega, 2017. "A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations," Annals of Operations Research, Springer, vol. 253(2), pages 871-897, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:234:y:2014:i:3:p:802-808. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.