Skip to main content
SpringerLink
Log in

Annealing Algorithms for Multisource Absolute Location Problems on Graph

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

A methodology is presented for applying annealing techniques tomultisource absolute location problems on graph. Two kinds ofobjective functions are considered: barycenters and centers. Aclass of new algorithms is described: its development startsfrom the iterative “cluster-and-locate” algorithm and reliesupon the relaxation of the integrality constraints onallocation variables. Experimental results are reported.

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. R.S. Garfinkel, A.W. Neebe, and M.R. Rao, "The m-center problem: Minimax facility location," Management Science, vol. 23, no. 10, pp. 1133–1142, 1977.

    Google Scholar 

  2. S.L. Hakimi, E.F. Schmeichel, and J.G. Pierce, "On p-centers in networks," Transportation Science, vol. 12, no. 1, pp. 1–15, 1978.

    Google Scholar 

  3. J. Halpern and O. Maimon, "Algorithms for the m-center problems: A survey," Europ. J. of Oper. Res., vol. 10, pp. 90–99, 1982.

    Google Scholar 

  4. G.Y. Handler and P.B. Mirchandani, Location on Networks-Theory and Algorithms, MIT Press, 1979.

  5. R. Holzman, "An axiomatic approach to location on networks," Mathematics of Operations Research, vol. 15, no. 3, pp. 553–563, 1990.

    Google Scholar 

  6. O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems. Part I-II," SIAM J. on Appl. Math., vol. 37, pp. 513–538, 1979.

    Google Scholar 

  7. F. Maffioli and G. Righini, "An annealing approach to multifacility location problems in Euclidean spaces," Location Science, vol. 2, no. 4, pp. 205–222, 1994.

    Google Scholar 

  8. F. Maffioli and G. Righini, "Location of the absolute barycenter of a graph," Report 93.027, Dipartimento di Elettronica e Informazione, Politecnico di Milano, 1993.

  9. E. Minieka, "A polynomial time algorithm for finding the absolute center of a network," Networks, vol. 11, pp. 351–355, 1981.

    Google Scholar 

  10. G. Righini, "Algoritmi per problemi di localizzazione multirisorse (Algorithms for multisource location problems)," Doctoral thesis, Dipartimento di Elettronica e Informazione, Politecnico di Milano, 1993.

  11. A. Sepe and A. Sforza, "Un algoritmo per il problema del centro assoluto su rete (An algorithm for the absolute center problem on network)," Ricerca Operativa, vol. 39, pp. 71–105, 1986.

    Google Scholar 

  12. D.R. Shier and P.M. Dearing, "Optimal locations for a class of non-linear, single-facility location problems on a network," Operations Research, vol. 31, pp. 292–303, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32, 20133, Milano, Italy

    Giovanni Righini

Authors
  1. Giovanni Righini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Righini, G. Annealing Algorithms for Multisource Absolute Location Problems on Graph. Computational Optimization and Applications 7, 325–337 (1997). https://doi.org/10.1023/A:1008612929672

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008612929672

Search

Navigation