Automation and Remote Control

, Volume 65, Issue 3, pp 431–438

Algorithms of Ant System and Simulated Annealing for the p-median Problem

Authors

  • T. V. Levanova
    • Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
  • M. A. Loresh
    • Omsk State University
Article

DOI: 10.1023/B:AURC.0000019375.23201.c1

Cite this article as:
Levanova, T.V. & Loresh, M.A. Automation and Remote Control (2004) 65: 431. doi:10.1023/B:AURC.0000019375.23201.c1

Abstract

Consideration was given to the p-median problem for minimum in the integer formulation which is known to be NP-hard. Variants of the algorithms of ant system and simulated annealing were proposed for it, and the results of computer experiments were analyzed.

Copyright information

© MAIK “Nauka/Interperiodica” 2004