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 13 of 13 for “"Binary programming"”.

  1. Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization

    A model is presented that utilizes nonlinear binary mathematical programming and the predictive crash methodology found in the AASHTO Highway Safety Manual to prioritize the selection of intersection safety projects. This research improves upon methods employed by prioritization tools such as the …

    unr Repository record for Development of a Nonlinear Binary Programming Model for Intersection Improvement Prioritization (opens in a new tab)

  2. Long-term scheduling in underground coal mining using mixed binary programming

    … and the high level of uncertainty, a mixed binary programming model has been developed as an aid for generating production schedules which maximize the associated net present value. Defining the mine layout as a precedence network, with the nodes representing mining blocks, a solution …

    vt Repository record for Long-term scheduling in underground coal mining using mixed binary programming (opens in a new tab)

  3. Binary Sparse Modeling for Multi-Anchor Direct Localization using Channel State Information

    … problem, the study takes advantage of efficient binary programming solvers, specifically utilizing Markov Chain Monte Carlo methods to solve the Ising energy problem. Further advancing the field of sparse modeling, this thesis explores the concept of structured sparsity in the received signals …

    toronto-retro Repository record for Binary Sparse Modeling for Multi-Anchor Direct Localization using Channel State Information (opens in a new tab)

  4. Dense implementations of binary cellular nonlinear networks : from CMOS to nanotechnology

    … be significantly simplified. When working with binary images only, all coefficients in the template matrix can also be reduced to binary values. In this thesis, such a binary programming scheme is presented as a means to reduce the cell size as well as to provide the circuits composed of …

    aalto Repository record for Dense implementations of binary cellular nonlinear networks : from CMOS to nanotechnology (opens in a new tab)

  5. Large-scale Evacuation Routing and Scheduling Optimization with Uninterrupted Traffic Flow

    … In the first phase, a multiple-objective binary programming model, with the objectives of minimizing the network clearance time and total in-network time is proposed to find an optimal routing plan. In the second phase, a simulation-based scheduling Heuristic is proposed to dynamically …

    maryland Repository record for Large-scale Evacuation Routing and Scheduling Optimization with Uninterrupted Traffic Flow (opens in a new tab)

  6. Solving Reverse Logistics: Optimizing Multi-Echelon Reverse Network

    … A single-objective, mixed-integer, binary programming was utilized to optimize the variable cost of handling, transshipping, facilities, and carrying of reverse logistics. Apple Inc.’s current product take-back strategy was carefully evaluated and analyzed to suggest potential …

    calpoly Repository record for Solving Reverse Logistics: Optimizing Multi-Echelon Reverse Network (opens in a new tab)

  7. Balancing of Parallel U-Shaped Assembly Lines with Crossover Points

    … multi-line stations, and regular stations. The binary programming formulation presented in this research can be employed for any scenario (e.g. task times, cycle times, and the number of tasks) in the configuration that includes a crossover point. The comparison of numerical problem solutions …

    vt Repository record for Balancing of Parallel U-Shaped Assembly Lines with Crossover Points (opens in a new tab)

  8. Binary Sparse Modelling for Localization Using WiFi Channel State Information

    … modelling-based localization problem using a binary program, constraining the decision variables to take on values of 0 or 1, and we derive conditions under which this conversion perfectly recovers the signal support. This approach is motivated by the recent proliferation of highly effective …

    toronto-retro Repository record for Binary Sparse Modelling for Localization Using WiFi Channel State Information (opens in a new tab)

  9. EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING

    … assignment problem, which is an NP-hard binary programming problem. It is shown that the proposed dual approach is equivalent to the Lagrangian relaxation method in terms of the best value attainable by the two approaches. However, the pure dual representation is not only more elegant, …

    mcmaster Repository record for EFFICIENT DATA ASSOCIATION ALGORITHMS FOR MULTI-TARGET TRACKING (opens in a new tab)

  10. Optimization Methods for Distribution Systems: Market Design and Resiliency Enhancement

    … of a two-module optimization models based on binary programming and three phase unbalanced optimal power flow. Furthermore, a Reinforcement Learning (RL) method along with a Monte Carlo tree search algorithm has been proposed to solve the scalability problem for resiliency enhancement.

    vt Repository record for Optimization Methods for Distribution Systems: Market Design and Resiliency Enhancement (opens in a new tab)

  11. Location Problems in Supply Chain Design: Concave Costs, Probabilistic Service Levels, and Omnichannel Distribution

    … program, and second is a purely nonlinear programming problem. Extensive computations are performed to measure the efficiency of two formulations, and managerial insights are provided to understand the behavior of the model under different scenarios of concavities. The second work focuses …

    concordia Download PDF for Location Problems in Supply Chain Design: Concave Costs, Probabilistic Service Levels, and Omnichannel Distribution (opens in a new tab)

  12. Improved Mixed-Integer Models of a Two-Dimensional Cutting Stock Problem

    This paper is concerned with a family of two-dimensional cutting stock problems that seeks to cut rectangular regions from a finite collection of sheets in such a manner that the minimum number of sheets is used. A fixed number of rectangles are to be cut, with each rectangle having a known length …

    clemson Repository record for Improved Mixed-Integer Models of a Two-Dimensional Cutting Stock Problem (opens in a new tab)

  13. Biobjective Optimization over the Efficient Set Methodology for Pareto Set Reduction in Multiobjective Decision Making: Theory and Application

    … problem is reformulated as a biobjective mixed binary program and the secondary criteria are generalized to any convenient linear functions. A solution approach is devised in which an auxiliary mixed binary program searches for unsupported Pareto outcomes and a novel linear programming filtering …

    tamu Repository record for Biobjective Optimization over the Efficient Set Methodology for Pareto Set Reduction in Multiobjective Decision Making: Theory and Application (opens in a new tab)