48 research outputs found

    Layout optimization of an airborne wind energy farm for maximum power generation

    Get PDF
    We consider a farm of Kite Power Systems (KPS) in the field of Airborne Wind Energy (AWE), in which each kite is connected to an electric ground generator by a tether. In particular, we address the problem of selecting the best layout of such farm in a given land area such that the total electrical power generated is maximized. The kites, typically, fly at high altitudes, sweep a greater area than that of traditional wind turbines, and move within a conic shaped volume with vertex on the ground station. Therefore, constraints concerning kite collision avoidance and terrain boundaries must be considered. The efficient use of a given land area by a set of KPS depends on the location of each unit, on its tether length and on the elevation angle. In this work, we formulate the KPS farm layout optimization problem. Considering a specific KPS and wind characteristics of the given location, we study the power curve as a function of the tether length and elevation angle. Combining these results with an area with specified length and width, we develop and implement a heuristic optimization procedure to devise the layout of a KPS farm that maximizes wind power generation.We acknowledge the support of FEDER/COMPETE2020/NORTE2020/POCI/PIDDAC/MCTES/FCT, Portugal funds through grants SFRH/BPD/126683/2016, UID/IEEA/00147/006933–SYSTEC, PTDC/EEIAUT/2933/2014–TOCCATA, PTDC/EEI-AUT/31447/2017–UPWIND, POCI-01-0145-FEDER031821-FAST and NORTE-01-0145-FEDER-000033–STRIDE.info:eu-repo/semantics/publishedVersio

    A biased random key genetic algorithm for the weighted independent domination problem

    Get PDF
    This work deals with an NP-hard problem in graphs known as the weighted independent domination problem. We propose a biased random key genetic algorithm for solving this problem. The most important part of the proposed algorithm is a decoder that translates any vector of real-values into valid solutions to the tackled problem. The experimental results, in comparison to a state-of-the-art population-based iterated greedy algorithm from the literature, show that our proposed approach has advantages over the state-of-the-art algorithm in the context of the more dense graphs in which edges have higher weights than vertices.Peer ReviewedPostprint (author's final draft

    A decision support system for TV self-promotion scheduling

    Get PDF
    This paper describes a Decision Support System (DSS) that aims to plan and maintain the weekly self-promotion space for an over the air TV station. The self-promotion plan requires the assignment of several self-promotion advertisements to a given set of available time slots over a pre-specified planning period. The DSS consists of a data base, a statistic module, an optimization module, and a user interface. The input data is provided by the TV station and by an external audiometry company, which collects daily audience information. The statistical module provides estimates based on the data received from the audiometry company. The optimization module uses a genetic algorithm that can find good solutions quickly. The interface reports the solution and corresponding metrics and can also be used by the decision makers to manually change solutions and input data. Here, we report mainly on the optimization module, which uses a genetic algorithm (GA) to obtain solutions of good quality for realistic sized problem instances in a reasonable amount of time. The GA solution quality is assessed using the optimal solutions obtained by using a branch-and-bound based algorithm to solve instances of small size, for which optimality gaps below 1% are obtained.This research had the support of COMPETE-FEDERPORTUGAL2020-POCI-NORTE2020-FCT funding via grants POCI-01-0145-FEDER 031447 and 031821, NORTE-01-0145-FEDER-000020, and PTDC-EEI-AUT-2933-2014|16858–TOCCATA

    Biased random-key genetic algorithm with local search applied to the maximum diversity problem

    Get PDF
    The maximum diversity problem (MDP) aims to select a subset with a predetermined number of elements from a given set, maximizing the diversity among them. This NP-hard problem requires efficient algorithms that can generate high-quality solutions within reasonable computa tional time. In this study, we propose a novel approach that combines the biased random-key genetic algorithm (BRKGA) with local search to tackle the MDP. Our computational study utilizes a com prehensive set of MDPLib instances, and demonstrates the superior average performance of our proposed algorithm compared to existing literature results. The MDP has a wide range of practical applications, including biology, ecology, and management. We provide future research directions for improving the algorithm’s performance and exploring its applicability in real-world scenarios.This research was partially supported by the National Council for Scientific and Technological Development (CNPq) through grant 303192/2022-4 (R.O.), and Comissão de Aperfeiçoamento de Pessoal do Nível Superior (CAPES), from the Brazilian government; by FONDECYT, grant number 1200525 (V.L.), from the National Agency for Research and Development (ANID) of the Chilean government under the Ministry of Science and Technology, Knowledge, and Innovation; and by Portuguese funds through the CMAT - Research Centre of Mathematics of University of Minho, references UIDB/00013/2020, UIDP/00013/2020 (C.C.)

    A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

    Get PDF
    This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. Active schedules are constructed using a priority-rule heuristic in which the priorities of the activities are defined by the genetic algorithm. A forward-backward improvement procedure is applied to all solutions. The chromosomes supplied by the genetic algorithm are adjusted to reflect the solutions obtained by the improvement procedure. The heuristic is tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

    A biased random-key genetic algorithm for the two-stage capacitated facility location problem

    Get PDF
    Artigo CientíficoThis paper presents a new metaheuristic approach for the two-stage capacitated facility location problem (TSCFLP), which the objective is to minimize the operation costs of the underlying two-stage transportation system, satisfying demand and capacity constraints. In this problem, a single product must be transported from a set of plants to meet customers demands passing out by intermediate depots. Since this problem is known to be NP-hard, approximated methods become an efficient alternative to solve real-industry problems. As far as we know, the TSCFLP is being solved in most cases by hybrid approaches supported by an exact method, and sometimes a commercial solver is used for this purpose. Bearing this in mind, a BRKGA metaheuristic and a new local search for TSCFLP are proposed. It is the first time that BRKGA had been applied to this problem and the computational results show the competitiveness of the approach developed in terms of quality of the solutions and required computational time when compared with those obtained by state-of-the-art heuristics. The approach proposed can be easily coupled in intelligent systems to help organizations enhance competitiveness by optimally placing facilities in order to minimize operational costs.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES
    corecore