Optimization phd structural thesis

Optimization phd structural thesis

Aug 11,  · Master students in optimization are offered very interesting theses within a broad range of applications and techniques. Several theses have industrial applications in e.g. oil and gas, telecommunications or fisheries. The projects typically involve modelling, analysis, development of new solution methods, implementation and experimentation Optimization Phd Structural Thesis, Cute Lined Paper For Students, Internet Homework, Examples Of Language Barrier Essay. View All Services. Top Writers. PAPER FORMAT $ + It is crime-free and secure cyberspace. Our service uses the latest security gains to Optimization Phd Structural Thesis protect your essay details, personal data, and financial operations from any internal and external dangers. A user-friendly privacy policy ensures your confidentiality is preserved while a refund policy guarantees % satisfaction with the delivered essay

[PDF] Optimization Of Structural Topology Shape And Materials Download Online – eBook Sumo PDF

In this project, we want to investigate if deep learning methods can contribute in combinatorial optimization problems in particular if it can find any pattern among good solutions for a pickup and delivery problem and if so, then take advantage of it to lead the search toward even better solutions.

Background: This project challenges your skill in algorithm design and your programming skill! INF is highly recommended. Develop a Machine Learning based Hyper-heuristic algorithm to solve a pickup and delivery problem. A hyper-heuristic is a heuristics that choose heuristics automatically.

Hyper-heuristic seeks to automate the process of selecting, combining, generating or adapting several simpler heuristics to efficiently solve computational search problems [Handbook of Metaheuristics]. There might be multiple heuristics optimization phd structural thesis solving a problem. Heuristics have their own strength and weakness. In optimization phd structural thesis project, we want to use machine-learning techniques to learn the strength and weakness of each heuristic while we are using them in an iterative search for finding high quality solutions and then use them intelligently for the rest of the search.

Once a new information is gathered during the search the hyper-heuristic algorithm automatically adjusts the heuristics. This project addresses central challenges in climate and energy transition - How do we achieve more efficient transport systems to reduce emissions and improve land use?

The goal of a sustainable logistics system is to improve profitability and reduce environmental impact for long-term performance. A sustainable logistic need to consider economic, environmental, and social aspects that are essential for a logistics system. In addition, the future state of transportation systems in smart cities requires taking advantage of multimodal transportation that includes autonomous electric cars, boats, trains, optimization phd structural thesis, Robots, and drones.

In this project, we aim at developing optimization models and artificial intelligence AI solutions for the problem of integrated multimodal transport planning, taking into account social, environmental, geographical and economical constraints.

Transport planning is a complex optimization phd structural thesis optimization problem and social, environmental and economic factors increases the complexity.

This cross-disciplinary project is well positioned to solve this complex problem by combining expertise in optimization, AI, Logistics, and social science within urban development, governance and public perceptions, optimization phd structural thesis. This project can be divided into three different master projects. For details please see the project description! Advisor: Jan Rückmann.

Maritime transportation optimization phd structural thesis the obvious choice for heavy industrial activities where large volumes are transported over long distances. Norway is currently among the world's top 10 shipping nations in terms of tonnage, optimization phd structural thesis, the number of vessels and the value of the fleet. Operational efficiency of maritime transportation can have a huge effect on consumers by reducing final product costs.

In this project, we address the ship routing and scheduling problem, which is one of the main problems in maritime transportation. In this problem, a shipping company has a set of contracted cargoes that it is committed to carry and there are also some spot cargoes available in the market.

Each cargo in the given planning period must be picked up at its port of optimization phd structural thesis, transported and then delivered to its corresponding discharging port.

There are time windows given, within which the loading of the cargoes must start, and there may also exist time windows for discharging. The shipping company can decide to serve some of the spot cargoes if they find it profitable.

This is a NP-hard problem and we are going to develop a powerful heuristic to solve the real size instances of the problem! Among various problems considered in supply chain logistics, pickup and delivery problem with time windows is one of the most practical one that has received a lot of attentions in the operation research community.

Here we consider a shipping company, which operates a heterogeneous fleet of vehicles. At a given point in time we consider a static and deterministic planning problem, consisting of determining how the fleet of vehicles should service a set of given requests. The vehicles may be different in capacity, speed and cost, and compatibility for carrying certain request. If a request is assigned to a vehicle, the vehicle must pickup the request in its corresponding origin point pickup node and later deliver the request in its destination point delivery node, optimization phd structural thesis.

All pickups and deliveries operations must be performed within a time interval that is specific to that operation for a given request. Pickup and delivery problem has many applications such as in postal service and food industry. In this project, we are going to solve a very practical application of this problem which has more realistic assumptions than the original described version. Background: This project challenges your problem solving and programming skill as well as your skill in algorithm design!

In this project, we address the multi-productmaritime inventory routing problem where each product can be produced and consumed in any number of ports. During the planning optimization phd structural thesis the level of each inventory of each product at each port must lie within fixed lower and upper limits at all times. There are lower and upper limits on the loaded and unloaded quantities. These operations generate fixed and variable costs.

The multi-product maritime inventory routing problem consists of designing routes and schedules for the fleet in order to minimize the transportation and port costs, and to determine the quantities handled at each port call without exceeding the storage limits.

We intend to mathematically formulate the problem and possibly find the upper and lower bounds. Since it is a NP-hard problem, to solve the real size instances of the problem, we are going to develop a powerful heuristic! Background: This project challenges your skill in Mathematical formulation and your programming skill!

