Journal of Heuristics

, Volume 2, Issue 1, pp 31–53

Applying simulated annealing to location-planning models

  • Alan T. Murray
  • Richard L. Church
Article

DOI: 10.1007/BF00226292

Cite this article as:
Murray, A.T. & Church, R.L. J Heuristics (1996) 2: 31. doi:10.1007/BF00226292

Abstract

Simulated annealing is a computational approach that simulates an annealing schedule used in producing glass and metals. Originally developed by Metropolis et al. in 1953, it has since been applied to a number of integer programming problems, including the p-median location-allocation problem. However, previously reported results by Golden and Skiscim in 1986 were less than encouraging. This article addresses the design of a simulated-annealing approach for the p-median and maximal covering location problems. This design has produced very good solutions in modest amounts of computer time. Comparisons with an interchange heuristic demonstrate that simulated annealing has potential as a solution technique for solving location-planning problems and further research should be encouraged.

Key Words

simulated annealinginterchangep-medianmaximal covering location problem

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Alan T. Murray
    • 1
  • Richard L. Church
    • 2
    • 3
  1. 1.Australian Housing and Urban Research InstituteQueensland University of TechnologyBrisbaneAustralia
  2. 2.National Center for Geographic Information and AnalysisUniversity of California at Santa BarbaraSanta BarbaraUSA
  3. 3.the Department of GeographyUniversity of California at Santa BarbaraSanta BarbaraUSA