Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging

Abstract

Hiermit erkläre ich, dass ich diese Arbeit selbständig verfasst habe, dass ich die verwendeten Quellen und Hilfsmittel vollständig angegeben habe und dass ich die Stellen der Arbeit -einschließlich Tabellen, Karten und Abbildungen -, die anderen Werken oder dem Internet im Wortlaut oder dem Sinn nach entnommen sind, auf jeden Fall unter Angabe der Quelle als Entlehnung kenntlich gemacht habe. Wien, 4. April 2019Benedikt Klocker iii I want to thank all for funding my research and the opportunity of working on this topic. Furthermore, I would like to show my gratitude Günther Raidl, my supervisor, for his ongoing support and advice and his constructive feedback. I would also like to expand my gratitude to all my colleagues who always had an open ear for my questions and helped me with good advice. Furthermore, I want to thank my parents for giving me the opportunity of studying and my friends, my family and my girlfriend for continuously supporting me whenever I needed it.

A Teaching-Learning-Based Optimization Algorithm for the Weighted Set-Covering Problem

“…The Set-Covering Problem (SCP) is a combinatorial problem included in the list by Karp of 21 NP-complete problems [1]. The SCP has many applications, such as cutting stock problems, balancing production and airline crew scheduling [2,3].…”