Sökning: "Lagrangian Heuristic"

Visar resultat 1 - 5 av 7 uppsatser innehållade orden Lagrangian Heuristic.

  1. 1. Lagrangian Bounding and Heuristics for Bi-Objective Discrete Optimisation

    Kandidat-uppsats, Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Ida Åkerholm; [2022]
    Nyckelord :Lagrangian relaxation; bi-objective optimisation; Pareto frontier; heuristics; discrete optimisation;

    Sammanfattning : For larger instances of multi-objective optimisation problems, the exact Pareto frontier can be both difficult and time-consuming to calculate. There is a wide range of methods to find feasible solutions to such problems, but techniques for finding good optimistic bounds to compare the feasible solutions with are missing. LÄS MER

  3. 2. Location Planning Considering Delivery Time and Service Level Constraints A Heuristic Solution Approach to a Linear Optimization Problem from an Automotive Spare Parts Network

    Master-uppsats, Göteborgs universitet/Graduate School

    Författare :Alexander Zienau; [2018-07-02]
    Nyckelord :network design; location problem; delivery time; outliers; linear optimization; heuristic; Lagrangian relaxation; knapsack problem; spare parts network; automotive industry;

    Sammanfattning : This thesis addresses the challenge to model a warehouse location problem under consideration of delivery time and service level constraints. For identification of appropriate modelling techniques, literature research is conducted to identify relevant models using similar approaches. LÄS MER

  4. 3. Finding the Densest Common Subgraph with Linear Programming

    Kandidat-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Alexander Reinthal; Anton T örnqvist; Arvid Andersson; Erik Norlander; Philip Stålhammar; Sebastian Norlin; [2016-11-15]
    Nyckelord :Linear Programming; Graph theory; Dense Subgraphs; Densest Common Subgraph;

    Sammanfattning : This thesis studies the concept of dense subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. LÄS MER

  5. 4. 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

  7. 5. Tidtabellsläggning för extrainsatta godståg : En approximationsalgoritm på räls

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :KARL JOHAN WESTRIN; [2014]
    Nyckelord :;

    Sammanfattning : I detta arbete prövas olika metoder för tidtabellsläggning av extratåg längs redan trafikerat enkel- eller dubbelspår. Förutsättningarna är att befintlig tidtabell inte skall behöva läggas om och att extratåget (om möjligt) inte skall behöva stanna längs vägen för bästa möjliga energi effektivitet. LÄS MER