Skip to main content
Log in

A short note on locating facilities on a path to minimize load range equity measure

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This work considers the problem of locating \(p\) facilities on the nodes of a path such that the range of the weights assigned to facilities will be as small as possible. We present a polynomial progressive search algorithm to solve the problem.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Balinski, M. L., & Young, H. P. (2001). Fair representation, meeting the ideal of one man, one vote (2nd ed.). Washington, DC: Brookings Institution Press.

    Google Scholar 

  • Baron, O., Berman, O., & Krass, D. (2008). Facility location with stochastic demand and constraints on waiting time. Manufacturing and Service Operations Management, 10(3), 484–505.

    Article  Google Scholar 

  • Baron, O., Berman, O., Krass, D., & Wang, Q. (2007). The equitable location problem on the plane. European Journal of Operational Research, 183, 578–590.

    Article  Google Scholar 

  • Berman, O., Drezner, Z., Tamir, A., & Wesolowsky, G. O. (2009). Optimal location with equitable loads. Annals of Operations Research, 167, 307–325.

    Article  Google Scholar 

  • Cavalier, T., Conner, W., Delcastillo, E., & Brown, S. (2007). A heuristic algorithm for minimax sensor location in the plane. European Journal of Operational Research, 183(1), 42–55.

    Article  Google Scholar 

  • Drezner, Z., Thisse, J.-F., & Wesolowsky, G. O. (1986). The minimax-min location problem. Journal of Regional Science, 26, 87–101.

    Article  Google Scholar 

  • Edelman, P. H. (2006). Minimum total deviation apportionments. In B. Simeone & F. Pukelsheim (Eds.), Mathematics and democracy. Berlin: Springer.

    Google Scholar 

  • Lucertini, M., & Simeone, B. (1993). Most uniform path partitioning its use in image processing. Discrete Applied Mathematics, 42, 227–256.

    Article  Google Scholar 

  • Marsh, M., & Schilling, D. (1994). Equity measurement in facility location analysis: A review and framework. European Journal of Operational Research, 74, 1–17.

    Article  Google Scholar 

  • Mesa, J. A., & Puerto, J. (2003). Improved algorithms for several network location problems with equality measures. Discrete Applied Mathematics, 130, 437–448.

    Article  Google Scholar 

  • Ogryczak, W. (2009). Inequality measures and equitable locations. Annals of Operations Research, 167(1), 61–86.

    Article  Google Scholar 

  • Suzuki, A., & Drezner, Z. (2009). The minimum equitable radius location problem with continuous demand. European Journal of Operational Research, 195, 17–30.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rongbing Huang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, R. A short note on locating facilities on a path to minimize load range equity measure. Ann Oper Res 246, 363–369 (2016). https://doi.org/10.1007/s10479-014-1617-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-014-1617-3

Keywords

Navigation