In a covering location problem, we seek location of a number of facilities on a network in such a way that the covered population is maximized. A population is covered if at least one facility is located within a predefined distance of it. This predefined distance is often called coverage radius. The choice of this distance has a vital role and affects the optimal solution of the problem to a great extent. Covering location problem is of paramount importance in practice to locate many service facilities such as schools, parks, optimization phd structural thesis, hospitals and emergency units.

In some practical cases, optimization phd structural thesis, the population is moving during the planning horizon. In this project, optimization phd structural thesis, we are going to develop a heuristic for the problem assuming the moving population.

Adaptive large neighbourhood search is a popular and widely used algorithm in the literature in solving combinatorial problems and in particular routing problems.

In this project, we are going to investigate the role of randomized components in this algorithm and provide deterministic alternatives that work as good as the original one, or even better!

Background: This project challenges your skill in algorithm design and your analytical and logical thinking! A location-routing problem may be defined as an extension to a multi depot vehicle routing problem in which there is a need to determine the optimal number and location of depots simultaneously with finding distribution routes.

LRP is an NP-hard problem, as it encompasses two NP-hard problems facility location and vehicle routing. Moreover, it is generally accepted that solving the optimization phd structural thesis sub-problems separately often leads optimization phd structural thesis sub-optimal solutions.

LRP has many real-life applications such as in food and drink distribution, postal service, blood bank location, newspaper distribution, waste collection, and medical evacuation.

In this project, we are going to solve a practical application of this problem which has more realistic assumptions than the original described version. It is an iterative method and in every iteration it uses f x and f' x. Halley's method uses f xf' x and f'' x optimization phd structural thesis every iteration.

In a textbook on iterative methods the author claims that Halley's method is the optimization phd structural thesis rediscovered method. The purpose of this project is to explore the different ways to derive the method and follow the historical thread and to explore the algorithmic consequences of the different derivations of Halley's method.

For more information on the project contact the supervisor professor Trond Steihaug. When we say that one algorithm is more efficient than another algorithm in optimization, we often compare number of arithmetic operations, optimization phd structural thesis.

However, the amount of memory and memory access is often as important. In this project optimization phd structural thesis will test different data structures with different memory access. The project requires extensive programming.

This topic covers the application of several solution methods for nonlinear optimization phd structural thesis problems. Nonlinear Optimization or Programming models can be used for the modelling, description and solution of real-life application from a huge variety of areas; among them are finance, economics, production planning, trajectory calculation and others.

In dependence on the chosen application and the recommended solution method the corresponding master thesis project might include modelling and numerical solution aspects. The use of mathematical optimization methods in finance is common-place and optimization phd structural thesis continuously developing vivid area of research. These methods are used for many different tasks: for pricing financial products, estimating risks, determining hedging strategies, and many others.

The goal of this project is to study how optimization techniques - such as linear, quadratic, and nonlinear programming, robust optimization, dynamic programming, integer programming, and others - can be used in the framework of mathematical finance.

In this project the candidate will study recent models from mathematical finance which are using mathematical optimization techniques.

Furthermore, corresponding solution methods will then be applied numerically to some particularly chosen models. The latter part refers to efficient implementation of solution techniques and calculating numerical solutions. Investors in charge optimization phd structural thesis selecting the assets to constitute a portfolio, will typically use the expected return as a measure of the expected value, and the variance as a measure of the risk.

To keep operational costs down, the investors may impose certain constraints on the portfolio selection. For instance, optimization phd structural thesis, they may require that the volume of any selected asset must be at least a given fraction of the total portfolio.

In this thesis, the candidate will study mathematical models and efficient solution techniques for such problems. In many industrial applications of network flow problems, such as oil refining and pipeline transportation of natural gas, the composition of the flow is of interest. At the source nodes, flow of different compositions qualities is supplied. Flow from the sources is blended at intermediate nodes, referred to as pools, optimization phd structural thesis.

The blending operation is linear, in the sense that one flow unit containing e. Flow from the pools is blended linearly at the terminals, where bounds on the resulting quality apply. Unit purchase costs at the sources and sales revenues at the terminals are defined, and the problem is to find a flow assignment to the network, such that quality bounds are respected, and total net profit is maximized.

It has been shown that this problem, frequently referred to as the pooling problem, is strongly NP-hard, even if there is only one pool. The same is true if there is only one quality parameter e.

CO2 subject to upper bounds. In the industry, there is a request for fast solution methods, which does not seem realistic for general instances of realistic size. The focus of the current project is to find fast, optimization phd structural thesis, possibly inexact, optimization phd structural thesis, solution methods for the pooling problem.

It is also a goal to identify special instance classes that can be solved fast, and to evaluate algorithms for such instances experimentally. The successful candidate has good programming skills and some background in optimization. Advisor: Dag Haugland. This project considers how an order market might evolve over a fairly short period - say, during a day.

Considered is a stylized market for one homogenous, perfectly divisible good.

PhD Thesis Defense: Optimization and Control of Energy Storage in Smart Grid

, time: 2:00:47

There can be a number Optimization Phd Structural Thesis of reasons why you might not like your order. If we Optimization Phd Structural Thesis honestly don’t meet your expectations, we will issue a refund. You can also request a free revision, if there are only slight inconsistencies in your order/10() Abstract of Thesis Presented to the Graduate School structural optimization. In sizing optimization the goal could be to find the optimal thickness of a plate or cross-sectional area of bar in a truss-like structure. On the other hand, in a shape optimization problem strained optimization problems reliably and eciently. These techniques o↵er significant advantages over general nonlinear optimization methods. In this thesis, conceptual-stage aircraft design problems are formulated as geometric programs (GPs), which are a specific type of convex optimization problem