Essays about: "NP-Hard"

Showing result 16 - 20 of 63 essays containing the word NP-Hard.

  1. 16. Multi-Constrained Network Occupancy Optimization

    University essay from Mälardalens högskola/Inbyggda system

    Author : Amar Halilovic; Nedim Zaimovic; [2020]
    Keywords : ;

    Abstract : Increasingly different types of information are required in systems, resulting in the diverse and widespread use of networks. The increase in the number of devices on networks significantly increases network traffic and network load, limiting network propagation speed, and increasing the possibility of collisions and lost information. READ MORE

  3. 17. Artificial Intelligence for Warehouse Picking Optimization - An NP-Hard Problem

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Louis Janse van Rensburg; [2019]
    Keywords : ;

    Abstract : This master thesis work demonstrates an approach to processing warehouse management system log-dump datasets and architectural CAD floor maps for graphical network representation of large warehouse environments. This representation enables use of stochastic search and linear programming algorithms (Simulated Annealing and Concorde TSP Solver) for the purpose of warehouse pick-run routing optimization (a case of the NP-Hard Travelling Salesperson Problem). READ MORE

  4. 18. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)

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

    Author : Isabella Andersson; Carl Petter Svensson; [2019]
    Keywords : ;

    Abstract : Timetabling is a time consuming and difficult task for large organizations. One popular research field is the university course timetabling problem (UCTP). UCTP is the NP-hard combinatorial problem of scheduling courses at a university while satisfying some constraints. READ MORE

  5. 19. Using machine learning for resource provisioning to run workflow applications in IaaS Cloud

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

    Author : William Våge; [2019]
    Keywords : ;

    Abstract : The rapid advancements of cloud computing has made it possible to execute large computations such as scientific workflow applications faster than ever before. Executing workflow applications in cloud computing consists of choosing instances (resource provisioning) and then scheduling (resource scheduling) the tasks to execute on the chosen instances. READ MORE

  6. 20. University Course Scheduling Optimization under Uncertainty based on a Probability Model

    University essay from Malmö universitet/Fakulteten för teknik och samhälle (TS)

    Author : David Sandh; Lucas Knutsäter; [2019]
    Keywords : University Timetabling; Timetabling; Optimization; Uncertainty; Evolutionary algorithms;

    Abstract : In this thesis, we present a way to model uncertainty when optimizing the UniversityTimetabling Problem. It is an NP-hard, combinatorial and highly constrained problem.In this thesis, we first propose a standardized model based on the data from MalmöUniversity. READ MORE