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 “"Quadratic Assignment Problem"”.
-
A flexible construction and improvement heuristic for the quadratic assignment problem
… of heuristic algorithms for the popular Quadratic Assignment Problem (QAP) which finds a wide variety of applications in various fields. This discrete optimization problem, which seeks the placement of m facilities on m locations in order to minimize a quadratic interactive cost, is well …
-
A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem
This thesis is concerned with an Airline Gate Assignment problem that seeks to allocate gates to aircraft at an airport, using the objective of minimizing passenger walking distances. The problem is modeled as a variant of the quadratic assignment problem with set packing constraints. The quadratic …
-
A water flow algorithm for optimization problems
… flow algorithm (WFA), for solving optimization problems has been proposed. The algorithm is designed by simulating the hydrological cycle in meteorology and the erosion phenomenon in nature. Basic operators of this algorithm are based on the raindrop distribution simulation, the property of …
-
GPU accelerated Hungarian algorithm for traveling salesman problem
… we present a model of the Traveling Salesman Problem (TSP) cast in a quadratic assignment problem framework with linearized objective function and constraints. This is referred to as Reformulation Linearization Technique at Level 2 (or RLT2). We apply dual ascent procedure for obtaining lower …
-
The tabu ant colony optimizer and its application in an energy market
… tested, and applied to a contemporary problem. The TabuACO uses both attractive and repulsive pheromones to speed convergence to a solution. The dual pheromone TabuACO is benchmarked against several other solvers using the traveling salesman problem (TSP), the quadratic assignment …
-
Cross-Docking: A Proven LTL Technique to Help Suppliers Minimize Products' Unit Costs Delivered to the Final Customers
… model, and the second one is a binary-quadratic assignment problem (QAP) model. QAP is an NP-hard problem, and therefore, besides a complement enumeration method using ILOG CPLEX software, the Tabu search (TS) algorithm with four diversification methods is employed to solve larger size …
-
A multi-attribute layout design problem
… or the qualitative attribute of the layout problem. These procedures are based on maximizing or minimizing one objective function. Some of the procedures that address the multi-attribute nature of the plant layout problem are based on assigning weights to objective functions and then solving …
-
Theoretical and computational advances in finite-size facility placement and assignment problems
… costs. Main difficulty of this optimization problem lies in its continuous non-convex/non-concave feasible space, which makes it tough to escape local optimality. Through this research, novel approaches will be proposed which can be used to distill this continuous space into a finite set of …
-
Linear and nonlinear semidefinite relaxations of some NP-hard problems
… and obtain approximate solutions for NP-hard problems. This thesis introduces and studies several novel linear and nonlinear semidefinite relaxation models for some NP-hard problems. We first study the semidefinite relaxation of Quadratic Assignment Problem (QAP) based on matrix splitting. We …
-
Analysis and Improvement of Cross-dock Operations in Less-than-Truckload Freight Transportation Industry
… Specifically, the following two decision problems are investigated: (1) assigning trailers to dock doors to minimize the total time required to transfer shipments from inbound trailers to destination trailers and (2) sequencing unloading and loading of freight to minimize the time required …
-
Towards GPU-accelerated discrete optimization
… crucial role in solving complex decision-making problems across a wide range of applications in operations research. These problems often involve selecting an optimal subset or sequence of decisions from a finite set, a task that becomes exponentially harder as the problem size grows. While …
-
Unapređenje konstruktivnih heuristika za probleme kombinatorne optimizacije u operacionom menadžmentu
… disertaciji su konstruktivne heuristike za probleme kombinatorne optimizacije u operacionom menadžmentu koji pripadaju klasi složenosti NP. Predstavljen je novi generalizovani konstruktivni algoritam koji omogućava da se raznovrsne heuristike formiraju izborom njegovih argumenata. Takođe je …