Essays about: "Tsp"

Showing result 1 - 5 of 36 essays containing the word Tsp.

  1. 1. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

    University essay from KTH/Geoinformatik

    Author : Carolina Offenbacher; Ellen Thornström; [2022]
    Keywords : Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

    Abstract : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. READ MORE

  3. 2. FEASIBILITY ANALYSIS AND EFFICIENT ROUTING FOR A PARTIALLY AUTOMATED DELIVERY SYSTEM WITHIN CHALMERS CAMPUS

    University essay from Göteborgs universitet/Institutionen för matematiska vetenskaper

    Author : Bingcheng Wu; [2021-06-21]
    Keywords : Last mile delivery; GLM; Knapsack problem; Simulated annealing algorithm; TSP; Mixed-integer linear programming; Energy consumption;

    Abstract : Abstract The use of autonomous driving robot transportation technology to solve the last mile delivery problem is a research hot spot in today’s logistics industry. This thesis aims to analyze the feasibility of applying an Automated Delivery Robot designed by Hugo company to load different sizes of packages and the efficient planning and effectiveness evaluation for the robot. READ MORE

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Mohamed Mohsin; Ajanth Thangavelu; [2021]
    Keywords : ;

    Abstract : 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. READ MORE

  5. 4. D-Wave Systems Quantum Computing : State-of-the-Art and Performance Comparison with Classical Computing

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Jaime Vallejo Benítez Cano; [2021]
    Keywords : ;

    Abstract : The aim of this project is to study Quantum Computing state-of-art and to compare it with classical computing methods. The research is focused on D-Wave Systems’ Quantum Computing approach, exploring its architectures: Chimera and Pegasus; tools, and its Quantum Annealing process. READ MORE

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

    University essay from Blekinge Tekniska Högskola

    Author : Hatem Mohi El Din; [2021]
    Keywords : Ant colony optimization; genetic algorithm; metaheuristics; javascript; python; C#;

    Abstract : 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