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

Deterministic and stochastic global optimization techniques for planar covering with ellipses problems

Author

Listed:
  • Andretta, M.
  • Birgin, E.G.

Abstract

Problems of planar covering with ellipses are tackled in this work. Ellipses can have a fixed angle or each of them can be freely rotated. Deterministic global optimization methods are developed for both cases, while a stochastic version of the method is also proposed for large instances of the latter case. Numerical results show the effectiveness and efficiency of the proposed methods.

Suggested Citation

  • Andretta, M. & Birgin, E.G., 2013. "Deterministic and stochastic global optimization techniques for planar covering with ellipses problems," European Journal of Operational Research, Elsevier, vol. 224(1), pages 23-40.
    • Handle: RePEc:eee:ejores:v:224:y:2013:i:1:p:23-40
    DOI: 10.1016/j.ejor.2012.07.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712005619
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.07.020?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. Birgin, E. G. & Martinez, J. M. & Ronconi, D. P., 2005. "Optimizing the packing of cylinders into a rectangular container: A nonlinear approach," European Journal of Operational Research, Elsevier, vol. 160(1), pages 19-33, January.
    2. Berman, Oded & Krass, Dmitry & Drezner, Zvi, 2003. "The gradual covering decay location problem on a network," European Journal of Operational Research, Elsevier, vol. 151(3), pages 474-480, December.
    3. Li, Lushu & Kabadi, S. N. & Nair, K. P. K., 2002. "Fuzzy versions of the covering circle problem," European Journal of Operational Research, Elsevier, vol. 137(1), pages 93-109, February.
    4. H Younies & G O Wesolowsky, 2007. "Planar maximal covering location problem under block norm distance measure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 740-750, June.
    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. Tedeschi, Danilo & Andretta, Marina, 2021. "New exact algorithms for planar maximum covering location by ellipses problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 114-127.
    2. Liu, Yanchao, 2023. "An elliptical cover problem in drone delivery network design and its solution algorithms," European Journal of Operational Research, Elsevier, vol. 304(3), pages 912-925.
    3. Blanco, Víctor & Puerto, Justo, 2021. "Covering problems with polyellipsoids: A location analysis perspective," European Journal of Operational Research, Elsevier, vol. 289(1), pages 44-58.

    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. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    2. Arana-Jiménez, Manuel & Blanco, Víctor & Fernández, Elena, 2020. "On the fuzzy maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 283(2), pages 692-705.
    3. Erhan Erkut & Armann Ingolfsson & Güneş Erdoğan, 2008. "Ambulance location for maximum survival," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 42-58, February.
    4. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    5. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    6. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Karatas, Mumtaz, 2017. "A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1040-1051.
    8. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    9. Oded Berman & Dmitry Krass, 2005. "An Improved IP Formulation for the Uncapacitated Facility Location Problem: Capitalizing on Objective Function Structure," Annals of Operations Research, Springer, vol. 136(1), pages 21-34, April.
    10. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    11. Seyed Sina Mohri & Meisam Akbarzadeh, 2019. "Locating key stations of a metro network using bi-objective programming: discrete and continuous demand mode," Public Transport, Springer, vol. 11(2), pages 321-340, August.
    12. Jimenez, Charlotte & Dauzère-Pérès, Stéphane & Feuillebois, Christian & Pauly, Eric, 2013. "Optimizing the positioning and technological choices of RFID elements for aircraft part identification," European Journal of Operational Research, Elsevier, vol. 227(2), pages 350-357.
    13. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2020. "Gradual cover competitive facility location," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 333-354, June.
    14. Narjes Sabeghi & Hamed Reza Tareghian, 2020. "Using the generalized maximum covering location model to control a project’s progress," Computational Management Science, Springer, vol. 17(1), pages 1-21, January.
    15. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    16. Vatsa, Amit Kumar & Ghosh, Diptesh, 2014. "Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-11-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Menezes, Mozart B.C. & Kim, Seokjin & Huang, Rongbing, 2015. "Return-on-investment (ROI) criteria for network design," European Journal of Operational Research, Elsevier, vol. 245(1), pages 100-108.
    18. Bababeik, Mostafa & Khademi, Navid & Chen, Anthony, 2018. "Increasing the resilience level of a vulnerable rail network: The strategy of location and allocation of emergency relief trains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 119(C), pages 110-128.
    19. Vatsa, Amit Kumar, 2014. "Multi-Period Facility Location Problem with an Uncertain Number of Servers," IIMA Working Papers WP2014-02-06, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Huang, Wenqi & Ye, Tao, 2011. "Global optimization method for finding dense packings of equal circles in a circle," European Journal of Operational Research, Elsevier, vol. 210(3), pages 474-481, May.

    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:224:y:2013:i:1:p:23-40. 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.