Computational Strategies for Model Predictive Control on Switching Max-plus Linear Systems

Master thesis (2019)

Authors

T.D. Vos Electrical Engineering, Mathematics and Computer Science

Contributors

A.J.J. van den Boom Team Bart De Schutter - Mechanical, Maritime and Materials Engineering (supervisor 1)
J.W. van der Woude Mathematical Physics - EEMCS (supervisor 1)
A. Gupta Team Bart De Schutter - Mechanical, Maritime and Materials Engineering (supervisor 1)
K.I. Aardal Discrete Mathematics and Optimization - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2019 Daniël Vos
Max-plus algebra Scheduling Integer programming Simulated annealing Model Predictive Control Distributed Optimization Tabu search Model based partitioning Discrete event simulation
More Info
expand_more

Published Date

29-11-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

A switching max-plus linear model is a framework to describe the discrete dynamics of the timing of events. To influence these systems one can choose the routes of jobs and the orderings of operations as input for the system. In this thesis the techniques of model predictive control are used to find good input values. The problem of finding the optimal input is however NP-hard, which means there is no guarantee to find the optimal in a reasonable amount of time. This is an issue for model predictive control on real applications of the switching max-plus model. In applications, on-line performance is used where there is limited time to compute the input values for control.\ This thesis takes a look into methods to reduce the computational complexity of the MPC-SMPL problem. Alternative formulations such as reparameterization, model based-partitioning and the cutting plane method are developed and tested for the MPC-SMPL problem. To solve the MPC-SMPL problem 3 heuristics are designed and implemented for simulation. The heuristics are partition-based optimization, tabu search and simulated annealing. The goal is to find a strategy that obtains the best solution to the problem in a limited amount of time.