Sökning: "aco"

Visar resultat 1 - 5 av 20 uppsatser innehållade ordet aco.

  1. 1. A Comparative Study on Optimization Algorithms and its efficiency

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Kareem Ahmed Sheik; [2022]
    Nyckelord :Optimization; Heuristic Search Algorithms; Benchmark Optimization Problems; Systematic literature review; Benchmark functions; Genetic Algorithm; Plant intelligence based optimization algorithm;

    Sammanfattning : Background: In computer science, optimization can be defined as finding the most cost-effective or notable achievable performance under certain circumstances, maximizing desired factors, and minimizing undesirable results. Many problems in the real world are continuous, and it isn't easy to find global solutions. LÄS MER

  3. 2. Path and Route Planning for Indoor Monitoring with UAV : An Evaluation of Algorithms for Time-constrained Path and Route Planning in an Indoor Environment with Several Waypoints and Limited Battery Time

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Ola Johansson; [2022]
    Nyckelord :UAV; path planning; route planning; drone; combinatorial optimization; Ruttplanering; banplanering; vägplanering drönare; kombinatorisk optimisering;

    Sammanfattning : Unmanned flying vehicles (UAVs) are tools that can be used in a variety of scenarios. The most common areas of application are outdoors, where there are not many obstacles to take into consideration when planning a route. LÄS MER

  4. 3. On Embarrassingly Parallel Max- Min Ant Colony Optimization for Traveling Salesperson Problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Nyckelord :;

    Sammanfattning : Ant Colony Optimization (ACO) is a technique which can be used to find approximate Hamilton cycles for the Traveling Salesperson Problem (TSP). OpenMP is a framework which suites well for building multithreaded applications. LÄS MER

  5. 4. Reptilförekomster och kopplingar till miljöfaktorer på Billingen : Inventering av reptilfauna med artificial cover objects på lokal nivå i Västsverige

    Kandidat-uppsats, Högskolan i Skövde/Institutionen för biovetenskap

    Författare :Maja Carlquist Segell; [2021]
    Nyckelord :Reptiles; Environmental factors; Artificial Cover Objects; ACO; Occurrence; Survey success; Conservation; Sweden; Billingen; Common lizard; Viviparous lizard; Slow worm; Grass snake; Common adder; Reptiler; Miljöfaktorer; Artificial Cover Objects; ACO; Förekomst; Inventeringsframgång; Naturvård; Sverige; Billingen; Skogsödla; Kopparödla; Snok; Huggorm;

    Sammanfattning : Förlust av biologisk mångfald är den planetära gräns som överskrids mest, och medför bland de största hoten mot biosfärens integritet. Reptiler är funktionella delar i ekosystem, men habitatförlust, förändrad markanvändning och klimatförändringar orsakar globala populationsminskningar. LÄS MER

  7. 5. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem

    M1-uppsats, Blekinge Tekniska Högskola

    Författare :Hatem Mohi El Din; [2021]
    Nyckelord :Ant colony optimization; genetic algorithm; metaheuristics; javascript; python; C#;

    Sammanfattning : Metaheuristics is a term for optimization procedures/algorithms that can be applied to a wide range of problems. These problems for which metaheuristics are used usually fall in the NP-hard category, meaning that they cannot be solved in polynomial time. This means that as the input dataset gets larger the time to solve increases exponentially. LÄS MER