Sökning: "heuristic algorithms"

Visar resultat 11 - 15 av 80 avhandlingar innehållade orden heuristic algorithms.

1. 11. Optimization heuristic solutions, how good can they be? : With empirical applications in location problems

   Författare :Xiangli Meng; Kenneth Carling; Christoph Flath; Högskolan Dalarna; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Complex Systems – Microdata Analysis; Komplexa system - mikrodataanalys;

   Sammanfattning : Combinatorial optimization problems, are one of the most important types of problems in operational research. Heuristic and metaheuristics algorithms are widely applied to find a good solution. LÄS MER

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

   Författare :Raad Salman; Göteborgs universitet; []
   Nyckelord :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;

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

4. 13. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

   Författare :Mattias Fält; Institutionen för reglerteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; First-order methods; Convex Optimization; Nonsmooth Optimization; Large-scale Optimization; Iterative Methods; Douglas-Rachford splitting; Line Search;

   Sammanfattning : Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low computational cost per iteration. LÄS MER

5. 14. Optimization, Design, and Analysis of Flexible-Grid Optical Networks with Physical-Layer Constraints

   Författare :Li Yan; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; GN model; optimization; resource allocation; Flexible-grid optical network; heuristic algorithm; DCNs; regenerator location;

   Sammanfattning : The theme of this thesis is the optimization, design, and analysis of flexible-grid optical networks that are constrained by physical-layer impairments (PLIs). We consider three flexible-grid network scenarios. LÄS MER

7. 15. Distributed Multiple Access and Service Differentiation Algorithms for Wireless Networks

   Författare :Thomas Nilsson; Per-Åke Wedin; Jerry Eriksson; Lennart Bondesson; Andrzej Duda; Umeå universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Wireless Local Area Networks; Medium Access Control; Quality of Service; Resource Allocation; IEEE 802.11; IEEE 802.11e; Datatransmission; Datatransmission;

   Sammanfattning : Communicating over a wireless channel poses many unique challenges not found in wired communication because of the special characteristics of the wireless channel. The capacity in a wireless network is typically scarce as a result of the limited bandwidth and many distinct phenomenons, like attenuation and interference, that work destructively on the received signals. LÄS MER