Sökning: "Knapsack problem"

Visar resultat 1 - 5 av 19 uppsatser innehållade orden Knapsack problem.

  1. 1. Data-driven decisions in Sports

    Magister-uppsats, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Gabriel Garcia de Baquedano; [2023]
    Nyckelord :team sports; data analytics; artificial intelligence; decision making; Python programming language;

    Sammanfattning : In recent years, many sectors such as insurance, banking, retail, etc. have adopted Big Data architectures to boost their business activities. Such tools not only suppose a greater profit for thesecompanies but also allow them to gain a better understanding of their customers and their needs. LÄS MER

  3. 2. Stochastic Optimization of Asset Management Project Portfolios: A Risk-Informed Approach

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Sebastian Persson; Niklas Hansson; [2023]
    Nyckelord :Nuclear asset management; Risk-informed asset management; Portfolio optimization; Project selection; Knapsack problem; Monte Carlo simulation; Conditional Value at Risk; Tillgångsförvaltning; Riskinformerad tillgångsförvaltning; Portföljoptimering; Projekturval; Kappsäcksproblem; Monte Carlo simulering; Conditional Value at Risk;

    Sammanfattning : Asset management within the nuclear industry has become an increasingly relevant topic as safety requirements have tightened and energy security has become more important. Asset management ensures performance and reliability in a nuclear facility by balancing costs, opportunities, and risks to get the most out of assets. LÄS MER

  4. 3. Multi-dimensional Packing for Resource Allocation in 5G

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

    Författare :Matteo Ghetti; [2022]
    Nyckelord :;

    Sammanfattning : The Fifth Generation (5G) of wireless communication system brings a series of new challenges in resource optimization. For example optimizing the number of bits and dedicated time used by each service would improve the quality of communications. LÄS MER

  5. 4. VAR SAK PÅ SIN PLATS : En blandning av Tilldelnings- och Kappsäcksproblemet anpassat för optimering av Cytivas lagerstruktur

    Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för matematik och matematisk statistik

    Författare :Lina Hedlund; [2022]
    Nyckelord :inventory optimization; supermarkets; relocation of items; lageroptimering; supermarkets; omlokalisering av artiklar;

    Sammanfattning : Cytiva is a pharmaceutical company in Umeå that manufactures and administer hardware for medical instruments. A recurring problem for Cytiva is a lack of storage space, which is why they currently rent an external warehouse. The lack of space often results in the need to change storage places for items in order to create more storage space. LÄS MER

  7. 5. FEASIBILITY ANALYSIS AND EFFICIENT ROUTING FOR A PARTIALLY AUTOMATED DELIVERY SYSTEM WITHIN CHALMERS CAMPUS

    Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

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

    Sammanfattning : 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. LÄS MER