Essays about: "Discrete optimization"
Showing result 11 - 15 of 89 essays containing the words Discrete optimization.
-
11. A study of how Lean principles affect process ergonomics : A case study at Volvo CE Braås using discrete event simulation
University essay from Linnéuniversitetet/Institutionen för maskinteknik (MT)Abstract : To stay competitive in today's market, organizations focus on efficiency to reduce costs. Since there are still processes that are manually handled, there is a risk of affecting workers health during streamlining. Volvo CE Braås are currently working with a takt time of 35 minutes throughout their facility. READ MORE
-
12. Discrete Event Simulation of the Paint shop at VBG Truck Equipment : A method for Work shift Optimization and Balanced Production flow
University essay from Högskolan Väst/Institutionen för ingenjörsvetenskapAbstract : The background for this thesis work emanates from a desire to drive the production of the VBG Truck Equipment factory in Vänersborg a step further to catch up with the Industry 4.0 standards. Discrete Event Simulation (DES) is a widely adopted tool within industries to model real-world systems to improve their processes. READ MORE
-
13. Discrete Flower Pollination Algorithm for the Graph Coloring Problem
University essay from KTH/DatavetenskapAbstract : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. READ MORE
-
14. Active Learning for Solving Expensive Optimization Problems
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Many practical engineering and computer science problems can be translated into a global otimization problem where the task is to find the best (optimal) vector 𝒙𝒙∗ that gives the smallest possible function value 𝑓𝑓 = 𝑓𝑓(𝒙𝒙∗) for some function 𝑓𝑓() of interest. Often the function 𝑓𝑓() is expensive in the sense that it cannot be easily evaluated computationally or experimentally in terms of time and/or resources required. READ MORE
-
15. Investigating Multi-Objective Reinforcement Learning for Combinatorial Optimization and Scheduling Problems : Feature Identification for multi-objective Reinforcement Learning models
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Reinforcement Learning (RL) has in recent years become a core method for sequential decision making in complex dynamical systems, being of great interest to support improvements in scheduling problems. This could prove important to areas in the newer generation of cellular networks. READ MORE
