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 65 for “"INTEGER PROGRAMMING MODELS"”.
-
Integer programming models for the branchwidth problem
… algorithms obtained by combining dynamic programming techniques with branch decompositions. The running time and space of these algorithms strongly depend on the width of the utilized branch decomposition. Thus, finding optimal or close to optimal branch decompositions is very important …
-
Cutting Planes for Large Mixed Integer Programming Models
… thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general MIPs. In …
-
Integer Programming Models for finding Optimal Part-Machine Families
In this thesis, we develop integer programming models which find the optimal part-machine family solutions, that disaggregate a factory process at the lowest cost. The groupings created using the methods presented in this thesis can then act as the basis for the application of Group Technology, …
-
Mixed integer programming models for supply chain integrated planning
… plants, finishing plants and customers. Two main models have been developed based on different approaches, and they have been implemented in two different contexts. Various processes such as raw material procurement, capacity utilization, inventory, and distribution are integrated and optimized. …
-
Evaluating Mixed-Integer Programming Models over Multiple Right-hand Sides
A critical measure of the quality of a mixed-integer programming (MIP) model with fixed data is the difference, or gap, between the optimal objective value of the linear programming relaxation and that of the corresponding MIP. In many contexts, only an approximation of the right-hand sides may be …
-
COMPUTATIONALLY TRACTABLE STOCHASTIC INTEGER PROGRAMMING MODELS FOR AIR TRAFFIC FLOW MANAGEMENT
… associated with weather predictions, stochastic models are necessary. We address some of these problems using integer programming (IP). In general, IP models can be difficult to solve. However, if "strong" IP formulations can be found, then problems can be solved quickly by state of the art IP …
-
Complexity results and integer programming models for hospitals / residents problem variants
… such variants of HR from an algorithmic and integer programming viewpoint. The Hospitals / Residents problem with Couples (HRC) is a variant of HR that is important in practical applications because it models the case where couples submit joint preference lists over pairs of (typically …
-
Chemotherapy Outpatient Scheduling at the Segal Cancer Center Using Mixed Integer Programming Models
… thesis is to demonstrate the benefit of using integer programming to model and to solve some of the challenges faced by the Segal Cancer Center of the Jewish General Hospital in Montreal, Quebec, when designing appointment schedules. We study two scheduling problems. The chemotherapy outpatient …
-
Essays on sequence optimization in block cave mining and inventory policies with two delivery sizes
… in Block Cave Mining" we investigate the use of integer programming models to aid the practitioner in the early planning stages of a Block Cave Mine. Given the footprint of the ore body divided into draw points or grid squares, sequence optimization determines which draw points to open in which …
-
Cross-dock Scheduling with Known Shipment Unloading Order
… In the former scenario, we introduce five mixed integer programming models with enhanced pre-processing and extensions to minimize the total number of tardy products. In the later scenario, we proposed new linear mixed integer programming models where transportation time between dock doors are …
-
A column generation approach for stochastic optimization problems
… is a critical aspect of system design. Models and methods that take uncertainty into account can lead to significant reductions in cost. This dissertation investigates the use of stochastic optimization models for the following applications: (1) a generalized assignment problem (GAP) …
-
Optimal Fleet Size of an Integrated Production and Distribution Scheduling Problem for a Single Perishable Product
… distribution sequence are considered. Two mixed integer programming models are formulated to solve the single plant and two-plant problems and, then, heuristics based on evolutionary algorithms are provided to resolve the models in a reasonable time
-
Assignment problem for the U.S. Marine Corps: regional, culture, and language familiarization program
… a standard operating procedure. We developed two integer-programming models and a matching algorithm that utilizes top trading cycle and serial dictatorship. These models optimize the assignment based on Marines and USMC preferences. We find that the benchmark integer programing model is the best …
-
Optimal allocation of air services to the U.S. Pacific Surface Forces
Two integer programming models, called FLIGHT-HOURS I and II (or FR-I and FR-II), are developed to assist U.S. Pacific Fleet Air Services Planners in the allocation of air services to support basic and intermediate ship training requirements. Air services consist of aircraft towing air targets, …
-
Scheduling customer service representatives for the Workers’ Compensation Board of British Columbia
… provide good customer service. We developed two integer programming models and built an interface that would enable the supervisors to use the model interactively. We compared the results from the model to one of their schedules and found that the model used 5 fewer CSRs than currently in their …
-
Optimal airfield capacity expansion
… to deploy these modules, this thesis develops integer programming models. These models produce deployment schedules for modules that minimize the weighted combination of capacity shortfalls and the cost of transporting modules to their destinations. Also included is the option to redeploy …
-
Enhancing tractability of mixed-integer nonlinear programming models: case studies in energy and sports
We address three integer-programming models which are difficult to formulate and solve because, fundamentally, they are mixed-integer, nonlinear programs. These three applications are: (i) design of and dispatch for a forward operating base, or remote military installation, that possesses a …
-
DESIGNING CELLULAR MANUFACTURING SYSTEMS BY GRAPH-THEORETIC APPROACH (PRODUCTION SYSTEMS)
… such that a cost function is minimized. Two Integer Programming models are introduced to form the machine groups. An example is used to demonstrate the procedure.
-
Cutting and packing : problems, models and exact algorithms
Different integer programming models and exact algorithms for hard cutting and packing problems are addressed. We consider in particular the combinatorial problems of this family that are defined over a single dimension. The optimization procedures rely on tools from the field of integer …
-
Models and algorithms for hard optimization problems
… is devoted to exact solution methods for NP-hard integer programming models. We consider two of these problems, the cutting stock problem and the vehicle routing problem. Both problems have been studied for several decades by researchers and practitioners of the Operations Research eld. Their …
Page 1 of 4