Good solutions to discrete noxious location problems via metaheuristics (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

1. 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.
   Google Scholar
2. V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl. 45(1985)41–52.
   Article Google Scholar
3. N.E. Collins, R.W. Eglese and B.L. Golden, Simulated annealing — an annotated bibliography, Amer. J. Math. Manag. Sci. 8(1988)209–308.
   Google Scholar
4. E. Erkut and S. Neuman, Comparison of four models for dispersing facilities, INFOR 29(1991)68–86.
   Google Scholar
5. E. Erkut, The discrete_p_-dispersion problem, Eur. J. Oper. Res. 46(1990)48–60.
   Article Google Scholar
6. 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).
   Google Scholar
7. F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.
   Google Scholar
8. F. Glover, Tabu search, Part II, ORSA, J. Comput. 2(1990)4–32.
   Google Scholar
9. P. Hansen, Dispersing facilities on a network,TIMS/ORSA Joint National Meeting, Washington, DC (April 1988).
10. J.H. Holland,Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, 1975).
    Google Scholar
11. 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.
    Article Google Scholar
12. R.L. Karg and G.L. Thompson, Heuristic approach to solving travelling salesman problems, Manag. Sci. 10(1964)224–248.
    Article Google Scholar
13. 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.
14. R.K. Kincaid, Minimizing distortion in truss structures: A comparison of simulated annealing and tabu search, J. Structural Optim., to appear.
15. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671–680.
    Article Google Scholar
16. M. Kuby, Programming models for facility dispersion: The_p_-dispersion and maxisum dispersion problems, Geograph. Anal. 19(1987)315–329.
    Google Scholar
17. M. Lundy and A. Mees, Convergence of an annealing algorithm, Math. Progr. 34(1986)111–124.
    Article Google Scholar
18. 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.
    Article Google Scholar
19. 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.
20. E. Seneta,Non-Negative Matrices and Markov Chains, 2nd ed. (Springer, New York, 1981).
    Google Scholar
21. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33–45.
    Google Scholar
22. R. Chandrasekaran and A. Daughety, Location on tree networks:_p_-centre and_n_-dispersion problems, Math. Oper. Res. 6(1981)50–57.
    Article Google Scholar
23. E. Erkut, T. Baptie and B.V. Hohenbalken, The discrete_p_-maxian location problem, Comput. Oper. Res. 17(1990)51–61.
    Article Google Scholar

Download references