Comparison of a Deterministic and a Stochastic Approach for a Bi-Objective Constrained Optimization Problem

Publikationen: Thesis / Studienabschlussarbeiten und HabilitationsschriftenMasterarbeit

Standard

Comparison of a Deterministic and a Stochastic Approach for a Bi-Objective Constrained Optimization Problem. / Grablowitz, Lukas.
2018.

Publikationen: Thesis / Studienabschlussarbeiten und HabilitationsschriftenMasterarbeit

Bibtex - Download

@mastersthesis{75dc4583b2b540bc8bc7f123f90a7ef5,
title = "Comparison of a Deterministic and a Stochastic Approach for a Bi-Objective Constrained Optimization Problem",
abstract = "In this master thesis two algorithms for generating a production schedule at a steel producer named Voestalpine Stahl Donawitz GmbH are compared, that could be used as a basis for a decision support system. Three aspects are addressed: the quality of the solution, the computing time and the robustness of the production schedules created. The problem is characterized by a hybrid flexible flow shop, with three constraints, two objective functions to be minimized and stochastic processing times. For the optimization, a deterministic heuristic of Dipak Laha and Subhash Sarin as well as a non deterministic metaheuristic of Dervis Karaboga and Bahriye Basturk, which simulates the behavior of bees during foraging, are used. The aim of the thesis is to find out which of these two approaches is more suitable for solving the underlying problem. In the first part of the thesis the problem is analyzed, mathematically abstracted and defined accordingly to the classification of Vignier. In the second part, the structures of the used algorithms and their modifications are explained in order to solve the present bi-criteria optimization problem with constraints and stochastic data. In the third and last part the concrete implementation of the algorithms in the programming language Java is described and the obtained results are presented and analyzed. The algorithms are tested with actual production data and the two algorithms are compared with respect to the solution quality, the computing time and the robustness of the production schedules created for different problem sizes. The results show that for the stated problem and the given constraints the heuristic of Dipak Laha and Subhash Sarin is not suitable because of its constructive character and the metaheuristic approach of Dervis Karaboga and Bahriye Basturk should be preferred. Finally, an outlook is given on further application possibilities and improvements.",
keywords = "Optimierung mit Nebenbedingungen, Metaheuristik, Heuristik, multi kriterielle Optimierung, bikriteriel, Pareto-Optimierung, stochastische Maschinenbelegungsplanung, constrained optimization, metaheuristic, heuristic, multi objective optimization, bi-objective, Pareto-optimization, stochastic production scheduling",
author = "Lukas Grablowitz",
note = "embargoed until 06-09-2023",
year = "2018",
language = "English",
school = "Montanuniversitaet Leoben (000)",

}

RIS (suitable for import to EndNote) - Download

TY - THES

T1 - Comparison of a Deterministic and a Stochastic Approach for a Bi-Objective Constrained Optimization Problem

AU - Grablowitz, Lukas

N1 - embargoed until 06-09-2023

PY - 2018

Y1 - 2018

N2 - In this master thesis two algorithms for generating a production schedule at a steel producer named Voestalpine Stahl Donawitz GmbH are compared, that could be used as a basis for a decision support system. Three aspects are addressed: the quality of the solution, the computing time and the robustness of the production schedules created. The problem is characterized by a hybrid flexible flow shop, with three constraints, two objective functions to be minimized and stochastic processing times. For the optimization, a deterministic heuristic of Dipak Laha and Subhash Sarin as well as a non deterministic metaheuristic of Dervis Karaboga and Bahriye Basturk, which simulates the behavior of bees during foraging, are used. The aim of the thesis is to find out which of these two approaches is more suitable for solving the underlying problem. In the first part of the thesis the problem is analyzed, mathematically abstracted and defined accordingly to the classification of Vignier. In the second part, the structures of the used algorithms and their modifications are explained in order to solve the present bi-criteria optimization problem with constraints and stochastic data. In the third and last part the concrete implementation of the algorithms in the programming language Java is described and the obtained results are presented and analyzed. The algorithms are tested with actual production data and the two algorithms are compared with respect to the solution quality, the computing time and the robustness of the production schedules created for different problem sizes. The results show that for the stated problem and the given constraints the heuristic of Dipak Laha and Subhash Sarin is not suitable because of its constructive character and the metaheuristic approach of Dervis Karaboga and Bahriye Basturk should be preferred. Finally, an outlook is given on further application possibilities and improvements.

AB - In this master thesis two algorithms for generating a production schedule at a steel producer named Voestalpine Stahl Donawitz GmbH are compared, that could be used as a basis for a decision support system. Three aspects are addressed: the quality of the solution, the computing time and the robustness of the production schedules created. The problem is characterized by a hybrid flexible flow shop, with three constraints, two objective functions to be minimized and stochastic processing times. For the optimization, a deterministic heuristic of Dipak Laha and Subhash Sarin as well as a non deterministic metaheuristic of Dervis Karaboga and Bahriye Basturk, which simulates the behavior of bees during foraging, are used. The aim of the thesis is to find out which of these two approaches is more suitable for solving the underlying problem. In the first part of the thesis the problem is analyzed, mathematically abstracted and defined accordingly to the classification of Vignier. In the second part, the structures of the used algorithms and their modifications are explained in order to solve the present bi-criteria optimization problem with constraints and stochastic data. In the third and last part the concrete implementation of the algorithms in the programming language Java is described and the obtained results are presented and analyzed. The algorithms are tested with actual production data and the two algorithms are compared with respect to the solution quality, the computing time and the robustness of the production schedules created for different problem sizes. The results show that for the stated problem and the given constraints the heuristic of Dipak Laha and Subhash Sarin is not suitable because of its constructive character and the metaheuristic approach of Dervis Karaboga and Bahriye Basturk should be preferred. Finally, an outlook is given on further application possibilities and improvements.

KW - Optimierung mit Nebenbedingungen

KW - Metaheuristik

KW - Heuristik

KW - multi kriterielle Optimierung

KW - bikriteriel

KW - Pareto-Optimierung

KW - stochastische Maschinenbelegungsplanung

KW - constrained optimization

KW - metaheuristic

KW - heuristic

KW - multi objective optimization

KW - bi-objective

KW - Pareto-optimization

KW - stochastic production scheduling

M3 - Master's Thesis

ER -