Journal of Heuristics

, Volume 2, Issue 1, pp 31-53

First online:

Applying simulated annealing to location-planning models

  • Alan T. MurrayAffiliated withAustralian Housing and Urban Research Institute, Queensland University of Technology
  • , Richard L. ChurchAffiliated withNational Center for Geographic Information and Analysis, University of California at Santa Barbarathe Department of Geography, University of California at Santa Barbara

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 annealing interchange p-median maximal covering location problem