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

An integer programming approach for solving the p-dispersion problem

Author

Listed:
  • Sayyady, Fatemeh
  • Fathi, Yahya

Abstract

Given a collection of n items (elements) and an associated symmetric distance dij between each pair of items i and j, we seek a subset P of these items (with a given cardinality p) so that the minimum pairwise distance among the selected items is maximized. This problem is known as the max–min diversity problem or the p-dispersion problem, and it is shown to be np-hard. We define a collection of node packing problems associated with each instance of this problem and employ a binary search among these node packing problems to devise an effective procedure for solving the original problem. We employ existing integer programming techniques, i.e., branch-and-bound and strong valid inequalities, to solve these node packing problems. Through a computational experiment we show that this approach can be used to solve relatively large instances of the p-dispersion problem, i.e., instances with more than 1000 items. We also discuss an application of this problem in the context of locating traffic sensors in a highway network.

Suggested Citation

  • Sayyady, Fatemeh & Fathi, Yahya, 2016. "An integer programming approach for solving the p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 216-225.
    • Handle: RePEc:eee:ejores:v:253:y:2016:i:1:p:216-225
    DOI: 10.1016/j.ejor.2016.02.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716300637
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2016.02.026?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. Chaudhry, Sohail S & McCormick, S Thomas & Moon, I Douglas, 1986. "Locating independent facilities with maximum weight: Greedy heuristics," Omega, Elsevier, vol. 14(5), pages 383-389.
    2. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
    3. Erkut, Erhan & Neuman, Susan, 1989. "Analytical models for locating undesirable facilities," European Journal of Operational Research, Elsevier, vol. 40(3), pages 275-291, June.
    4. Erkut, Erhan, 1990. "The discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 46(1), pages 48-60, May.
    5. I. Douglas Moon & Sohail S. Chaudhry, 1984. "An Analysis of Network Location Problems with Distance Constraints," Management Science, INFORMS, vol. 30(3), pages 290-307, March.
    6. S. S. Ravi & D. J. Rosenkrantz & G. K. Tayi, 1994. "Heuristic and Special Case Algorithms for Dispersion Problems," Operations Research, INFORMS, vol. 42(2), pages 299-310, April.
    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. Ramamoorthy, Prasanna & Vidyarthi, Navneet & Verma, Manish, 2024. "Efficient solution approaches for the bi-criteria p-hub median and dispersion problem," European Journal of Operational Research, Elsevier, vol. 314(1), pages 79-93.
    2. Juan F. Gomez & Javier Panadero & Rafael D. Tordecilla & Juliana Castaneda & Angel A. Juan, 2022. "A Multi-Start Biased-Randomized Algorithm for the Capacitated Dispersion Problem," Mathematics, MDPI, vol. 10(14), pages 1-20, July.
    3. Juan F. Gomez & Anna Martínez-Gavara & Javier Panadero & Angel A. Juan & Rafael Martí, 2024. "A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem," Mathematics, MDPI, vol. 12(6), pages 1-22, March.
    4. Spiers, Sandy & Bui, Hoa T. & Loxton, Ryan, 2023. "An exact cutting plane method for the Euclidean max-sum diversity problem," European Journal of Operational Research, Elsevier, vol. 311(2), pages 444-454.
    5. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    6. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.

    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. Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Sánchez-Oro, Jesús, 2022. "A review on discrete diversity and dispersion maximization from an OR perspective," European Journal of Operational Research, Elsevier, vol. 299(3), pages 795-813.
    2. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.
    3. Niblett, Matthew R. & Church, Richard L., 2015. "The disruptive anti-covering location problem," European Journal of Operational Research, Elsevier, vol. 247(3), pages 764-773.
    4. Prokopyev, Oleg A. & Kong, Nan & Martinez-Torres, Dayna L., 2009. "The equitable dispersion problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 59-67, August.
    5. Anna Martínez-Gavara & Vicente Campos & Manuel Laguna & Rafael Martí, 2017. "Heuristic solution approaches for the maximum minsum dispersion problem," Journal of Global Optimization, Springer, vol. 67(3), pages 671-686, March.
    6. Parreño, Francisco & Álvarez-Valdés, Ramón & Martí, Rafael, 2021. "Measuring diversity. A review and an empirical analysis," European Journal of Operational Research, Elsevier, vol. 289(2), pages 515-532.
    7. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Discussion Paper 2008-26, Tilburg University, Center for Economic Research.
    8. Erkut, E. & ReVelle, C. & Ulkusal, Y., 1996. "Integer-friendly formulations for the r-separation problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 342-351, July.
    9. Zhengguan Dai & Kathleen Xu & Melkior Ornik, 2021. "Repulsion-based p-dispersion with distance constraints in non-convex polygons," Annals of Operations Research, Springer, vol. 307(1), pages 75-91, December.
    10. Rennen, G., 2008. "Subset Selection from Large Datasets for Kriging Modeling," Other publications TiSEM 9dfe6396-1933-45c0-b4e3-5, Tilburg University, School of Economics and Management.
    11. Juan F. Gomez & Anna Martínez-Gavara & Javier Panadero & Angel A. Juan & Rafael Martí, 2024. "A Forward–Backward Simheuristic for the Stochastic Capacitated Dispersion Problem," Mathematics, MDPI, vol. 12(6), pages 1-22, March.
    12. Aringhieri, Roberto & Cordone, Roberto & Grosso, Andrea, 2015. "Construction and improvement algorithms for dispersion problems," European Journal of Operational Research, Elsevier, vol. 242(1), pages 21-33.
    13. Amirgaliyeva, Zhazira & Mladenović, Nenad & Todosijević, Raca & Urošević, Dragan, 2017. "Solving the maximum min-sum dispersion by alternating formulations of two different problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 444-459.
    14. Sayah, David & Irnich, Stefan, 2017. "A new compact formulation for the discrete p-dispersion problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 62-67.
    15. Daniel J. Rosenkrantz & Giri K. Tayi & S.S. Ravi, 2000. "Facility Dispersion Problems Under Capacity and Cost Constraints," Journal of Combinatorial Optimization, Springer, vol. 4(1), pages 7-33, March.
    16. David Sayah & Stefan Irnich, 2015. "A New Compact Formulation for Discrete p-Dispersion," Working Papers 1517, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    18. Nicolas Dupin & Frank Nielsen & El-Ghazali Talbi, 2021. "Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front," Mathematics, MDPI, vol. 9(4), pages 1-30, February.
    19. Wang, Yang & Wu, Qinghua & Glover, Fred, 2017. "Effective metaheuristic algorithms for the minimum differential dispersion problem," European Journal of Operational Research, Elsevier, vol. 258(3), pages 829-843.
    20. Murray, Alan T. & Church, Richard L., 1997. "Facets for node packing," European Journal of Operational Research, Elsevier, vol. 101(3), pages 598-608, September.

    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:253:y:2016:i:1:p:216-225. 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.