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 7 of 7 for “"Bi-objective optimization"”.
-
Truckload Shipment Planning and Procurement
… In all of the studies, we utilize optimization techniques to model and solve the problems. Each study is inspired from the real world and much of the data used in the experiments is real data or representative of real data. </p> <p>The first topic is about the freight consolidation …
-
Risk-Aware Planning for Sensor Data Collection
… uncertainty as additional source of risk, using bi-objective optimization to generate sets of alternative plans. We demonstrate the capability of our algorithms on randomly generated problem instances, showing an improvement over traditional multi-agent planning methods as high as 500% on very …
-
A hybrid crow search-based method for solving the closed loop supply chain network design
This thesis develops a hybrid optimization framework for large-scale facility location and Closed-Loop Supply Chain Network Design (CLSCND). The main contribution is a decomposition-based method that combines a Binary Crow Search Algorithm (BinCSA) with Mixed-Integer Linear Programming (MILP) exact …
-
Percolation in Two-Dimensional Grain Boundary Structures and Polycrystal Property Closures
… corrosion resistance. The second investigates optimization techniques in order to find the space of values that properties of a material can take, from consideration of the microstructure. In part I, the applicability of standard lattice percolation models to a random 2-D grain structure is …
-
Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity
… array of applications. Given its broad applicability and theoretical richness, the makespan minimization problem has garnered extensive attention from the operations research and theoretical computer science communities. Despite numerous advancements, significant theoretical gaps and practical …
-
Shortest Path Problems: Domain Restriction, Anytime Planning, and Multi-objective Optimization
… the viscosity solution to a static Hamilton-Jacobi PDE. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations, so we restrict the computations to a neighborhood of the characteristic. We explain how heuristic under/over-estimate functions can be used to obtain a {\em …