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 33 for “"Bin packing"”.
-
Near-optimal bin packing algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1973.
-
Random planar matching and bin packing
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.
-
Multi-objective optimisation of the generalized bin packing problem
… multi-objective optimisation of the generalized bin packing problem, which involves the allocation of compulsory and non-compulsory items into a set of bins. The items have characteristics such as weight, width, height, and due date, while the bins have characteristics such as capacity and cost. …
-
Instance space analysis for the generalized bin packing problem algorithms
Instance space analysis for the generalized bin packing problem algorithms In the generalised bin packing problem, the objective is to pack a selected set of profitable non-compulsory items with all the compulsory ones into a set of bins such that the resulting packing cost is minimised. The total …
-
Asymptotic Worst-Case Analyses for the Open Bin Packing Problem
The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The …
-
Power of d choices for large-scale bin packing: a loss model
A system with N parallel servers is considered in our thesis. Each server consists of B units of a resource and jobs arrive at this system according to a Poisson process. Each job stays in the system for an exponentially distributed amount of time. Moreover, each job may request different units of …
-
Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem
… the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing …
-
Transportation resource scheduling in food retail industry
… The goal is to maximize driver utilization. A "Bin-packing" approach is employed to solve the problem. A Bin-packing problem concerns packing a list of items into the minimal number of unit capacity bins. In our problem, the drivers correspond to the bins and the daily delivery tasks are …
-
Piecewise truckload network procurement
… entities and frames network allocation as a bin-packing problem, with constraints that attempt to achieve both balance and, implicitly, synergy preservation. These two approaches are illustrated and evaluated using a small subnetwork consisting of lanes from a large shipper. While the graph …
-
Topics in Packing and Scheduling
Packing and scheduling models include some of the most fundamental problems in operations research and computer science. These broad classes include a wide range of models with applications including logistics, production planning, wireless network design, circuit design, and cloud computing, to …
-
Metaheuristic Optimization for Automatic Arrangement of Power Electronics Components in a Shipboard Electrical Distribution System
… we reduce the placement problem to a 2D bin-packing problem, leveraging a hybrid approach combining Genetic Algorithms and Simulated Annealing. This approach enables the generation of optimized placements that find the extremes of arbitrary heuristics, including minimizing routing …
-
Combinatorial optimisation for sustainable cloud computing
… from the realm of mathematical modeling and combinatorial optimisation. We introduce a novel combinatorial optimisation problem suitable for modeling core consolidation problems arising in workload management in data centres. This problem extends on the well-known bin packing problem. We develop …
-
Automatic, Careful Online Packing of Groceries Using a Soft Robotic Manipulator and Multimodal Sensing
… of unknown objects to enable sorting and packing. Although bin packing has been a key benchmark task for robotic manipulation, the community has mainly focused on the placement of rigid rectilinear objects within the container. We address this by presenting a soft robotic hand that uses a …
-
Optimization algorithms for loading military diesel generators
… cuckoo search (CS), first fit decreasing (FFD) bin packing, and an exhaustive search (ES) method. It is found that at large enough search spaces, the optimization algorithms can discover reasonably optimal solutions while substantially decreasing search time. For this application, FFD has more …
-
Approximation algorithms for packing and scheduling problems
In this thesis we consider three combinatorial optimization problems. Specifically, we study packing and scheduling questions of relevance in several areas of operations research, including interconnection networks and switch scheduling, VLSI design, and processor scheduling. The first chapter …
-
Towards mitigating co-incident peak power consumption and managing energy utilization in heterogeneous clusters
… along with different scheduling policies such as Bin Packing and First Fit. We characterize the performance of Electron, in comparison with the widely used Aurora framework. On average, our experiments show that Electron can reduce the 95th percentile of CPU and DRAM power usage by 27.89%, total …
-
High-throughput machine learning algorithms
… Some contributions include: the evaluation of bin-packing methods for efficiently scheduling small batches of dependent computations to GPU hardware execution units, numerically stable reduction operators for higher-order statistical moments, and memory bandwidth optimisation for GPU shuffling. …
-
Integrated supply and production network design
… of manufacturing capacity. Finally, a couple of bin packing algorithm heuristics were tested for job scheduling. The results demonstrated significant time savings in job scheduling and have highlighted the need to automate the scheduling process.
-
Design of tool for the optimization of deck area assignments with integration into existing naval ship design programs
… size. Fortunately this type of problem, known as Bin Packing, is well understood in computer science. Metaheuristic methods of obtaining near-optimal solutions in a finite timeframe exist that are reasonable enough for use. This thesis presents a ship design tool that pairs two of these …
-
An Energy-Efficient Multi-Cloud Service Broker for Green Cloud Computing Environment
… in order to minimise data exchange based on a bin-packing approach. The third model creates an energy-aware composition plan by integrating the most energy efficient services, in order to fulfil user requirements. The results demonstrated a favourable performance of these models in terms of …
Page 1 of 2