RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2004 Issue 3, Pages 80–88 (Mi at1543)

This article is cited in 56 papers

Discrete Optimization

Algorithms of ant system and simulated annealing for the $p$-median problem

T. V. Levanovaa, M. A. Loreshb

a Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
b Omsk State University

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.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 27.06.2003


 English version:
Automation and Remote Control, 2004, 65:3, 431–438

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026