Abstract
In this paper, we propose a novel autonomous intelligent tool for the optimum design of a wireless relayed communication network deployed over disaster areas. The so-called dynamic relay deployment problem consists of finding the optimum number of deployed relays and their location aimed at simultaneously maximizing the overall number of mobile nodes covered and minimizing the cost of the deployment. In this paper, we extend the problem by considering diverse relay models characterized by different coverage radii and associated costs. To efficiently tackle this problem we derive a novel hybrid scheme comprising: (1) a Harmony Search (HS)-based global search procedure and (2) a modified version of the well-known K-means clustering algorithm as a local search technique. Single- and bi-objective formulations of the algorithm are proposed for emergency and strategic operational planning, respectively. Monte Carlo simulations are run over a emulated scenario based on real statistical data from the Castilla La Mancha region (center of Spain) to show that, in comparison with a standard implementation of the K-means algorithm followed by a exhaustive search procedure over all relay-model combinations, the proposed scheme renders on average better coverage levels and reduced costs providing, at the same time, an intelligent tool capable of simultaneously determining the number and models of the relays to be deployed.
Similar content being viewed by others
Notes
Any dimensionality of the points holds.
References
Akella MR, Batta R, Delmelle EM, Rogerson PA, Blatt A, Wilson G (2005) Base station location and channel allocation in a cellular network with emergency coverage requirements. Eur J Oper Res 164(2):301–323
Agnetis A, Grande E, Mirchandani PB, Pacifici A (2009) Covering a line segment with variable radius discs. Comput Oper Res 36(5):1423–1436
Alevras D, Padberg MW (2001) Linear optimization and extensions: problems and solutions. Universitext. Springer, Berlin
Alsalloum OI, Rand GK (2006) Extensions to emergency vehicle location models. Comput Oper Res 33(9):2725–2743
Araz C, Selim H, Ozkarahan I (2007) A fuzzy multi-objective covering-based vehicle location model for emergency services. Comput Oper Res 34(3):705–726
Beldek U, Leblebicioglu K (2009) Local decision making and decision fusion in hierarchical levels. TOP 17(1):44–69
Del Ser J, Matinmikko M, Gil-Lopez S, Mustonen M (2012) Centralized and distributed spectrum channel assignment in cognitive wireless networks: a harmony search approach. Appl Soft Comput 12(2):921–930
Dimopoulou M, Giannikos I (2004) Towards an integrated framework for forest fire control. Eur J Oper Res 152(2):476–486
Elzinga J, Hearn DW (1972) The minimum covering sphere problem. Manag Sci 19:96–104
Forsati R, Haghighat AT, Mahdavi M (2008) Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput Commun 31(10):2505–2519
Geem ZW (2006) Optimal cost design of water distribution networks using harmony search. Eng Optim 38(3):259–277
Geem ZW, Hoon Kim J, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68
Guo W, Huang X, Liu Y (2010) Dynamic relay deployment for disaster area wireless networks. Wirel Commun Mob Comput 10(9):1238–1252
Hamerly G, Elkan C (2002) Learning the K in K-means. Technical Report CS2002-0716. University of California, San Diego
Houchbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J ACM 32(1):130–136
Jendsch W (1998) Das groß e Feuer. Jendsch Feuerwehrpresse (Fire Press), Fachbeitrag (technical report) 2727/98 (in German)
Johnson DS (1982) The NP-completeness column: an ongoing guide. J Algorithms 3(2):182–195
Liao TW (2010) Two hybrid differential evolution algorithms for engineering design optimization. Appl Soft Comput 10:1188–1199
MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on mathematical statistics and probability, vol 1. University of California Press, Berkeley, pp 281−297
Mastroeni L, Naldi M (2011a) Compensation policies and risk in service level agreements: a value-at-risk approach under the ON-OFF service model. In: 7th International Workshop on Internet Charging and QoS Technologies ICQT 2011, Paris, France. Lecture Notes of Computer Science, vol 6995, pp 2–13
Mastroeni L, Naldi M (2011b) Network protection through insurance: premium computation for the ON-OFF service model. In: 8th International Workshop on the Design of Reliable Communication Networks (DRCN), Krakow, Poland, pp 46–53. ISBN 978-1-61284-123-6
Pelleg D, Moore A (2000) X-means: extending K-means with efficient estimation of the number of clusters. In: 17th International Conference on Machine Learning. Morgan Kaufmann, San Francisco, pp 727–734
Plan Especial de Emergencias por Incendios Forestales de Castilla La Mancha. IOP publishing http://www.castillalamancha.es/sites/default/files/documentos/20120511/plan_especial_emergencias_if.pdf. Accessed 02 July 2013
Yang L, Jones BF, Yang S-H (2007) A fuzzy multi-objective programming for optimization of fire station locations through genetic algorithms. Eur J Oper Res 181(2):903–915
Zahn CT (1962) Black box maximization of circular coverage. J Res Nat Bur Standards B 66:181–216
Zhang R, Hanzo L (2009) Iterative multiuser detection and channel decoding for DS-CDMA using harmony search. IEEE Signal Process Lett 16(10):917–920
Acknowledgments
This work has been supported by the “Centro para el Desarrollo Tecnologico Industrial” (CDTI) of the Spanish Ministry of Science and Innovation through the PROMETEO-CENIT project, as well as by the Spanish Ministry of Science and Innovation under project ECO2010-22065-C03-02.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bilbao, M.N., Gil-López, S., Del Ser, J. et al. Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas. TOP 22, 997–1016 (2014). https://doi.org/10.1007/s11750-013-0308-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-013-0308-6