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

A branch-and-price approach for the continuous multifacility monotone ordered median problem

Author

Listed:
  • Blanco, Víctor
  • Gázquez, Ricardo
  • Ponce, Diego
  • Puerto, Justo

Abstract

In this paper, we address the Continuous Multifacility Monotone Ordered Median Problem. The goal of this problem is to locate p facilities in Rd minimizing a monotone ordered weighted median function of the distances between given demand points and its closest facility. We propose a new branch-and-price procedure for this problem, and three families of matheuristics based on: solving heuristically the pricer problem, aggregating the demand points, and discretizing the decision space. We give detailed discussions of the validity of the exact formulations and also specify the implementation details of all the solution procedures. Besides, we assess their performances in an extensive computational experience that shows the superiority of the branch-and-price approach over the compact formulation in medium-sized instances. To handle larger instances it is advisable to resort to the matheuristics that also report rather good results.

Suggested Citation

  • Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    • Handle: RePEc:eee:ejores:v:306:y:2023:i:1:p:105-126
    DOI: 10.1016/j.ejor.2022.07.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722005744
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.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. Calvino, José J. & López-Haro, Miguel & Muñoz-Ocaña, Juan M. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "Segmentation of scanning-transmission electron microscopy images using the ordered median problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 671-687.
    2. Prahalad Venkateshan & Kamlesh Mathur, 2015. "A Heuristic for the Multisource Weber Problem with Service Level Constraints," Transportation Science, INFORMS, vol. 49(3), pages 472-483, August.
    3. Said Fourour & Yahia Lebbah, 2020. "Equitable Optimization for Multicast Communication," International Journal of Decision Support System Technology (IJDSST), IGI Global, vol. 12(3), pages 1-25, July.
    4. James E. Ward & Richard E. Wendell, 1985. "Using Block Norms for Location Modeling," Operations Research, INFORMS, vol. 33(5), pages 1074-1090, October.
    5. Gerhard Reinelt, 1992. "Fast Heuristics for Large Geometric Traveling Salesman Problems," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 206-217, May.
    6. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    7. Beasley, J. E., 1985. "A note on solving large p-median problems," European Journal of Operational Research, Elsevier, vol. 21(2), pages 270-273, August.
    8. Gerhard Reinelt, 1991. "TSPLIB—A Traveling Salesman Problem Library," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 376-384, November.
    9. Benati, Stefano & Ponce, Diego & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "A branch-and-price procedure for clustering data that are graph connected," European Journal of Operational Research, Elsevier, vol. 297(3), pages 817-830.
    10. Lina Mallozzi & Justo Puerto & Moisés Rodríguez-Madrena, 2019. "On Location-Allocation Problems for Dimensional Facilities," Journal of Optimization Theory and Applications, Springer, vol. 182(2), pages 730-767, August.
    11. Jacques Desrosiers & Marco E. Lübbecke, 2005. "A Primer in Column Generation," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 1-32, Springer.
    12. Víctor M. Albornoz & Gabriel E. Zamora, 2021. "Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 248-265, April.
    13. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    14. Carrizosa, E. & Munoz-Marquez, M. & Puerto, J., 1998. "The Weber problem with regional demand," European Journal of Operational Research, Elsevier, vol. 104(2), pages 358-365, January.
    15. Rosing, K. E., 1992. "An optimal method for solving the (generalized) multi-Weber problem," European Journal of Operational Research, Elsevier, vol. 58(3), pages 414-426, May.
    16. Sándor P. Fekete & Joseph S. B. Mitchell & Karin Beurer, 2005. "On the Continuous Fermat-Weber Problem," Operations Research, INFORMS, vol. 53(1), pages 61-76, February.
    17. Marín, Alfredo & Ponce, Diego & Puerto, Justo, 2020. "A fresh view on the Discrete Ordered Median Problem based on partial monotonicity," European Journal of Operational Research, Elsevier, vol. 286(3), pages 839-848.
    18. Samuel Deleplanque & Martine Labbé & Diego Ponce & Justo Puerto, 2020. "A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 582-599, July.
    19. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    20. Giovanni Righini & Luca Zaniboni, 2007. "A branch-and-price algorithm for the multi-source Weber problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(2), pages 188-207.
    21. Leon Cooper, 1963. "Location-Allocation Problems," Operations Research, INFORMS, vol. 11(3), pages 331-343, June.
    22. Hanif D. Sherali & Frederick L. Nordai, 1988. "NP-Hard, Capacitated, Balanced p -Median Problems on a Chain Graph with a Continuum of Link Demands," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 32-49, February.
    23. Víctor Blanco, 2019. "Ordered p-median problems with neighbourhoods," Computational Optimization and Applications, Springer, vol. 73(2), pages 603-645, June.
    24. Alfredo Marín & Stefan Nickel & Sebastian Velten, 2010. "An extended covering model for flexible discrete and equity location problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 71(1), pages 125-163, February.
    25. Olender, Paweł & Ogryczak, Włodzimierz, 2019. "A revised Variable Neighborhood Search for the Discrete Ordered Median Problem," European Journal of Operational Research, Elsevier, vol. 274(2), pages 445-465.
    26. Sourour Elloumi & Martine Labbé & Yves Pochet, 2004. "A New Formulation and Resolution Method for the p-Center Problem," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 84-94, February.
    27. Blanco, Víctor & Puerto, Justo & Ben-Ali, Safae El-Haj, 2016. "Continuous multifacility ordered median location problems," European Journal of Operational Research, Elsevier, vol. 250(1), pages 56-64.
    28. J. Puerto, 2020. "An exact completely positive programming formulation for the discrete ordered median problem: an extended version," Journal of Global Optimization, Springer, vol. 77(2), pages 341-359, June.
    29. Victor Blanco & Justo Puerto & Safae El Haj Ben Ali, 2014. "Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms," Computational Optimization and Applications, Springer, vol. 58(3), pages 563-595, July.
    30. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    31. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    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. Ljubić, Ivana & Pozo, Miguel A. & Puerto, Justo & Torrejón, Alberto, 2024. "Benders decomposition for the discrete ordered median problem," European Journal of Operational Research, Elsevier, vol. 317(3), pages 858-874.
    2. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    3. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.

    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. Marín, Alfredo & Ponce, Diego & Puerto, Justo, 2020. "A fresh view on the Discrete Ordered Median Problem based on partial monotonicity," European Journal of Operational Research, Elsevier, vol. 286(3), pages 839-848.
    2. Ljubić, Ivana & Pozo, Miguel A. & Puerto, Justo & Torrejón, Alberto, 2024. "Benders decomposition for the discrete ordered median problem," European Journal of Operational Research, Elsevier, vol. 317(3), pages 858-874.
    3. Calvino, José J. & López-Haro, Miguel & Muñoz-Ocaña, Juan M. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "Segmentation of scanning-transmission electron microscopy images using the ordered median problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 671-687.
    4. Enrique Domínguez & Alfredo Marín, 2020. "Discrete ordered median problem with induced order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 793-813, October.
    5. İ K Altınel & N Aras & K C Özkısacık, 2011. "Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(10), pages 1813-1826, October.
    6. Pawel Kalczynski & Jack Brimberg & Zvi Drezner, 2022. "Less is more: discrete starting solutions in the planar p-median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 34-59, April.
    7. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    8. Ponce, Diego & Puerto, Justo & Temprano, Francisco, 2024. "Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks," European Journal of Operational Research, Elsevier, vol. 316(2), pages 519-538.
    9. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    10. 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.
    11. Víctor Blanco, 2019. "Ordered p-median problems with neighbourhoods," Computational Optimization and Applications, Springer, vol. 73(2), pages 603-645, June.
    12. Luisa I. Martínez-Merino & Diego Ponce & Justo Puerto, 2023. "Constraint relaxation for the discrete ordered median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(3), pages 538-561, October.
    13. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    14. Jesus Garcia-Diaz & Jairo Sanchez-Hernandez & Ricardo Menchaca-Mendez & Rolando Menchaca-Mendez, 2017. "When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem," Journal of Heuristics, Springer, vol. 23(5), pages 349-366, October.
    15. Mauricio Resende & Renato Werneck, 2007. "A fast swap-based local search procedure for location problems," Annals of Operations Research, Springer, vol. 150(1), pages 205-230, March.
    16. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    17. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    18. Daniel Martins & Gabriel M. Vianna & Isabel Rosseti & Simone L. Martins & Alexandre Plastino, 2018. "Making a state-of-the-art heuristic faster with data mining," Annals of Operations Research, Springer, vol. 263(1), pages 141-162, April.
    19. Jing Yao & Alan T. Murray, 2014. "Serving regional demand in facility location," Papers in Regional Science, Wiley Blackwell, vol. 93(3), pages 643-662, August.
    20. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.

    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:306:y:2023:i:1:p:105-126. 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.