Sökning: "Meta-heuristics"

Visar resultat 1 - 5 av 8 uppsatser innehållade ordet Meta-heuristics.

  1. 1. An Evaluation of GeneticAlgorithm Approaches for theUnit Commitment Problem inPower Generation Scheduling

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Nandini Mattathil Suresh; [2023]
    Nyckelord :Unit Commitment Problem; Genetic Algorithm; Meta-heuristics; Economic Dispatch; Constrained Optimization; Encoding; Crossover; Mutation; Selection;

    Sammanfattning : The Unit Commitment Problem (UCP) poses a significant challenge in optimizing powergeneration schedules within complex and dynamic energy systems. This study explores theapplication of Genetic Algorithms (GAs) as a promising approach to address UCP, their ability tonavigate complex solution spaces and adapt to changing operational conditions. LÄS MER

  3. 2. Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem

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

    Författare :Emmy Yin; Klas Wijk; [2021]
    Nyckelord :;

    Sammanfattning : The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. LÄS MER

  4. 3. A New Approach for Solving the Disruption in Vehicle Routing Problem During the Delivery : A Comparative Analysis of VRP Meta-Heuristics

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

    Författare :Sai Chandana Kaja; [2020]
    Nyckelord :Vehicle Routing Problem; Disruption; Vehicle breakdown; Solution algorithms; Meta-heuristics; Tabu Search.;

    Sammanfattning : Context. The purpose of this research paper is to describe a new approach for solving the disruption in the vehicle routing problem (DVRP) which deals with the disturbance that will occur unexpectedly within the distribution area when executing the original VRP plan. LÄS MER

  5. 4. A comparative study between a genetic algorithm and a simulated annealing algorithm for solving the order batching problem

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

    Författare :Edvin Ardö; Johan Lindholm; [2019]
    Nyckelord :;

    Sammanfattning : Optimizing warehouse automation requires finding efficient routes for pickingup items. Dividing the orders into batches is a realistic requirement for warehouses to have. This problem, known as the order batching problem, is an NP-hard problem. LÄS MER

  7. 5. Shift Design and Driver Scheduling Problem

    Master-uppsats, KTH/Optimeringslära och systemteori

    Författare :Criss Alvianto Priyanto; [2018]
    Nyckelord :Integer Linear Programming; Scheduling Problem; Shift-design problem; Genetic Algorithm; Simulated Annealing; Integer Linjar Programmering; Schemaläggning Problem; Skift Design;

    Sammanfattning : Scheduling problem and shift design problems are well known NP-hard problems within the optimization area. Often time, the two problems are studied individually. In this thesis however, we are looking at the combination of both problems. LÄS MER