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

Authors:
T. V. Levanova;M. A. Loresh
Affiliations:
Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia;Omsk State University, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 1
Cited 7

Convergence of an annealing algorithm

Mathematical Programming: Series A and B

Ant Algorithms: Theory and Applications

Programming and Computing Software
A scatter search-based heuristic to locate capacitated transshipment points

Computers and Operations Research
Joint Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks Using Simulated Annealing

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
QoS multicast routing for multimedia group communications using intelligent computational methods

Computer Communications
The OA-based swap method for the p-median problem

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods

Applied Soft Computing
A multi-objective genetic algorithm with path relinking for the p-median problem

IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.