IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v258y2017i2d10.1007_s10479-016-2255-8.html
   My bibliography  Save this article

Primal and dual bounds for the vertex p-median problem with balance constraints

Author

Listed:
  • Juan A. Díaz

    (Universidad de las Américas Puebla)

  • Dolores E. Luna

    (Universidad de las Américas, Puebla)

Abstract

In this paper the vertex p-median problem with balance constraints is studied (i.e. it is required to group a set of objects into groups, balanced with respect to some measures of activity). A Lagrangean relaxation scheme is proposed to obtain lower bounds and a primal heuristic is proposed to obtain upper bounds for the problem. A heuristic procedure is used to obtain feasible solutions for the problem. This heuristic procedure first provides feasible allocations given a set of medians, then improves the solutions using a median exchange procedure. Two set of instances are used to test all methods. Computational results show that the proposed methods provide good lower and upper bounds in reasonable computing times.

Suggested Citation

  • Juan A. Díaz & Dolores E. Luna, 2017. "Primal and dual bounds for the vertex p-median problem with balance constraints," Annals of Operations Research, Springer, vol. 258(2), pages 613-638, November.
    • Handle: RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-016-2255-8
    DOI: 10.1007/s10479-016-2255-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2255-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-016-2255-8?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. Samad Ahmadi & Ibrahim Osman, 2004. "Density Based Problem Space Search for the Capacitated Clustering p-Median Problem," Annals of Operations Research, Springer, vol. 131(1), pages 21-43, October.
    2. Muyldermans, L. & Cattrysse, D. & Van Oudheusden, D. & Lotan, T., 2002. "Districting for salt spreading operations," European Journal of Operational Research, Elsevier, vol. 139(3), pages 521-532, June.
    3. María Salazar-Aguilar & Roger Ríos-Mercado & Mauricio Cabrera-Ríos, 2011. "New Models for Commercial Territory Design," Networks and Spatial Economics, Springer, vol. 11(3), pages 487-507, September.
    4. Bozkaya, Burcin & Erkut, Erhan & Laporte, Gilbert, 2003. "A tabu search heuristic and adaptive memory procedure for political districting," European Journal of Operational Research, Elsevier, vol. 144(1), pages 12-26, January.
    5. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    6. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    7. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    8. Ricca, Federica & Simeone, Bruno, 2008. "Local search algorithms for political districting," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1409-1426, September.
    9. Scheuerer, Stephan & Wendolsky, Rolf, 2006. "A scatter search heuristic for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 533-547, March.
    10. Fernando Tavares-Pereira & José Figueira & Vincent Mousseau & Bernard Roy, 2007. "Multiple criteria districting problems," Annals of Operations Research, Springer, vol. 154(1), pages 69-92, October.
    11. Paul Bergey & Cliff Ragsdale & Mangesh Hoskote, 2003. "A Simulated Annealing Genetic Algorithm for the Electrical Power Districting Problem," Annals of Operations Research, Springer, vol. 121(1), pages 33-55, July.
    Full references (including those not matched with items on IDEAS)

    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. Antonio Diglio & Stefan Nickel & Francisco Saldanha-da-Gama, 2020. "Towards a stochastic programming modeling framework for districting," Annals of Operations Research, Springer, vol. 292(1), pages 249-285, September.
    2. Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
    3. Steiner, Maria Teresinha Arns & Datta, Dilip & Steiner Neto, Pedro José & Scarpin, Cassius Tadeu & Rui Figueira, José, 2015. "Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil," Omega, Elsevier, vol. 52(C), pages 53-64.
    4. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    5. Alexander Butsch & Jörg Kalcsics & Gilbert Laporte, 2014. "Districting for Arc Routing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 809-824, November.
    6. Mai, Feng & Fry, Michael J. & Ohlmann, Jeffrey W., 2018. "Model-based capacitated clustering with posterior regularization," European Journal of Operational Research, Elsevier, vol. 271(2), pages 594-605.
    7. Rui Fragoso & Conceição Rego & Vladimir Bushenkov, 2016. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 14(2), pages 179-198, December.
    8. Douglas M. King & Sheldon H. Jacobson & Edward C. Sewell & Wendy K. Tam Cho, 2012. "Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning," Operations Research, INFORMS, vol. 60(5), pages 1213-1228, October.
    9. Diglio, Antonio & Peiró, Juanjo & Piccolo, Carmela & Saldanha-da-Gama, Francisco, 2021. "Solutions for districting problems with chance-constrained balancing requirements," Omega, Elsevier, vol. 103(C).
    10. Anderson Kenji Hirose & Cassius Tadeu Scarpin & José Eduardo Pécora Junior, 2020. "Goal programming approach for political districting in Santa Catarina State: Brazil," Annals of Operations Research, Springer, vol. 287(1), pages 209-232, April.
    11. M. Salazar-Aguilar & Roger Ríos-Mercado & José González-Velarde & Julián Molina, 2012. "Multiobjective scatter search for a commercial territory design problem," Annals of Operations Research, Springer, vol. 199(1), pages 343-360, October.
    12. Camacho-Collados, M. & Liberatore, F. & Angulo, J.M., 2015. "A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector," European Journal of Operational Research, Elsevier, vol. 246(2), pages 674-684.
    13. Maria da Conceição Rego & Rui Fragoso & Vladimir Bushenkov, 2014. "Clustering of Territorial Areas: A Multi-Criteria Districting Problem," ERSA conference papers ersa14p218, European Regional Science Association.
    14. Eduardo Álvarez-Miranda & Camilo Campos-Valdés & Maurcio Morales Quiroga & Matías Moreno-Faguett & Jordi Pereira, 2020. "A Multi-Criteria Pen for Drawing Fair Districts: When Democratic and Demographic Fairness Matter," Mathematics, MDPI, vol. 8(9), pages 1-26, August.
    15. Fernando Tavares-Pereira & José Figueira & Vincent Mousseau & Bernard Roy, 2007. "Multiple criteria districting problems," Annals of Operations Research, Springer, vol. 154(1), pages 69-92, October.
    16. Yanık, Seda & Sürer, Özge & Öztayşi, Başar, 2016. "Designing sustainable energy regions using genetic algorithms and location-allocation approach," Energy, Elsevier, vol. 97(C), pages 161-172.
    17. Tavares Pereira, Fernando & Figueira, José Rui & Mousseau, Vincent & Roy, Bernard, 2009. "Comparing two territory partitions in districting problems: Indices and practical issues," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 72-88, March.
    18. Sandoval, M. Gabriela & Álvarez-Miranda, Eduardo & Pereira, Jordi & Ríos-Mercado, Roger Z. & Díaz, Juan A., 2022. "A novel districting design approach for on-time last-mile delivery: An application on an express postal company," Omega, Elsevier, vol. 113(C).
    19. Verónica Arredondo & Miguel Martínez-Panero & Teresa Peña & Federica Ricca, 2021. "Mathematical political districting taking care of minority groups," Annals of Operations Research, Springer, vol. 305(1), pages 375-402, October.
    20. Balázs Fleiner & Balázs Nagy & Attila Tasnádi, 2017. "Optimal partisan districting on planar geographies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 879-888, December.

    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:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-016-2255-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.