Skip to main content
SpringerLink
Log in

A D.C. optimization method for single facility location problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The single facility location problem with general attraction and repulsion functions is considered. An algorithm based on a representation of the objective function as the difference of two convex (d.c.) functions is proposed. Convergence to a global solution of the problem is proven and extensive computational experience with an implementation of the procedure is reported for up to 100,000 points. The procedure is also extended to solve conditional and limited distance location problems. We report on limited computational experiments on these extensions.

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

Similar content being viewed by others

References

  1. Chen, R. (1988), Conditional minisum and minimax location-allocation problems in Euclidean space,Transportation Science 22, 157–160.

    Google Scholar 

  2. Chen, P., Hansen, P., Jaumard B. and Tuy, H. (1992), Weber's problem with attraction and repulsion,Journal of Regional Science 32, 467–486.

    Google Scholar 

  3. Chen, P., Hansen, P., Jaumard, B. and Tuy, H. (1994), Solution of the multisource Weber and Conditional Weber Problems by D.-C. Programming, Technical Report # G-92-35, Revised March 1994, GERAD, University of Montreal, Montreal, Canada.

    Google Scholar 

  4. Drezer, Z., Mehrez, A. and Wesolowsky, G.(1991), The facility location problem with limited distances,Transportation Science 25, 183–187.

    Google Scholar 

  5. Drezner, Z., and Wesolowsky, G. (1990), The Weber problem on the plane with some negative weights,INFOR 29, 87–99.

    Google Scholar 

  6. Horst, R. and Tuy, H. (1993),Global Optimization, Kluwer Academic Press, second edition, Dordrecht, The Netherlands.

    Google Scholar 

  7. Idrissi, H., Loridan, P. and Michelot, C. (1988), Approximation of solutions for location problems,Journal of Optimization Theory and Applications 56, 127–143.

    Google Scholar 

  8. Love, R. E., Morris, J. G. and Wesolowsky, G. O. (1988)Facilities Location: Models and Methods, North-Holland, Amsterdam.

    Google Scholar 

  9. Maranas, C. D. and Floudas, C. A. (1994) A global optimization method for Weber's problem with attraction and repulsion, inLarge Scale Optimization: State of the Art, eds. W. W. Hager, D. W. Hearn and P.M. Pardalos, Kluwer Academic Publishers, Dordrecht, The Netherlands, 259–293.

    Google Scholar 

  10. Rockafellar, R. T. (1970),Convex Analysis, Princeton University Press, Princeton, NJ.

    Google Scholar 

  11. Tuy, H. (1987), Global minimization of a difference of convex functions,Mathematical Programming Study 30, 150–182.

    Google Scholar 

  12. Tuy, H. (1990), On a polyhedral annexation method for concave minimization, inFunctional Analysis, Optimization and Mathematical Economics, eds. L.J. Leifman and J.B. Rosen, Oxford University Press, Oxford, 248–260.

    Google Scholar 

  13. Tuy, H. (1991), Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms,Journal of Global Optimization 1, 23–36.

    Google Scholar 

  14. Tuy, H. (1991), Polyhedral annexation, dualization and dimension reduction technique in global optimization,Journal of Global Optimization 1, 229–244.

    Google Scholar 

  15. Tuy, H. (1992), On nonconvex optimization problems with separated nonconvex variables,Journal of Global Optimization 2, 133–144.

    Google Scholar 

  16. Tuy, H. (1993), D.C. Optimization: theory, methods and algorithms, Preprint, Institute of Mathematics, Hanoi.

    Google Scholar 

  17. Tuy, H. (1994), A general d.c. approach to location problems, Preprint, Institute of Mathematics, Hanoi.

    Google Scholar 

  18. Tuy, H. and Al-Khayyal, F. A. (1992), Global optimization of a nonconvex single facility problem by sequential unconstrained convex minimization,Journal of Global Optimization 2, 61–71.

    Google Scholar 

  19. Tuy, H. and Thuong, N. V. (1988), On the global minimization of a convex function under general nonconvex constraints,Applied Mathematics and Optimization 18, 119–142.

    Google Scholar 

  20. Weber, A. (1909),Ueber den Standort der Industrien, Tübingen (English translation: C.J Friedrich (translator), 1929, Theory of the Location of Industries, University of Chicago Press, Chicago.

    Google Scholar 

  21. Weiszfeld, E. (1937), Sur le point pour lequel la somme des distances den points donnés est minimum,Tôhoku Mathematical Journal 43, 355–386.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, P.O. Box 631, Bo Ho, Hanoi, Vietnam

    Hoang Tuy

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332, Atlanta, GA

    Faiz Al-Khayyal & Fangjun Zhou

Authors
  1. Hoang Tuy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faiz Al-Khayyal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fangjun Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation Grant DDM-91-14489.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuy, H., Al-Khayyal, F. & Zhou, F. A D.C. optimization method for single facility location problems. J Glob Optim 7, 209–227 (1995). https://doi.org/10.1007/BF01097061

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01097061

Key words

Search

Navigation