Browsing by Keyword "Dandelion code"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Dandelion-encoded harmony search heuristics for opportunistic traffic offloading in synthetically modeled mobile networks(Springer Verlag, 2016) Perfecto, Cristina; Bilbao, Miren Nekane; Del Ser, Javier; Ferro, Armando; Salcedo-Sanz, Sancho; Geem, Zong Woo; Kim, Joong Hoon; IAThe high data volumes being managed by and transferred through mobile networks in the last few years are the main rationale for the upsurge of research aimed at finding efficient technical means to offload exceeding traffic to alternative communication infrastructures with higher transmission bandwidths. This idea is solidly buttressed by the proliferation of short-range wireless communication technologies (e.g.mobile devices with multiple radio interfaces), which can be conceived as available opportunistic hotspots to which the operator can reroute exceeding network traffic depending on the contractual clauses of the owner at hand. Furthermore, by offloading to such hotspots a higher effective coverage can be attained by those operators providing both mobile and fixed telecommunication services. In this context, the operator must decide if data generated by its users will be sent over conventional 4G+/4G/3G communication links, or if they will instead be offloaded to nearby opportunistic networks assuming a contractual cost penalty. Mathematically speaking, this problem can be formulated as a spanning tree optimization subject to cost-performance criteria and coverage constraints. This paper will elaborate on the efficient solving of this optimization paradigm by means of the Harmony Search meta-heuristic algorithm and the so-called Dandelion solution encoding, the latter allowing for the use of conventional meta-heuristic operators maximally preserving the locality of tree representations. The manuscript will discuss the obtained simulation results over different synthetically modeled setups of the underlying communication scenario and contractual clauses of the users.Item On the heritability of dandelion-encoded harmony search heuristics for tree optimization problems(IEEE, 2015-09-24) Perfecto, Cristina; Bilbao, Miren Nekane; Del Ser, Javier; Ferro, Armando; IATree based optimization problems stand for those paradigms where solutions can be arranged within a tree-like graph whose nodes represent the optimization variables of the problem at hand and their interconnecting edges topological and/or hierarchical relationships between such variables. In this context, a research line of increasing interest during the last decade focuses on the derivation of intelligent solution encoding strategies capable of 1) capturing all topological constraints of this particular class of graphs; and 2) preserving their connectivity properties when they undergo combination/mutation operations within approximative evolutionary solvers. This manuscript takes a step over the state of the art by shedding light on the heri-tability properties of the Dandelion tree encoding approach under avant-garde stochastically-controlled evolutionary operators. In particular we elaborate on the topological heritability of the so-called Harmony Memory Considering Rate (HMCR) exploitative operator of the Harmony Search algorithm, a population-based meta-heuristic algorithm that has so far shown to outperform other evolutionary schemes in a wide range of optimization scenarios. Results from extensive Monte Carlo simulations are discussed in terms of the preserved structural properties of the newly produced solutions with respect to the initial Dandelion-encoded population.