Essays about: "Branch-and-bound method"

Showing result 1 - 5 of 6 essays containing the words Branch-and-bound method.

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

   University essay from Linköpings universitet/Fordonssystem

   Author : Erik Jonsson Holm; [2021]
   Keywords : 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;

   Abstract : 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. READ MORE

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

   University essay from Lunds universitet/Matematik LTH

   Author : Malte Larsson; [2020]
   Keywords : Monotone smoothing splines; optimization; Karush-Kuhn-Tucker conditions; curve fitting; Mathematics and Statistics;

   Abstract : 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. READ MORE

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

   University essay from Göteborgs universitet/Institutionen för matematiska vetenskaper

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

   Abstract : 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. READ MORE

5. 4. Using ADMM for Hybrid System MPC

   University essay from Lunds universitet/Institutionen för reglerteknik

   Author : Mattias Fält; Lucas Jimbergsson; [2015]
   Keywords : Technology and Engineering;

   Abstract : 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. READ MORE

6. 5. Parallel algorithms of timetable generation

   University essay from Blekinge Tekniska Högskola/Sektionen för datavetenskap och kommunikation

   Author : Łukasz Antkowiak; [2013]
   Keywords : school timetable; branch and bound simulated annealing; parallel algorithms;

   Abstract : Context: Most of the problem of generating timetable for a school belongs to the class of NP-hard problems. Complexity and practical value makes this kind of problem interesting for parallel computing. Objectives: This paper focuses on Class-Teacher problem with weighted time slots and proofs that it is NP-complete problem. READ MORE