Premium
A Tabu search algorithm for solving the extended maximal availability location problem
Author(s) -
Chiyoshi Fernando Y.,
Morabito Reinaldo
Publication year - 2011
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2011.00824.x
Subject(s) - tabu search , simulated annealing , computer science , mathematical optimization , probabilistic logic , reliability (semiconductor) , algorithm , server , mathematics , artificial intelligence , power (physics) , physics , quantum mechanics , world wide web
The aim of this study is to develop a Tabu Search ( TS ) procedure for the Extended Maximal Availability Location Problem ( EMALP ). This probabilistic location problem consists of locating the servers of the system so that the expected coverage of demand is maximized, in which a demand area is said to be covered if there is at least one server available within a given critical distance with a probability greater than or equal to a given reliability. The results obtained from this procedure are compared with those obtained from the Simulated Annealing ( SA ) procedure developed by Galvão et al. for the same problem. To the best of our knowledge, we are not aware of other methods proposed in the literature to solve the EMALP . The computational results show that in terms of the quality of the solutions, SA slightly outperforms TS for the smaller networks, while TS outperforms SA for the larger networks.