A statistical analysis of simulated annealing applied to the p-median problem

Annals of Operations Research

Volumn 96, Issue 1-4, 2000, Pages 61-74

  Chiyoshi, Fernando ^a   Galvão, Roberto D ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Location; P median problem; Simulated annealing

Indexed keywords

EID: 0034367675     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018982914742     Document Type: Article

References (27)

1. J.E. Beasley, OR-Library: Distributing test problems by electronic mail, Journal of the Operational Research Society 41 (1990) 1069-1072.
2. N. Christofides, Graph Theory: An Algorithm Approach (Academic Press, London, 1975).
3. N. Christofides and J.E. Beasley, A tree search algorithm for the p-median problem, European Journal of Operational Research 10 (1982) 196-204.
4. D. Connolly, General purpose simulated annealing, Journal of The Operational Research Society 43 (1992) 494-505.
5. A. Corana, M. Marchesi, C. Martini and S. Ridella, Minimizing multimodal functions of continuous variables with the "simulated annealing" algorithm, ACM Transactions on Mathematical Software 13 (1987) 262-280.
6. S. Eilon and R.D. Galvão, Single and double vertex substitution in heuristic procedures for the p-median problem, Management Science 24 (1978) 1763-1766.
7. R.D. Galvão, A dual-bounded algorithm for the p-median problem, Operations Research 28 (1980) 1112-1121.
8. R.D. Galvão and L.A. Raggi, A method for solving to optimality uncapacitated location problems, Annals of Operations Research 18 (1989) 225-244.
9. W.L. Goffe, G.D. Ferrier and J. Rogers, Global optimization of statistical functions with simulated annealing, Journal of Econometrics 60 (1994) 65-99.
10. P. Hanjoul and D. Peeters, A comparison of two dual-based procedures for solving the p-median problem, European Journal of Operational Research 20 (1985) 387-396.
11. P. Hansen and N. Mladenović, Variable neighborhood search for the p-median, Location Science 5 (1998) 207-226.
12. P. Hansen, N. Mladenović and D. Perez-Brito, Variable neighborhood decomposition search, Les Cahiers du GERARD, G-98-53 (1998), Montreal.
13. A.M. Law and W.D. Kelton, Simulation Modeling and Analysis (McGraw-Hill, New York, 1991).
14. F.E. Maranzana, On the location of supply points to minimize transport costs, Operational Research Quarterly 15 (1964) 261-270.
15. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, Equation of steady state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087-1092.
16. P. Mirchandani, A. Oudjit and R.T. Wong, "Multidimensional" extensions and a nested dual approach for the m-median problem, European Journal of Operational Research 21 (1985) 121-137.
17. N. Mladenović, J.P. Moreno and J. Moreno-Vega, A chain-interchange heuristic method, Yugoslav Journal of Operations Research 6 (1996) 41-54.
18. S.C. Narula, U.I. Ogbu and H.M. Samuelsson, An algorithm for the p-median problem, Operations Research 25 (1977) 709-713.
19. I.H. Osman and N. Christofides, Capacitated clustering problems by hybrid simulated annealing and tabu search, International Transactions in Operational Research 1 (1994) 317-336.
20. N.D. Pizzolato, A heuristic for large size p-median location problems with application to school location, Annals of Operations Research 50 (1994) 473-485.
21. G. Reinelt, A traveling salesman problem library, ORSA Journal on Computing 3 (1991) 376-384.
22. E. Rolland, D.A. Schilling and J.R. Current, An efficient tabu search procedure for the p-median problem, European Journal of Operational Research 96 (1996) 329-342.
23. K.E. Rosing and C.S. ReVelle, Heuristic concentration: two stage solution construction, European Journal of Operational Research 97 (1997) 75-86.
24. K.E. Rosing, C.S. ReVelle, E. Rolland, D.A. Schilling and J.R. Current, Heuristic concentration and tabu search: a head to head comparison, European Journal of Operational Research 104 (1998) 93-99.
25. M.B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Operations Research 16 (1968) 955-961.
26. S. Voss, A reverse elimination approach for the p-median problem, Studies in Locational Analysis 8 (1996) 49-58.
27. R. Whitaker, A fast algorithm for the greedy interchange for large-scale clustering and median location problems, INFOR 21 (1983) 95-108.