Abstract
An implementation of simulated annealing and tabu search is described for discrete versions of two noxious facility location problems —p-dispersion andp-defense-sum. A series of computational experiments leading to good choices of the parameters that drive simulated annealing and tabu search are presented for a 33-node data set. Using these parameter settings, the performance of simulated annealing and tabu search are compared to a semi-greedy heuristic for thirty randomly generated 25-node data sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E.H.L. Aarts and P.J.M. Van Laarhoven, Statistical cooling: A general approach to combinatorial optimization problems, Phillips J. Res. 40(1985)193–226.
V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl. 45(1985)41–52.
N.E. Collins, R.W. Eglese and B.L. Golden, Simulated annealing — an annotated bibliography, Amer. J. Math. Manag. Sci. 8(1988)209–308.
E. Erkut and S. Neuman, Comparison of four models for dispersing facilities, INFOR 29(1991)68–86.
E. Erkut, The discretep-dispersion problem, Eur. J. Oper. Res. 46(1990)48–60.
A.T. Feo, M.G.C. Resende and S.H. Smith, A greedy randomized adaptive search procedure for maximum independent set, Working Paper, University of Texas, Austin, TX 78712 (November 1989).
F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.
F. Glover, Tabu search, Part II, ORSA, J. Comput. 2(1990)4–32.
P. Hansen, Dispersing facilities on a network,TIMS/ORSA Joint National Meeting, Washington, DC (April 1988).
J.H. Holland,Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).
D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation. Part I, Graph partitioning, Oper. Res. 37(1990)865–893.
R.L. Karg and G.L. Thompson, Heuristic approach to solving travelling salesman problems, Manag. Sci. 10(1964)224–248.
R.K. Kincaid and S.L. Padula, Minimizing distortion and internal forces in truss structures by simulated annealing,Proc. AIAA/ASME/ASCE/AHS/ASC 31st SDM Conf., Long Beach, CA (April 1990), pp. 327–333.
R.K. Kincaid, Minimizing distortion in truss structures: A comparison of simulated annealing and tabu search, J. Structural Optim., to appear.
S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680.
M. Kuby, Programming models for facility dispersion: Thep-dispersion and maxisum dispersion problems, Geograph. Anal. 19(1987)315–329.
M. Lundy and A. Mees, Convergence of an annealing algorithm, Math. Progr. 34(1986)111–124.
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21(1953)1087–1092.
M. Salama, R. Bruno, G.-S. Chen and J. Garba, Optimal placement of excitations and sensors by simulated annealing, in:Proc. Recent Advances in Multi-Disciplinary Analysis and Optimization, NASA CP-3031, Hampton, VA (September 1988), pp. 1441–1458.
E. Seneta,Non-Negative Matrices and Markov Chains, 2nd ed. (Springer, New York, 1981).
J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33–45.
R. Chandrasekaran and A. Daughety, Location on tree networks:p-centre andn-dispersion problems, Math. Oper. Res. 6(1981)50–57.
E. Erkut, T. Baptie and B.V. Hohenbalken, The discretep-maxian location problem, Comput. Oper. Res. 17(1990)51–61.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kincaid, R.K. Good solutions to discrete noxious location problems via metaheuristics. Ann Oper Res 40, 265–281 (1992). https://doi.org/10.1007/BF02060482
Issue Date:
DOI: https://doi.org/10.1007/BF02060482