Sökning: "Vehicle Routing Problem VRP"

Visar resultat 1 - 5 av 13 uppsatser innehållade orden Vehicle Routing Problem VRP.

  1. 1. A pragmatic approach to improve the efficiency of the waste management system in Stockholm through the use of Big Data, Heuristics and open source VRP solvers : A real life waste collection problem;Stockholm’s waste collection system and inherent vehicle routing problem, VRP

    Master-uppsats, KTH/Hållbar utveckling, miljövetenskap och teknik

    Författare :Rafael Salcedo Villanueva; [2020]
    Nyckelord :;

    Sammanfattning : In this thesis, we will address a real life waste collection problem; Stockholm’s waste collection system and inherent vehicle routing problem, VRP. To do this we will first delve into some mathematical theory of Combinatorial Optimization and Heuristics to understand the fundamentals of the problem. LÄS MER

  2. 2. 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

  3. 3. Warehouse Vehicle Routing using Deep Reinforcement Learning

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

    Författare :Johan Oxenstierna; [2019]
    Nyckelord :;

    Sammanfattning : In this study a Deep Reinforcement Learning algorithm, MCTS-CNN, is applied on the Vehicle Routing Problem (VRP) in warehouses. Results in a simulated environment show that a Convolutional Neural Network (CNN) can be pre-trained on VRP transition state features and then effectively used post-training within Monte Carlo Tree Search (MCTS). LÄS MER

  4. 4. RUTTOPTIMERING INOM HEMTJÄNSTEN - KAN ETT FÖRDELNINGSOPTIMERINGSSYSTEM FÖRBÄTTRA HEMTJÄNSTENS TRANSPORTER UR ETT MILJÖPERSPEKTIV?

    Kandidat-uppsats, Göteborgs universitet/Företagsekonomiska institutionen

    Författare :Emma Gabinus; Matilda Bergström; [2018-08-24]
    Nyckelord :Vehicle Routing Problem VRP ; VRP in home care services; Computer-based tools; VRSP-Software; Operational Research; Route Planning; Ruttplaneringsproblemet;

    Sammanfattning : I denna studie undersöks hur ett fördelningsoptimeringssystem kan appliceras i den kommunalahemtjänsten i syfte att vara ett steg för att nå Sveriges miljömål. Miljömålet innebär att Sverigeska nå en fossiloberoende fordonsflotta till år 2030. LÄS MER

  5. 5. Optimal task planning in multi-vehicle systems under syntactically co-safe Linear Temporal Logic

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

    Författare :Gustav Hedengran; John Kvarnefalk; [2018]
    Nyckelord :;

    Sammanfattning : Autonomous vehicles need to be able to perform different instructions during different missions and situations. For task specification, logical languages are often used. Depending on desired expressiveness, there are different methods of task specification and planning. LÄS MER