Search for dissertations about: "Assignment problem"

Showing result 1 - 5 of 123 swedish dissertations containing the words Assignment problem.

2. 1. The Tail Assignment Problem

   Author : Mattias Grönkvist; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; hybrid optimization; fleet planning; aircraft routing; column generation; airline optimization; tail assignment; constraint programming;

   Abstract : The Aircraft Assignment problem is the problem of assigning flights to aircraft in such a way that some operational constraints are satisfied, and possibly that some objective function is optimized.We propose an approach to aircraft assignment which captures all operational constraints, including minimum connection times, airport curfews, maintenance, and preassigned activities. READ MORE

4. 2. Beating a Random Assignment : Approximating Constraint Satisfaction Problems

   Author : Gustav Hast; Johan Håstad; Uri Zwick; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer science; Datalogi;

   Abstract : An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. READ MORE

5. 3. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem

   Author : Raad Salman; Göteborgs universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; PCGmTSP; GTSP; SOP; mTSP; branch and bound; asymmetric generalized multiple traveling salesman problem; VRP; PCGTSP; dynamic programming; sequential ordering problem; vehicle routing problem; ant colony optimization; metaheuristic local search heuristic; precedence constraints; edge exchange; ant colony optimization;

   Abstract : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. READ MORE

6. 4. On random satisfiability and optimization problems

   Author : Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

   Abstract : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. READ MORE

7. 5. Synergistic Strategies in Multi-Robot Systems: Exploring Task Assignment and Multi-Agent Pathfinding

   Author : Yifan Bai; George Nikolakopoulos; Tomi Westerlund; Luleå tekniska universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Autonomous robots; Multi-robot systems; Task assignment; Multi-agent path-finding; Robotics and Artificial Intelligence; Robotik och artificiell intelligens;

   Abstract : Robots are increasingly utilized in industry for their capability to perform repetitive,complex tasks in environments unsuitable for humans. This surge in robotic applicationshas spurred research into Multi-Robot Systems (MRS), which aim to tackle complex tasksrequiring collaboration among multiple robots, thereby boosting overall efficiency. READ MORE