Essays about: "Metaheuristics algorithms"
Showing result 1 - 5 of 8 essays containing the words Metaheuristics algorithms.
-
1. Investigating the Use of Digital Twins to Optimize Waste Collection Routes : A holistic approach towards unlocking the potential of IoT and AI in waste management
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Solid waste management is a global issue that affects everyone. The management of waste collection routes is a critical challenge in urban environments, primarily due to inefficient routing. This thesis investigates the use of real-time virtual replicas, namely Digital Twins to optimize waste collection routes. READ MORE
-
2. Automatic text placement on maps using deep learning keypoint detection models
University essay from Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapAbstract : Labeling the map is one of the most essential parts of the cartographic process that requires a huge time and energy. It is proven that the automation of map labeling is an NP-hard problem. There have been many research studies that tried to solve it such as rule-based methods, metaheuristics, and integer programming. READ MORE
-
3. Evaluation of bus networks designed by a metaheuristic algorithm : A case study in Södertälje, Sweden
University essay from KTH/TransportplaneringAbstract : This thesis evaluates the feasibility of bus networks’ implementation in a real life scenario designed by a metaheuristics algorithm called “Multi Objective Discrete Cuckoo Search (MODCS)”. The research focuses on evaluating the generated bus networks from two points of view: the first concerns a comparative analysis (quantitative part) of the algorithm’s results with the current bus network in Södertälje in terms of the operation and passenger costs. READ MORE
-
4. Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
University essay from Blekinge Tekniska HögskolaAbstract : 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. READ MORE
-
5. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. READ MORE