Essays about: "combinatorial modelling"

Showing result 1 - 5 of 9 essays containing the words combinatorial modelling.

  1. 1. Contributions to a New CBLS Backend for MiniZinc

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Maarten Lucas Flippo; [2022]
    Keywords : ;

    Abstract : MiniZinc is a language which enables the modelling of combinatorial optimisation and satisfaction problems independently from any particular problem solver and its technology. One technology for solving combinatorial optimisation and satisfaction problems is constraint-based local search (CBLS). READ MORE

  2. 2. Generating a CBLS Invariant Structure from a FlatZinc Model

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Max Perea Düring; [2021]
    Keywords : combinatorial optimisation MiniZinc CBLS constraint model local search solver invariant structure;

    Abstract : Constraint-Based Local Search (CBLS) is a technology used to solve computationally hard optimisation problems. A model written in a solver-independent modelling language needs to be processed before it can be solved by a CBLS solver. In this processing step, it is necessary to identify invariants and create an invariant structure. READ MORE

  3. 3. A Linter for Static Analysis of MiniZinc Models

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Erik Rimskog; [2021]
    Keywords : linter MiniZinc combinatorial optimisation static analysis models;

    Abstract : MiniZinc is a modelling language for constraint satisfaction and optimisation problems. It can be used to solve difficult problems by declaratively modelling them and giving them to a generic solver. A linter, a tool for static analysis, is implemented for MiniZinc to provide analysis for improving models. READ MORE

  4. 4. A pragmatic approach to improve the efficiency of the waste management system in Stockholm through the use of Big Data, Heuristics and open source VRP solvers : A real life waste collection problem;Stockholm’s waste collection system and inherent vehicle routing problem, VRP

    University essay from KTH/Hållbar utveckling, miljövetenskap och teknik

    Author : Rafael Salcedo Villanueva; [2020]
    Keywords : ;

    Abstract : In this thesis, we will address a real life waste collection problem; Stockholm’s waste collection system and inherent vehicle routing problem, VRP. To do this we will first delve into some mathematical theory of Combinatorial Optimization and Heuristics to understand the fundamentals of the problem. READ MORE

  5. 5. Modelling Diversity of Solutions

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Linnea Ingmar; [2019]
    Keywords : ;

    Abstract : For many combinatorial problems, finding a single solution is not enough. This is clearly the case for multi-objective optimisation problems, as they have no single “best solution” and, thus, it is useful to find a representation of the non-dominated solutions (the Pareto frontier). READ MORE