Advertisement

Annals of Operations Research

, Volume 6, Issue 2, pp 35–46 | Cite as

Discrete space location-allocation solutions from genetic algorithms

  • C. M. Hosage
  • M. F. Goodchild
Solving p-Median Problems

Abstract

Genetic algorithms are adaptive sampling strategies based on information processing models from population genetics. Because they are able to sample a population broadly, they have the potential to out-perform existing heuristics for certain difficult classes of location problems. This paper describes reproductive plans in the context of adaptive optimization methods, and details the three genetic operators which are the core of the reproductive design. An algorithm is presented to illustrate applications to discrete-space location problems, particularly thep-median. The algorithm is unlikely to compete in terms of efficiency with existingp-median heuristics. However, it is highly general and can be fine-tuned to maximize computational efficiency for any specific problem class.

Keywords and phrases

Genetic algorithm adaptive search heuristic discrete-space 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.D. Bethke,Genetic Algorithms as Function Optimizers (Logic of Computers Group, Dept. of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1981).Google Scholar
  2. [2]
    E. Bonomi and J.-L. Lutton, TheN-city travelling salesman problem; Statistical mechanics and the metropolis algorithm, Ecole Polytechnique Fédérale de Lausanne, Département de Mathématique, Ecublens, Lausanne (1983).Google Scholar
  3. [3]
    G.C. Brockus, Shortest path optimization using a genetics search technique, in:Modeling and Simulation 14, Proc. 14th Annual Pittsburgh Conf. (1983) p. 241.Google Scholar
  4. [4]
    K. DeJong, in:Synopsis: An Interdisciplinary Workshop in Adaptive Systems, ed. J.R. Sampson (Logic of Computers Group, Dept. of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1981) p. 26.Google Scholar
  5. [5]
    J.H. Holland,Adaption in Natural and Artificial Systems (The University of Michigan Press, Ann Arbor, 1975).Google Scholar
  6. [6]
    P. Kainen, in:Synopsis: An Interdisciplinary Workshop in Adaptive Systems ed. J.R. Sampson (Logic of Computers Group, Dept. of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1981) p. 75.Google Scholar
  7. [7]
    S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220, 4598(1983)671.Google Scholar
  8. [8]
    C.C. Skiscim and B.L. Golden, Optimization by simulated annealing: A preliminary computational study for the TSP. Paper presented at the NIHE Summer School on Combinatorial Optimization, Dublin, Ireland (1983).Google Scholar
  9. [9]
    A. Wetzel, in:Synopsis: An Interdisciplinary Workshop in Adaptive Systems ed. J.R. Sampson (Logic of Computers Group, Dept. of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1981) p. 85.Google Scholar

Copyright information

© J.C. Baltzer A.G., Scientific Publishing Company 1986

Authors and Affiliations

  • C. M. Hosage
    • 1
  • M. F. Goodchild
    • 1
  1. 1.Department of GeographyThe University of Western OntarioLondonCanada

Personalised recommendations