Sökning: "Branch-and-bound method"

Visar resultat 1 - 5 av 7 uppsatser innehållade orden Branch-and-bound method.

1. 1. Predictive Energy Management of Long-Haul Hybrid Trucks : Using Quadratic Programming and Branch-and-Bound

   Master-uppsats, Linköpings universitet/Fordonssystem

   Författare :Erik Jonsson Holm; [2021]
   Nyckelord :Predictive energy management; quadratic programming; branch-and-bound; mixed-integer quadratic programming; energy optimization; look-ahead control; model predictive control; receding horizon control; optimal control; convex optimization; heavy-duty vehicle; long-haul truck; hybrid electric vehicle;

   Sammanfattning : This thesis presents a predictive energy management controller for long-haul hybrid trucks. In a receding horizon control framework, the vehicle speed reference, battery energy reference, and engine on/off decision are optimized over a prediction horizon. LÄS MER

3. 2. Construction of monotone smoothing splines using a branch and bound method

   Master-uppsats, Lunds universitet/Matematik LTH

   Författare :Malte Larsson; [2020]
   Nyckelord :Monotone smoothing splines; optimization; Karush-Kuhn-Tucker conditions; curve fitting; Mathematics and Statistics;

   Sammanfattning : The purpose of this report is to investigate a branch and bound algorithm designed to construct monotone smoothing splines. The splines are defined as the solution of a minimization problem, where one wants to find a curve with non-negative derivative everywhere, that fits a data set consisting of points in the plane, while also being sufficiently smooth. LÄS MER

4. 3. Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach

   Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

   Författare :Pauline Aldenvik; Mirjam Schierscher; [2015-10-06]
   Nyckelord :Branch-and-bound method; subgradient method; Lagrangian dual; recovery of primal solutions; ergodic sequence; mixed binary linear programming; set covering; facility location;

   Sammanfattning : The main objective of this thesis is to implement and evaluate a Lagrangian heuristic and a branch-and-bound algorithm for solving a class of mathematical optimization problems called mixed binary linear programs. The tests are performed on two different types of mixed binary linear programs: the set covering problem and the (uncapacitated as well as capacitated) facility location problem. LÄS MER

5. 4. Using ADMM for Hybrid System MPC

   Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för reglerteknik

   Författare :Mattias Fält; Lucas Jimbergsson; [2015]
   Nyckelord :Technology and Engineering;

   Sammanfattning : Model Predictive control (MPC) has been studied extensively because of its ability to handle constraints and its great properties in terms of stability and performance [Mayne et al., 2000]. We have in this thesis focused on MPC of Hybrid Systems, i.e. LÄS MER

7. 5. Ekonomisk optimering av energiproduktion - Analys av kostnadsbesparing

   Magister-uppsats, Lunds universitet/Institutionen för energivetenskaper

   Författare :Johan Andersson; [2013]
   Nyckelord :economic optimization; energiproduktion; Technology and Engineering;

   Sammanfattning : This thesis deals with the subject of economic optimization of energy production. An initial theoretical part present the various input data required for an optimization. The most basic inputs are the forecasts of district heating load, forecast of electricity price and cost functions. LÄS MER