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 49 for “"branch and bound algorithm"”.
-
A parallel branch-and-bound algorithm for thin-film optical systems, with application to realizing a broadband omnidirectional antireflection coating for silicon solar cells
… systems, this thesis work develops a parallel branch-and-bound computational system on Amazon's EC2 platform, using the Taylor model mathematical/computational system due to Berz and Makino to construct tight rigorous bounds on the merit function on subsets of the search space (as required by a …
-
A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph
… a large problem into several smaller problems and uses a branch and bound algorithm to find the minimal Hamiltonian chain of each partitioned subproblem. The graph is decomposed and partitioned into subproblems with the use of necessary conditions for the existence of a Hamiltonian chain. This …
-
Global Optimization in Least Squares Problems in FTIR Spectroscopy and X -Ray Crystallography
… we develop novel optimization formulations and algorithms that exploit the special model structure of the problem. For the case of centrosymmetric structures, we first formulate the problem as a 0--1 linear programming problem and suggest a branch-and-bound algorithm for solving it. Based on …
-
Robust Nonlinear Control Using Bilinear Matrix Inequalities With Application to a Batch Crystallization Process
… problem, has been shown to be NP-hard, and its efficient solution is also an open research problem. Various solution strategies have been incorporated to a branch and bound algorithm solving the aforementioned optimization problem, and were compared for various controller designs.
-
Lot streaming and batch scheduling: splitting and grouping jobs to improve production efficiency
… of grouping jobs to improve the use of resources and customer satisfaction. We use a network representation and critical path approach to analyse the lot streaming problem of finding optimal sublot sizes and a job sequence in a two-machine flow shop with transportation and setup times. We …
-
A computational model for multi-objective optimization of zero emission power plants
Choosing among technologies is difficult and requires a means of making comparisons across different technologies. This dissertation proposes a new methodology to make comparisons across different technologies and across different times based on a user supplied set of evaluation criteria. A simple …
-
Optimizing safety stock placement in general network supply chains
… a manufacturing company that faces uncertain demand and needs to provide a high level of service to its customers. The amount of stock held should be small to minimize holding and storage costs while retaining the ability to serve customers on time and satisfy most, if not all, of the demand. …
-
New optimization approaches to matrix factorization problems with connections to natural language processing
… compressed sensing, discrete component analysis, and latent Dirichlet allocation. For each new formulations, we develop efficient solution algorithms using discrete and robust optimization, and demonstrate tractability and effectiveness in computational experiments. In Chapter 1, we develop a …
-
An integrated approach to the optimal sequencing of robot operations in a workcell
… A robot transports jobs from buffers to machines and from machines to buffers. The robots used in the system are 5 jOint cylindrical coordinate robots. All the robots are identical in design and capability. For the type of robot used in this study its closed form inverse kinematic solution is …
-
Experiments in real time path planning for a small unmanned helicopter using mixed integer linear programming
… mathematical programming to perform simulated and actual flight experiments with the MIT autonomous helicopter platform. The experimental platform mechanical hardware, avionics and software architecture are described. Mixed Integer Linear Programming formulations for guidance experiments in …
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
… directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation Problem. Using linear programming relaxations constructed via the Reformulation-Linearization Technique (RLT), …
-
Globally Optimal Robust Control for Large-Scale Sheet and Film Processes
Sheet and film processes such as polymer film extruders, paper machines, and coating processes are large scale and high speed. Addressing model uncertainty for these processes is critically important because model uncertainty can cause the closed loop system to perform poorly. Here an approach is …
-
The Acacia Berlandieri Species Group: Armed New World Members of Subgenus Aculeiferum (Fabaceae) With Distributions Restricted North of the Isthmus of Tehuantepec, Mexico
Data from all 15 non-hybrid ingroup and seven outgroup species for 24 discrete morphological characters were analysed by unconstrained simultaneous parsimony analysis using PAUP* 4.0, both with and without hybrids. For these analyses with the branch-and-bound algorithm, the character states were …
-
Global Non-Convex Optimization with Integer Variables
… the Relaxation Perspectification Technique - Branch and Bound (RPT-BB). In this thesis, we extend the RPT-BB approach to the binary, mixed-binary, integer, and mixed-integer variable domains. We outline a novel branch-and-bound algorithm that makes use of the Relaxation Perspectification …
-
A discrete equal-capacity p-Median problem
… directly proportional to the shipping distance and the amount shipped. A mixed integer programming formulation of the unbalanced, but equal capacitated case is analyzed. First we develop a dynamic programming procedure for a p-median problem on a chain graph. In the second part we develop an …
-
Advances in Sparse and Low Rank Matrix Optimization for Machine Learning Applications
… in operations research, machine learning, and statistics exhibit natural formulations as cardinality or rank constrained optimization problems. Sparse solutions are desirable for their interpretability and storage benefits. Moreover, in the machine learning setting, sparse solutions exhibit …
-
OPTIMISATION AND INTERDICTION PROBLEMS FOR NETWORK SAFETY
… this problem, we propose an exact combinatorial branch-and-bound algorithm alongside several randomised heuristics. Next, we introduce a family of Binary Interdiction Problems, referred to as Hard Interdiction Problems, involving two agents: the attacker, who acts as the leader, and the defender, …
-
Determining molecular conformation from distance or density data
… is of growing importance in modern chemistry and biology. This thesis presents two practical, systematic algorithms for two structure determination problems. Both algorithms are branch-and-bound techniques adapted to their respective domains. The first problem is the determination of …
-
Control and Convolutional Neural Net Based Pose Estimation for On-Orbit Assembly
… The field of on-orbit assembly is still nascent, and few projects exist to technically investigate its feasibility. TESSERAE, or Tessellated Electromagnetic Space Structures for Exploration of Reconfigurable Adaptive Environments, a project out of the MIT Media Lab Space Exploration Initiative, is …
Page 1 of 3