Advertisement

Global Optimization Methods for Location and Distance Geometry Problems

  • Hoang Tuy
Part of the Applied Optimization book series (APOP, volume 39)

Abstract

A general problem in location theory and distance geometry is to find the configuration of p unknown points in IR n satisfying a number of constraints on their mutual distances and their distances to N fixed points, while minimizing a given function of these distances. Global optimization methods recently developed for studying different variants of this problem are reviewed.

Key words

location problems distance geometry global optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Khayyal, Faiz A., Tuy, H. and Zhou, F. (1997), Large-scale single facility continuous location by d.c. optimization, Preprint, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.Google Scholar
  2. Al-Khayyal, Faiz A., Thy, H. and Zhou, F. (1997), D.C. optimization methods for multisource location problems, Preprint, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.Google Scholar
  3. Hoai-An, L.T., and Tao, P.D. (1998), D.C. programming approach and solution algorithm to the multidimensional scaling problem, Preprint, Laboratory of Mathematics, National Institute for Applied Sciences, Rouen, France.Google Scholar
  4. Androulakis, I.P., Maranas, C.D. and Floudas, C.A. (1997), Prediction of oligopeptide conformations via deterministic global optimization, Journal of Global Optimization, Vol. 11, pp. 1–34.MathSciNetCrossRefzbMATHGoogle Scholar
  5. Aneja, Y.P. and Parlar, M. (1994), Algorithms for Weber facility location in the presence of forbidden regions and/or barriers to travel, Transportation Science, Vol. 28, pp. 70–216.CrossRefzbMATHGoogle Scholar
  6. Brimberg, J. and Love, R.F. (1994), A location problem with economies of scale, Studies in LocationAnalysis, Issue 7, pp. 9–19.zbMATHGoogle Scholar
  7. Chen, R. (1983), Solution of minisum and minimax location-allocation problems with euclidean distances, Naval Research Logistics Quaterly, Vol. 30, pp. 449–459.CrossRefGoogle Scholar
  8. Chen, R. (1988), Conditional minisum and minimax location-allocation prob-lems in Euclidean space, Transportation Science, Vol. 22, pp. 157–160.MathSciNetCrossRefGoogle Scholar
  9. Chen, P., Hansen, P., Jaumard, B. and Tuy, H. (1992), Weber’s problem with attraction and repulsion, Journal of Regional Science, Vol. 32, pp. 467–409.CrossRefGoogle Scholar
  10. Chen, P., Hansen, P., Jaumard, B. and Tuy, H. (1994), Solution of the multi-source Weber and conditional Weber problems by D.C. Programming, Cahier du GERAD, G-92–35, Ecole Polytechnique, Montreal.Google Scholar
  11. Drezner, Z. and Wesolowsky, G. (1990), The Weber problem on the plane with some negative weights, INFOR, Vol. 29, pp. 87–99.Google Scholar
  12. Groch, A., Vidigal, L. and Director, S. (1985), A new global optimization method for electronic circuit design, IEEE Trans. Circuits and Systems, Vol. 32, pp. 160–170.CrossRefGoogle Scholar
  13. Hansen, P., Jaumard, B. and Thy, H. (1995), Global optimization in location, in Facility Location: a Survey of Applications and Methods, edited by Dresner, Z., Springer, pp. 43–67.Google Scholar
  14. Hansen, P., Peeters, D. and Thisse, J.F. (1982), An algorithm for a constrained Weber problem, Management Science, Vol. 28, pp. 1285–1295.CrossRefzbMATHGoogle Scholar
  15. Hansen, P., Peeters, D., Richard, D. and Thisse, J.F. (1985), The minisum and minimax location problems revisited, Operations Research, Vol. 33, pp. 1251–1265.MathSciNetCrossRefzbMATHGoogle Scholar
  16. Horst, R. and Thy, H. (1996), Global Optimization, Springer, 3rd edition.zbMATHGoogle Scholar
  17. Konno, H., Thach, P.T. and Thy, H. (1997), Optimization on low rank nonconvex structures, Kluwer.zbMATHGoogle Scholar
  18. Idrissi, H., Loridan, P. and Michelot, C. (1988), Approximation of Solutions for Location Problems, Journal on Optimization Theory and Applications, Vol. 56, pp. 127–143.MathSciNetCrossRefzbMATHGoogle Scholar
  19. Love, R.F., Morris, J.G. and Wesolowsky, G.O. (1988), Facilities Location: Models and Methods, North-Holland.zbMATHGoogle Scholar
  20. Maranas, C.D. and Floudas, C.A. (1993), A global optimization method for Weber’s problem with attraction and repulsion, in Large Scale Optimization: State of the Art, edited by Hager, W.W., Heran, D.W. and Pardalos, P.M., Kluwer, pp. 1–12.Google Scholar
  21. Maranas, C.D. and Floudas, C.A. (1994), Global minimum potential energy conformations of small molecules, Journal of Global Optimization, Vol. 4, pp. 135–171.MathSciNetCrossRefzbMATHGoogle Scholar
  22. Meggido, N. and Supowit, K.J. (1984), On the complexity of some common geometric location problems, SIAM Journal on Computing, Vol. 13, pp. 182–196.MathSciNetCrossRefGoogle Scholar
  23. Nguyen, V.H. and Strodiot, J.J. (1992), Computing a global optimal solution to a design centering problem, Mathematical Programming, Vol. 53, pp. 111–123.MathSciNetCrossRefzbMATHGoogle Scholar
  24. Pardalos, P.M. and Xue, G.L. (eds.), (1997), Journal of Global Optimization, Special issue on ‘Computer simulations in molecular and protein conformations’, Vol. 11.Google Scholar
  25. Plastria, F. (1992), The generalized big square small square method for planar single facility location, European Journal of Operations Research, Vol. 62, pp. 163–174.CrossRefzbMATHGoogle Scholar
  26. Plastria, F. (1993), Continuous location anno 1992, A progress report, Studies in Location Analysis, Vol. 5, pp. 85–127.Google Scholar
  27. Rockafellar, R.T. (1970), Convex Analysis, Princeton University Press.zbMATHGoogle Scholar
  28. Rosing, K.E. (1992), An optimal method for solving the generalized multi-Weber problem, European Journal of Operations Research, Vol. 58, pp. 414–426.CrossRefzbMATHGoogle Scholar
  29. Saff, E.B. and Kuijlaars, A.B.J. (1997), Distributing many points on a sphere, Mathematical Intelligencer, Vol. 10, pp. 5–11.MathSciNetCrossRefGoogle Scholar
  30. Thach, P.T. (1993), D.C. sets, D.C. functions and nonlinear equations, Mathematical Programming, Vol. 58, pp. 415–428.MathSciNetCrossRefzbMATHGoogle Scholar
  31. Thach, P.T. (1988), The design centering problem as a d.c. programming problem, Mathematical Programming, Vol. 41, pp. 229–248.MathSciNetCrossRefzbMATHGoogle Scholar
  32. Tuy, H. (1986), A general deterministic approach to global optimization via d.c. programming, in Fermat Days 1985: Mathematics for Optimization, edited by Hiriart-Urruty, J.-B., North-Holland, pp. 137–162.Google Scholar
  33. Thy, H. (1987), Global minimization of a difference of convex functions, Mathematical Programming Study, Vol. 30, pp. 150–182.Google Scholar
  34. Tuy, H. (1990), On a polyhedral annexation method for concave minimization, in Functional Analysis, Optimization and Mathematical Economics, edited by Leifman, L.J. and Rosen, J.B., Oxford University Press, pp. 248–260.Google Scholar
  35. Thy, H. (1991), Polyhedral annexation, dualization and dimension reduction technique in global optimization, Journal of Global Optimization, Vol. 1, pp. 229–244.CrossRefGoogle Scholar
  36. Tuy, H. (1992), The complementary convex structure in global optimization, Journal of Global Optimization, Vol. 2, pp. 21–40.MathSciNetCrossRefzbMATHGoogle Scholar
  37. Thy, H. (1992), On nonconvex optimization problems with separated nonconvex variables, Journal of Global Optimization, Vol. 2, pp. 133–144.CrossRefGoogle Scholar
  38. Tuy, H. (1995), D.C. optimization: theory, methods and algorithms, in Handbook on Global Optimization, edited by Horst, R. and Pardalos, P., Kluwer, pp. 149–216.Google Scholar
  39. Tuy, H. (1996), A general D.C. approach to location problems, in State of the Art in Global Optimization: Computational Methods and Applications, edited by Floudas, C.A. and Pardalos, P.M., Kluwer, pp. 413–432.CrossRefGoogle Scholar
  40. Thy, H. (1998), Convex Analysis and Global Optimization, Kluwer.zbMATHGoogle Scholar
  41. Tuy, H. and Al-Khayyal, Faiz A. (1992), Global optimization of a nonconvex single facility problem by sequential unconstrained convex minimization, Journal of Global Optimization, Vol. 2, pp. 61–71.MathSciNetCrossRefzbMATHGoogle Scholar
  42. Tuy, H., Alkhayyal, Faiz A. and Zhou, F. (1995), D.C. optimization method for single facility location problem, Journal of Global Optimization, Vol. 7, pp. 209–227.MathSciNetCrossRefzbMATHGoogle Scholar
  43. Thy, H., Ghannadan, S., Migdalas, A. and Värbrand, P. (1993), Strongly polynomial algorithm for a production-transportation problem with concave production cost, Optimization, Vol. 27, pp. 205–227.MathSciNetCrossRefGoogle Scholar
  44. Tuy, H., Ghannadan, S., Migdalas, A. and Värbrand, P. (1995), Strongly polynomial algorithm for a production-transportation problem with a fixed number of nonlinear variables, Mathematical Programming, Vol. 72, pp. 229–258.CrossRefGoogle Scholar
  45. Thy, H. and Thuong, N.V. (1988), On the global minimization of a convex function under general nonconvex constraints, Applied Mathematics and Optimization, Vol. 18, pp. 119–142.MathSciNetCrossRefGoogle Scholar
  46. Vidigal, L. and Director, S. (1982), A design centering problem algorithm for nonconvex regions of acceptability, IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, Vol. 14, pp. 13–24.Google Scholar
  47. Xue, G.L. (1997), Minimum inter-particle distance at global minimizers of Lennard-Jones clusters, Journal of Global Optimization, Vol. 11, pp. 83–90.CrossRefzbMATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsBo Ho, HanoiVietnam

Personalised recommendations