Sökning: "heuristic algorithms"

Visar resultat 6 - 10 av 80 avhandlingar innehållade orden heuristic algorithms.

  1. 6. Parallel algorithms for solving the train timetable rescheduling problem

    Författare :Sai Prashanth Josyula; Johanna Törnquist Krasemann; Lars Lundberg; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Parallel computing; Parallel heuristic search algorithms; Computer Science; Datavetenskap;

    Sammanfattning : In railways, it is essential to achieve high train punctuality. Thus, whenever disturbances occur, it is important to reschedule the trains effectively. This task is typically handled manually by traffic controllers in real-time. LÄS MER

  3. 7. Optimization of Joint Cell, Channel and Power Allocation in Wireless Communication Networks

    Författare :Mikael Fallgren; Anders Forsgren; Zhi-Quan (Tom) Luo; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Wireless multicell networks; Optimization; OFDMA; Shannon capacity; Complexity; NP-hard; Relays; Allocation problems; Heuristic algorithms;

    Sammanfattning : In this thesis we formulate joint cell, channel and power allocation problems within wireless communication networks. The objectives are to maximize the user with mini- mum data throughput (Shannon capacity) or to maximize the total system throughput, referred to as the max-min and max-sum problem respectively. LÄS MER

  4. 8. Joint ML multi user detection of block coded CDMA over the AWGN channel using A*

    Författare :Peter Németh; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; CDMA; heuristic function; complexity reduction; priority-first algorithms; A*; code division multiple access; linear block codes;

    Sammanfattning : .... LÄS MER

  5. 9. Probabilistic and Experimental Analysis of Heuristic Algorithms for the Multiple-Depot Vehicle-Routing Problem

    Författare :Libertad Tansini; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; probabilistic analysis; Multi-Depot Vehicle-Routing problem; heuristics; Time-Windows;

    Sammanfattning : The aim of this thesis is to analyze different heuristic algorithms for solving the Multi-Depot Vehicle-Routing problem (MDVRP) with k depots and n points to be serviced (customers). The objective is to produce a set of service routes which minimizes the total distance traveled. Heuristic approaches are essential since the problem is NP-hard. LÄS MER

  7. 10. Parallel algorithms for real-time railway rescheduling

    Författare :Sai Prashanth Josyula; Johanna Törnquist Krasemann; Lars Lundberg; Mats Brorsson; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In railway traffic systems, it is essential to achieve a high punctuality to satisfy the goals of the involved stakeholders. Thus, whenever disturbances occur, it is important to effectively reschedule trains while considering the perspectives of various stakeholders. LÄS MER