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 3961 for “"Optimization problem"”.
-
A Disassembly Optimization Problem
… to product disposal. One way to deal with this problem is to disassemble an obsolete product and utilize some of its components/subassemblies in the manufacturing of new products. This seems to be a promising solution because products now-a-days are made in accordance with the highest quality …
-
An Optimization Problem of Internet Routing
… such that solving the all pairs shortest path problem using these weights reproduces the routing policies. We show that determining if our generated routing policies are realizable is NP-Hard. Fortunately, using traffic data from three real-world networks, we are able to find realizable routing …
-
Optimization Problem In Single Period Markets
There had been a number of researches that investigated on the security market without transaction costs. The focus of this research is in the area that when the security market with transaction costs is fair and in such fair market how one chooses a suitable portfolio to optimize the financial …
-
Optimization Problem for Klein-Gordon Equation
… of J and optimal parameters for these problems. Unlike the sine-Gordon equation, which has a bounded nonlinear term, Klein-Gordon equation requires stronger assumptions on the initial data.
-
QAOA applied to the portfolio optimization problem
… there is one called QAOA (quantum approximate optimization algorithm). As the name suggests, this is a quantum algorithm that approximates the solution of optimization problems. The objective of this work was to apply this algorithm to solve an optimization problem in the finance area known as …
-
The dynamic programming approach to the multicriterion optimization problem.
Decision makers are often confronted with problems for which there exist several distinct measures of success. Such problems can often be expressed in terms of linear or nonlinear programming models with several "criterion" functions instead of single objective functions. A variety of techniques …
-
Walsh analysis, epistasis, and optimization problem difficulty for evolutionary algorithms
… bit strings of length L. Epistasis is related to problem difficulty for evolutionary algorithms. Walsh analysis can be used to quantify epistasis. In this dissertation Walsh analysis is developed in detail starting with the definitions for the Walsh transform. The epistasis of a polynomial is …
-
A comparative study of metaheuristic algorithms for the fertilizer optimization problem
Hard combinatorial optimization (CO) problems pose challenges to traditional algorithmic solutions. The search space usually contains a large number of local optimal points and the computational cost to reach a global optimum may be too high for practical use. In this work, we conduct a comparative …
-
A Polynomial Algorithm for a NP-hard to solve Optimization Problem
… In adressing the optimal allocation problem in a slightly more general setting, thereby still allowing for a large number of different asset classes, an efficient algorithm is developed for finding the exact solution in the case of specially distributed losses. Applying this algorithm …
-
Solving Polynomial Optimization Problem and Noncooperative Games by a Homotopy Algorithm
The problem of finding all the solutions of a system of m polynomials in m variables is studied in this paper. Unlike earlier studies (6, 8, 18), optimization and game problems are the focus. This paper checks solutions, compares function evaluations whenever possible, and presents absolute error …
-
Ein Zugang zum Sparse Optimization Problem durch eine Exakte Reformulierung und Penalisierung
The Sparse Optimization Problem (SPO) is a prominent tool to describe classification and feature selection problems, both of which are central to the field of data science and machine learning. The SPO is notoriously difficult to solve, due to its combinatorial nature and its non-continuity as well …
-
Pricing Financial Option as a Multi-Objective Optimization Problem Using Firefly Algorithms
… modelled the option pricing as a multi-objective optimization problem, where I introduced the pay-off and probability of achieving that pay-off as the main optimization objectives. Then, I proposed to use a latest nature-inspired algorithm that uses the bioluminescence of Fireflies to simulate the …
-
Evolving Heterogeneous And Subcultured Social Networks For Optimization Problem Solving In Cultural Algorithms
… fabric over which information used in agent problem solving is passed. The knowledge sources in the Belief Space compete with each other in order to influence the decision making of agents in the Population Space. Likewise, the problem solving experiences of agents in the Population Space are …
-
Algorithms for a constrained optimization problem with applications in statistics and optimum design
Abstract available: p.3-5
-
Test Generation from an Extended Finite State Machine as a Multiobjective Optimization Problem
… (EFSM) can be considered as a multiobjective optimization problem. When a test engineer generates tests from an EFSM he/she typically considers several objectives. We propose a search-based approach to generate test suites from an EFSM, accounting for multiple (potentially conflicting) such …
-
PREDICTING THE THERMAL PERFORMANCE FOR THE MULTI-OBJECTIVE VEHICLE UNDERHOOD PACKING OPTIMIZATION PROBLEM
… underhood forms a 3-Dimensional packaging problem. In the past, a study on the automobile underhood packaging problem was conducted and a multi objective optimization routine with three objectives namely, minimizing center of gravity height, maximizing vehicle maintainability and maximizing …
-
Recovering software layers from object oriented systems : a formalization as an optimization problem
… enabled us to formulate the layering recovery problem as an optimization problem that is a specific case of the quadratic assignment problem (QAP). We solved this problem using search-based metaheuristics (i.e. hill climbing and tabu search). We evaluated the proposed approach through …
-
Error Analysis for Geometric Finite Element Discretizations of a Cosserat Rod Optimization Problem
In summary, this thesis focuses on developing an a priori theory for geometric finite element discretizations of a Cosserat rod model, which is derived from incompatible elasticity. This theory will be supported by corresponding numerical experiments to validate the convergence behavior of the …
-
Bounds on Constraint Weight Parameters of Hopfield Networks for Stability of Optimization Problem Solutions
… of solutions of constraint satisfaction and optimization problems mapped to Hopfield networks is investigated. A theoretical development relating constraint weight parameter values to solution stability is presented. The dependency of solution stability on constraint weight parameter values …
Page 1 of 199