A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD

Lade...
Vorschaubild
Dateien
Bachmann_2-1m16ohd67jnfs7.pdf
Bachmann_2-1m16ohd67jnfs7.pdfGröße: 4.44 MBDownloads: 219
Datum
2017
Autor:innen
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Masterarbeit/Diplomarbeit
Publikationsstatus
Published
Erschienen in
Zusammenfassung

In this thesis we consider a mixed-integer optimal control problem motivated by energy-efficient building operations. The aim is to choose suitable insulation materials for outer walls from a set of integer values and determine an underfloor heating strategy to maintain a desired temperature in a room while keeping the costs reasonably low. Mathematically, this translates into a mixed-integer optimal control problem that combines two major fields, mixed-integer programming (for which we will present the branch-and-bound algorithm) and optimal control (which we will speed-up by a reduced-order model approach). The branch-and-bound algorithm performs a tree-search by iteratively solving relaxed problems (without integrality constraint, i.e. restricted linear-quadratic optimal control problems) for various lower and upper bounds on the boundary control. Consequently, many state and adjoint equations have to be solved which is time-consuming as their finite element discretizations lead to large degrees of freedom. Therefore, we apply a model reduction technique using proper orthogonal decomposition providing a significant speed-up alongside small errors as few specific ansatz functions can capture the main characteristics of the system dynamics. We discuss strategies for branching decisions and node selection in the branch-and-bound algorithm and present numerical experiments for different scenarios.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
mixed-integer optimal control, branch-and-bound, mixed-integer programming, optimal control, proper orthogonal decomposition
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690BACHMANN, Freya, 2017. A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD [Master thesis]. Konstanz: Universität Konstanz
BibTex
@mastersthesis{Bachmann2017Branc-43934,
  year={2017},
  title={A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD},
  address={Konstanz},
  school={Universität Konstanz},
  author={Bachmann, Freya}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43934">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Bachmann, Freya</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">In this thesis we consider a mixed-integer optimal control problem motivated by energy-efficient building operations. The aim is to choose suitable insulation materials for outer walls from a set of integer values and determine an underfloor heating strategy to maintain a desired temperature in a room while keeping the costs reasonably low. Mathematically, this translates into a mixed-integer optimal control problem that combines two major fields, mixed-integer programming (for which we will present the branch-and-bound algorithm) and optimal control (which we will speed-up by a reduced-order model approach). The branch-and-bound algorithm performs a tree-search by iteratively solving relaxed problems (without integrality constraint, i.e. restricted linear-quadratic optimal control problems) for various lower and upper bounds on the boundary control. Consequently, many state and adjoint equations have to be solved which is time-consuming as their finite element discretizations lead to large degrees of freedom. Therefore, we apply a model reduction technique using proper orthogonal decomposition providing a significant speed-up alongside small errors as few specific ansatz functions can capture the main characteristics of the system dynamics. We discuss strategies for branching decisions and node selection in the branch-and-bound algorithm and present numerical experiments for different scenarios.</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43934"/>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-11-21T10:12:38Z</dc:date>
    <dc:contributor>Bachmann, Freya</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:issued>2017</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-11-21T10:12:38Z</dcterms:available>
    <dcterms:title>A Branch-and-Bound Approach to Mixed-Integer Optimal Control Using POD</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/43934/3/Bachmann_2-1m16ohd67jnfs7.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/43934/3/Bachmann_2-1m16ohd67jnfs7.pdf"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Hochschulschriftenvermerk
Konstanz, Universität Konstanz, Masterarbeit/Diplomarbeit, 2017
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Begutachtet
Diese Publikation teilen