Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Transportation problems (Programming)"”.

  1. A heuristic algorithm for U.S. naval mission resource allocation

    … Recent research has developed a mixed-integer programming optimization model called Central-West Africa Resource and Mission Allocation (CARMA) that seeks to efficiently route a single naval vessel embarked with expeditionary partnership teams conducting theater security cooperation missions, …

    nps Repository record for A heuristic algorithm for U.S. naval mission resource allocation (opens in a new tab)

  2. The Pickup and Delivery Problem with Split Loads

    … a heuristic for the solution of large scale problems, and apply this heuristic to randomly generated data sets. Various load sizes are tested, with the experimental results supporting the finding that most benefit with split loads occurs for load sizes just above one half vehicle capacity. …

    gatech Repository record for The Pickup and Delivery Problem with Split Loads (opens in a new tab)

  3. An Efficient Implementation of the Transportation Problem

    The transportation problem is a special type of linear program in which the objective is to minimize the total cost of shipping a single commodity from a number of sources (m) to a number of destinations or sinks (n). Because of the special structure of the transportation problem, a special …

    unf Repository record for An Efficient Implementation of the Transportation Problem (opens in a new tab) Download PDF for An Efficient Implementation of the Transportation Problem (opens in a new tab)

  4. Aspects of Mass Transportation in Discrete Concentration Inequalities

    … of interest in Monge's 18th century mass transportation problem, with most of the activity limited to continuous spaces. This thesis, consequently, develops techniques based on mass transportation for the purpose of obtaining tight concentration inequalities in a discrete setting. Such …

    gatech Repository record for Aspects of Mass Transportation in Discrete Concentration Inequalities (opens in a new tab)

  5. On the capacity provisioning on dynamic networks

    … The works are extensions of sink location problems on dynamic networks, which are motivated by real-life disaster events such as the Tohoku Japanese Tsunami, the Australian wildfire and many more. The available algorithms in this context consider the location of the sinks (safe-havens) with …

    lethbridge Repository record for On the capacity provisioning on dynamic networks (opens in a new tab)

  6. Efficient algorithms for the fixed charge problem

    … to approximate the fixed charge; then linear programming with the restricted-basisentry technique is used to arrive at the final solution. Although this method starts with an approximated version of the fixed charge component, it arrives at an exact value to the objective function without the …

    ucf Repository record for Efficient algorithms for the fixed charge problem (opens in a new tab)