Skip to main content
SpringerLink
Log in

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

  • S.I.: CLAIO 2014
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Ahmadi, S., & Osman, I. H. (2004). Density based problem space search for the capacitated clustering \(p\)-median problem. Annals of Operations Research, 131, 21–43.

  • Bergey, P. K., Ragsdale, C. T., & Hoskote, M. (2003). A simulated annealing genetic algorithm for the electrical power districting problem. Annals of Operations Research, 121, 33–55.

    Article  Google Scholar 

  • Boccia, M., Sforza, A., Sterle, C., & Vasilyev, I. (2008). A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes. Journal of Mathematical Modelling and Algorithms, 7, 43–58.

    Article  Google Scholar 

  • Bozkaya, B., Erkut, E., & Laporte, G. (2003). A tabu search heuristic and adaptive memory procedure for political districting. European Journal of Operational Research, 144, 12–26.

    Article  Google Scholar 

  • Ceselli, A. (2003). Two exact algorithms for the capacitated \(p\)-median problem. 4OR: Quarterly Journal of Operations Research, 1, 319–340.

    Google Scholar 

  • Ceselli, A., & Righini, G. (2005). A branch and price algorithm for the capacitated \(p\)-median problem. Networks, 45, 125–142.

    Article  Google Scholar 

  • D’amico, S. J., Wang, S., Batta, R., & Rump, C. M. (2002). A simulated annealing approach to police district design. Computers and Operations Research, 29, 667–684.

    Article  Google Scholar 

  • Díaz, J. A., & Fernández, E. (2006). Hybrid scatter search and path relinking for the capacitated \(p\)-median problem. European Journal of Operational Research, 169, 570–585.

  • Elizondo-Amaya, M. G., Ríos-Mercado, R. Z., & Díaz, J. A. (2014). A dual bounding scheme for a territory design problem. Computers and Operations Research, 44, 193–205.

    Article  Google Scholar 

  • Fleszar, K., & Hindi, K. S. (2008). An effective VNS for the capacitated \(p\)-median problem. European Journal of Operational Research, 191, 612–622.

  • Hojati, M. (1996). Optimal political districting. Computers and Operations Research, 23, 1147–1161.

    Article  Google Scholar 

  • Kalcsics, J., Nickel, S., & Schröder, M. (2005). Towards a unified territory design approach—applications, algorithms and GIS integration. TOP, 13, 1–56.

  • Lorena, L. A. N., & Senne, E. L. F. (2004). A column generation approach for the capacitated \(p\)-median problem. Computers and Operations Research, 31, 863–876.

    Article  Google Scholar 

  • Mladenović, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J. A. (2007). The \(p\)-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179, 927–939.

  • Muyldermans, L., Cattrysse, D., Van Oudheusden, D., & Lotan, T. (2002). Districting for salt spreading operations. European Journal of Operational Research, 139, 521–532.

    Article  Google Scholar 

  • Porumbel, D., & Goncalves, G. (2015). Using dual feasible functions to construct fast lower bounds for routing and location problems. Discrete Applied Mathematics, 196, 83–99.

    Article  Google Scholar 

  • Reese, J. (2006). Solution methods the \(p\)-median problem: An annotated bibliography. Networks, 48, 125–142.

    Article  Google Scholar 

  • Ricca, F., & Simeone, B. (2008). Local search algorithms for political districting. European Journal of Operational Research, 189, 1409–1426.

    Article  Google Scholar 

  • Ricca, F., Scozzari, A., & Simeone, B. (2013). Political districting: From classical models to recent approaches. Annals of Operations Research, 204, 271–299.

    Article  Google Scholar 

  • Ríos-Mercado, R. Z., & Fernández, E. (2009). A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Computers and Operations Research, 36, 755–776.

    Article  Google Scholar 

  • Ríos-Mercado, R. Z., & López-Pérez, J. F. (2013). Commercial territory design planning with realignment and disjoint assignment requirements. Omega, 41, 525–535.

    Article  Google Scholar 

  • Salazar-Aguilar, M. A., Ríos-Mercado, R. Z., & Cabrera-Ríos, M. (2011). New models for commercial territory design. Network and Spatial Economics, 11, 487–507.

  • Scheuerer, S., & Wendolsky, R. (2006). A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research, 169, 533–547.

    Article  Google Scholar 

  • Tavares-Pereira, F., Figueira, J. R., Mousseau, V., & Roy, B. (2007). Multiple criteria districting problems. Annals of Operations Research, 154, 69–92.

    Article  Google Scholar 

  • Yaghini, M., Karimi, M., & Rahbar, M. (2013). A hybrid metaheuristic approach for the capacitated \(p\)-median problem. Applied Soft Computing, 13, 3922–3930.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Actuaría, Física y Matemáticas, Universidad de las Américas Puebla, Ex. Hda. Santa Catarina Mártir, 72820, Cholula, Puebla, Mexico

    Juan A. Díaz

  2. Departamento de Ingeniería Industrial, Mecánica y Logística, Universidad de las Américas, Puebla, Ex. Hda. Santa Catarina Mártir, 72820, Cholula, Puebla, Mexico

    Dolores E. Luna

Authors
  1. Juan A. Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dolores E. Luna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Juan A. Díaz.

Appendix

Appendix

See Tables 6 and 7.

Table 6 Detailed computational experiment results first set of instances
Full size table
Table 7 Detailed computational experiment results second set of instances
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Díaz, J.A., Luna, D.E. Primal and dual bounds for the vertex p-median problem with balance constraints. Ann Oper Res 258, 613–638 (2017). https://doi.org/10.1007/s10479-016-2255-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2255-8

Keywords

Search

Navigation