• Login
    View Item 
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    •   Home
    • Theses and Dissertations
    • MS Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Malek Thesis.pdf
    Size:
    1.305Mb
    Format:
    PDF
    Description:
    PDF file
    Download
    Type
    Thesis
    Authors
    Mahayni, Malek A.
    Advisors
    Moshkov, Mikhail cc
    Committee members
    Alouini, Mohamed-Slim cc
    Shihada, Basem cc
    Program
    Computer Science
    KAUST Department
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Date
    2011-07
    Permanent link to this record
    http://hdl.handle.net/10754/209371
    
    Metadata
    Show full item record
    Abstract
    Finding optimal paths in directed graphs is a wide area of research that has received much of attention in theoretical computer science due to its importance in many applications (e.g., computer networks and road maps). Many algorithms have been developed to solve the optimal paths problem with different kinds of graphs. An algorithm that solves the problem of paths’ optimization in directed graphs relative to different cost functions is described in [1]. It follows an approach extended from the dynamic programming approach as it solves the problem sequentially and works on directed graphs with positive weights and no loop edges. The aim of this thesis is to implement and evaluate that algorithm to find the optimal paths in directed graphs relative to two different cost functions ( , ). A possible interpretation of a directed graph is a network of roads so the weights for the function represent the length of roads, whereas the weights for the function represent a constraint of the width or weight of a vehicle. The optimization aim for those two functions is to minimize the cost relative to the function and maximize the constraint value associated with the function. This thesis also includes finding and proving the relation between the two different cost functions ( , ). When given a value of one function, we can find the best possible value for the other function. This relation is proven theoretically and also implemented and experimented using Matlab®[2].
    Citation
    Mahayni, M. A. (2011). Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions. KAUST Research Repository. https://doi.org/10.25781/KAUST-0AV2K
    DOI
    10.25781/KAUST-0AV2K
    ae974a485f413a2113503eed53cd6c53
    10.25781/KAUST-0AV2K
    Scopus Count
    Collections
    MS Theses; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.