A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

Abstract

a b s t r a c tThis paper proposes an evolutionary algorithm with Dandelion-encoding to tackle the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem. This problem has been recently proposed, and consists of finding several broadcast trees from a source node, jointly considering traffic and delay constraints in trees. A version of the problem in which the source node is also included in the optimization process is considered as well in the paper. The Dandelion code used in the proposed evolutionary algorithm has been recently proposed as an effective way of encoding trees in evolutionary algorithms. Good properties of locality has been reported on this encoding, which makes it very effective to solve problems in which the solutions can be expressed in form of trees. In the paper we describe the main characteristics of the algorithm, the implementation of the Dandelion-encoding to tackled the DC-CMST problem and a modification needed to include the source node in the optimization. In the experimental section of this article we compare the results obtained by our evolutionary with that of a recently proposed heuristic for the DC-CMST, the Least Cost (LC) algorithm. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results that the LC in all the instances tackled.

An Analysis of Coalition-Competition Pricing Strategies for Multi-operator Mobile Traffic Offloading Using Bi-objective Heuristics

“…The Dandelion code is a bijective mapping between a tree network topology of M + N + 1 nodes and an integer string with length M + N − 1. This code has several properties in terms of inheritance and locality that make it suitable for tackling tree optimization problems by means of Evolutionary Algorithms [19], particularly in telecommunications [20][21][22]. A brief explanation of the encoding and decoding processes is now given:…”

QoS-based cooperative algorithm for integral multi-commodity flow problem

“…In these cases, the formulation and corresponding algorithms should exploit the properties and peculiarities of the problem which will truncate the search space and promote an effective solution [9]. Following this approach, some hybrid variants of genetic algorithm have been extended for special tasks [19,18,26].…”

Parameter estimation of an unmanned aerial vehicle using dandelion algorithm

“…Meeting these challenges, this study evaluates the efficiency of the dandelion algorithm, which is known for its robustness, simplicity and the optimality of traversing the complex multidimensional spaces [28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43]. The metaheuristics can be used to solve many complicated problem however, in this study we used the dandelion algorithm, which is based on the natural scattering behavior of dandelion seeds, utilizes a specific method of global optimization [66][67][68][69][70][71][72][73][74][75][76][77][78][79][80][81][82][83]. This paper explains how this bio-inspired algorithm has been customized for the UAV parameter estimation problem, describing the implementation of the algorithm and the theoretical characteristics that make it suitable for this application.…”