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 20 of 31 for “"Mixed integer programming problem"”.

  1. Inventory Constrained Maritime Routing and Scheduling for Multi-Commodity Liquid Bulk

    This research deals with chemical transport Problems involving maritime pick up from and delivery to storage tanks that are continuously filled and drained. More specifically, we developed decision technology to determine the efficient use of multi compartment bulk ships to transport chemical …

    gatech Repository record for Inventory Constrained Maritime Routing and Scheduling for Multi-Commodity Liquid Bulk (opens in a new tab)

  2. An optimal program initiative selection model for USMC program objective memorandum planning

    This thesis formulates the problem of selecting modernization program initiatives for implementation by the Marine Corps as a mixed integer programming problem. The problem is a generalization of the traditional resource allocation problem in operations research. When implemented as a computer …

    nps Repository record for An optimal program initiative selection model for USMC program objective memorandum planning (opens in a new tab)

  3. Software reliability optimization by redundancy and software quality management

    … A process for reliability-related quality programming is developed to fill existing gaps in software design and development so that a quality programming plan can be achieved. A software reliability-to-cost relation is developed both from a software reliability-related cost model and …

    iastate Repository record for Software reliability optimization by redundancy and software quality management (opens in a new tab)

  4. New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering

    Many real-world optimisation problems are discrete in nature. Although recent rapid developments in computer technologies are steadily increasing the speed of computations, the size of an instance of a hard discrete optimisation problem solvable in prescribed time does not increase linearly with …

    brunel Repository record for New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering (opens in a new tab)

  5. Realigning the U.S. Navy Recruiting Command

    This thesis addresses two problems in aligning the recruiting structure for Navy Recruiting Command. The first problem involves two decisions affecting recruiting stations within a single recruiting district: which stations should remain open and how many recruiters should be assigned to each open …

    nps Repository record for Realigning the U.S. Navy Recruiting Command (opens in a new tab)

  6. A STOWAGE PLANNING MODEL FOR MULTIPORT CONTAINER TRANSPORTATION

    … In addition, load planning is a very complex problem, since the planners have to account for the stability of the ship and rely on a variety of other stochastic processes. Unfortunately, the load-planning problem is NP-hard making it difficult to obtain an optimal solution in polynomial time. …

    maryland Repository record for A STOWAGE PLANNING MODEL FOR MULTIPORT CONTAINER TRANSPORTATION (opens in a new tab)

  7. Optimal scheduling of hydro-thermal power generation systems

    … of hydro-thermal power generation systems. This problem, usually referred to as the unit commitment and economic dispatch problem, manifests itself as a large scale mixed integer programming problem. In the first instance a linear model is built and solved using branch-and-bound. This approach …

    strathclyde Repository record for Optimal scheduling of hydro-thermal power generation systems (opens in a new tab)

  8. The use of flying-squads in the operation of municipal fire suppression activities

    … squads as manpower transport vehicles. The exact problem considered in this thesis is that of determining (a) the number of flying squads to use, (b) the locations/allocations of each flying squad, (c) the deployment strategy of each squad, and (d) the size of each squad and the job skill levels …

    vt Repository record for The use of flying-squads in the operation of municipal fire suppression activities (opens in a new tab)

  9. Investment Planning For Electric Power Systems To Mitigate Extreme Events

    … and behave in their own selfinterest. The problem was formulated as a multi-level mixed-integer programming problem and we implemented a Tabu search with an embedded greedy algorithm to find the optimum defense strategy. We model the regional earthquake hazard using a four step process that …

    cornell Repository record for Investment Planning For Electric Power Systems To Mitigate Extreme Events (opens in a new tab)

  10. A computational study of vehicle routing applications

    … and optimally for very small instances. The problem is complicated by the presence of multiple depots, time windows, and the scheduling of lunch breaks. It is shown that the problem can be formulated as a mixed integer programming problem and, in very small instances, solved to optimality …

    rice Repository record for A computational study of vehicle routing applications (opens in a new tab)

  11. Performance modelling and automated algorithm design for NP-hard problems

    … applications, some important classes of problems are NP-complete. Although no worst-case polynomial time algorithm exists for solving them, state-of-the-art algorithms can solve very large problem instances quickly, and algorithm performance varies significantly across instances. In …

    ubc Repository record for Performance modelling and automated algorithm design for NP-hard problems (opens in a new tab) Download PDF for Performance modelling and automated algorithm design for NP-hard problems (opens in a new tab)

  12. Optimization of freight truck driver scheduling based on operation cost model for Less-Than-Truckload (LTL) transportation

    … a carrier. In this thesis, the driver assignment problem is investigated and methods for obtaining lower total operational costs are introduced for small and medium-sized truck freight transportation companies. Three interrelated research topics, including the following, have been systematically …

    uvic Repository record for Optimization of freight truck driver scheduling based on operation cost model for Less-Than-Truckload (LTL) transportation (opens in a new tab)

  13. Cooperative resource allocation schemes for multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems

    … technology with MIMO resource allocation as a mixed-integer programming problem can improve spectrum reuse efficiency through introducing diversity in both power domain and space domain. However, MIMO-NOMA strategy design has a high computational complexity as it has high dimension beamforming …

    manitoba Repository record for Cooperative resource allocation schemes for multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems (opens in a new tab)

  14. DYNAMIC RESOURCE ALLOCATION FOR MULTIUSER VIDEO STREAMING

    … dependency constraints of video bitstreams, and mixed integer optimization. To overcome these challenges, a general strategy is to dynamically allocate resources according to the changing environments and requirements, so as to improve the overall system performance and ensure quality of service …

    maryland Repository record for DYNAMIC RESOURCE ALLOCATION FOR MULTIUSER VIDEO STREAMING (opens in a new tab)

  15. A Lagrangean Relaxation and A Heuristic for the Pooling Problem

    The pooling problem is one of the fundamental optimization problems encountered in the petroleum industry. In the pooling problem, final products are produced using two stages of blending operations. In the first stage, raw materials are mixed together to produce intermediate products. In the …

    waterloo Repository record for A Lagrangean Relaxation and A Heuristic for the Pooling Problem (opens in a new tab)

  16. Optimal Capital Requirements in Financial Networks with Fire Sales

    <p>I explore and analyze a problem of finding the socially optimal capital requirements for financial institutions considering two distinct channels of contagion: direct exposures among the institutions, as represented by a network and fire sales externalities, which reflect the negative price …

    duke Repository record for Optimal Capital Requirements in Financial Networks with Fire Sales (opens in a new tab)

  17. Robust Direct Aperture Optimization Methods for Cardiac Sparing in Left-Sided Breast Cancer Radiation Therapy

    … leading to a large-scale difficult-to-solve mixed integer programming problem. To contend with the complexity of the problem, additional modelling approaches are suggested for improving solution efficiency. These approaches include a hybrid heuristic-optimization technique, which provides …

    waterloo Repository record for Robust Direct Aperture Optimization Methods for Cardiac Sparing in Left-Sided Breast Cancer Radiation Therapy (opens in a new tab)

  18. SENSITIVITY ANALYSIS AND STOCHASTIC OPTIMIZATIONS IN STOCHASTIC ACTIVITY NETWORKS

    … gradient estimators to network optimization problems. A new algorithm called Threshold Arc Criticality (TAC) for estimating the arc criticalities of stochastic activity networks is proposed. TAC is based on the following result: given the length of all arcs in a SAN except for the one arc of …

    maryland Repository record for SENSITIVITY ANALYSIS AND STOCHASTIC OPTIMIZATIONS IN STOCHASTIC ACTIVITY NETWORKS (opens in a new tab)

  19. Optimization Models and Numerical Algorithms for an Elevator Group Control System

    … current assignments. This makes the control problem of the EGCS dynamic. The EGCS solves a snapshot instance of the elevator dispatching problem (EDP) anew in intervals less than a second. Its solution defines complete elevator routes by minimizing, e.g., passenger waiting or journey times, …

    aalto Repository record for Optimization Models and Numerical Algorithms for an Elevator Group Control System (opens in a new tab)

  20. Integrated Decisions for Supply Chain Design and Inventory Allocation Problem

    … facility location and inventory allocation problem for designing a distribution network with multiple national (import) distribution centers (NDC) and retailers. The key decisions are where to locate the RDCs and how much inventory to hold at the different locations such that the total …

    gatech Repository record for Integrated Decisions for Supply Chain Design and Inventory Allocation Problem (opens in a new tab)

Page 1 of 2