Skip to main content
Log in

Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location

  • Manuscript
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The multiple obnoxious facilities location problem is an extremely non-convex optimization problem with millions of local optima. It is a very challenging problem. We improved the best known solution for 33 out of 76 test instances. We believe that the results of many instances reported here are still not optimal and thus better objective function values exist. We challenge the optimization community to design procedures that will further improve some of the results reported here. Optimality can be proven for a small number of new facilities. Proving optimality for a large number of facilities would be an achievement.

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

Similar content being viewed by others

References

  1. Aurenhammer, F., Klein, R., Lee, D.-T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific, New Jersey (2013)

    Book  Google Scholar 

  2. Austin, C.M.: The evaluation of urban public facility location: an alternative to benefit-cost analysis. Geogr. Anal. 6, 135–145 (1974)

    Article  Google Scholar 

  3. Austin, C.M., Smith, T.E., Wolpert, J.: The implementation of controversial facility-complex programs. Geograph. Anal. 2, 315–329 (1970)

    Article  Google Scholar 

  4. Bhaviktti, S., Ramakrishnan, C.: Computational efficiency of improved move limit method of sequential linear programming for structural optimization. Comput. Struct. 11, 191–196 (1980)

    Article  Google Scholar 

  5. Chen, T.-Y.: Calculation of the move limits for the sequential linear programming method. Int. J. Numer. Methods Eng. 36, 2661–2679 (1993)

    Article  MathSciNet  Google Scholar 

  6. Church, R.L., Drezner, Z.: Review of obnoxious facilities location problems. in Review (2020)

  7. Church, R.L., Garfinkel, R.S.: Locating an obnoxious facility on a network. Transp. Sci. 12, 107–118 (1978)

    Article  MathSciNet  Google Scholar 

  8. Courtillot, M.: New methods in mathematical programming-on varying all the parameters in a linear-programming problem and sequential solution of a linear-programming problem. Oper. Res. 10, 471–475 (1962)

    Article  MathSciNet  Google Scholar 

  9. CPLEX, IBM ILOG. 12.10: User’s Manual for CPLEX. International Business Machines Corporation, Incline Village, NV (2019)

  10. Drezner, Z., Kalczynski, P.: Solving non-convex non-linear programs with reverse convex constraints by sequential linear programming. Int. Trans. Oper. Res. 27, 1320–1342 (2020)

    Article  MathSciNet  Google Scholar 

  11. Drezner, Z., Kalczynski, P., Salhi, S.: The multiple obnoxious facilities location problem on the plane: a Voronoi based heuristic. OMEGA Int. J. Manag. Sci. 87, 105–116 (2019)

    Article  Google Scholar 

  12. Drezner, Z., Suzuki, A.: The big triangle small triangle method for the solution of non-convex facility location problems. Oper. Res. 52, 128–135 (2004)

    Article  Google Scholar 

  13. Fielding, G.J.: Transport impact research: Problems of location decisions at the community level. Ann. Reg. Sci. 4, 117–126 (1970)

    Article  Google Scholar 

  14. Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47, 99–131 (2005)

    Article  MathSciNet  Google Scholar 

  15. Hansen, P., Peeters, D., Thisse, J.-F.: On the location of an obnoxious facility. Sistemi Urbani 3, 299–317 (1981)

    Google Scholar 

  16. John, K., Ramakrishnan, C., Sharma, K.: Minimum weight design of trusses using improved move limit method of sequential linear programming. Comput. Struct. 27, 583–591 (1987)

    Article  Google Scholar 

  17. Mumphrey, A.J., Seley, J.E., Wolpert, J.: A decision model for locating controversial facilities. J. Am. Inst. Plan. 37, 397–402 (1971)

    Article  Google Scholar 

  18. Mumphrey, A.J., Wolpert, J.: Equity considerations and concessions in the siting of public facilities. Econ. Geogr. 49, 109–121 (1973)

    Article  Google Scholar 

  19. Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley Series in Probability and Statistics, John Wiley, Hoboken, NJ (2000)

  20. Shamos, M., Hoey, D.: Closest-point problems. Proceedings 16th Annual Symposium on the Foundations of Computer Science, Berkeley, CA, pages 151–162 (1975)

  21. Suzuki, A., Okabe, A.: Using Voronoi diagrams. In: Drezner, Z. (ed.) Facility Location: A Survey of Applications and Methods, pp. 103–118. Springer, New York (1995)

    Chapter  Google Scholar 

  22. Voronoï, G.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques: deuxième mémoire. recherches sur les parallélloèdres primitifs. Journal für die reine und angewandte Mathematik 134: 198–287 (1908)

  23. Welch, S.B., Salhi, S., Drezner, Z.: The multifacility maximin planar location problem with facility interaction. IMA J. Manag. Math. 17, 397–412 (2006)

    Article  MathSciNet  Google Scholar 

  24. Wolpert, J.: Regressive siting of public facilities. Nat. Resour. J. 16, 103–115 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zvi Drezner.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kalczynski, P., Drezner, Z. Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location. Optim Lett 16, 1153–1166 (2022). https://doi.org/10.1007/s11590-021-01731-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-021-01731-2

Keywords

Navigation