1. Tekrarlı Açgözlü Algoritması ile Esnek Atölye Tipi Çizelgeleme Problemi Üzerine Bir Uygulama.
- Author
-
DEMİR, Yunus
- Subjects
- *
PRODUCTION scheduling , *TURKISH literature , *MATHEMATICAL optimization , *METAHEURISTIC algorithms , *COMBINATORIAL optimization , *GREEDY algorithms , *INCUMBENCY (Public officers) , *ALGORITHMS - Abstract
Optimization is the selection of the best possible solution (min / max) under certain criteria. For the solution of optimization problems; many approaches have been developed in different classes such as exact solution methods, approximation methods, meta-heuristic techniques. However, the enormous size of real-life problems have led researchers to meta-heuristic techniques that provide acceptable solutions in a short time. In this study, an application has been made with the iterated greedy algorithm, which stands out with its simple structure. Flexible job shop scheduling problem is addressed for application. Basically, the iterative greedy algorithm starts the optimization process with a single solution. The current solution then enters the construction-destruction phase to find a better solution. The solution obtained after this stage is replaced with the incumbent solution according to the previously determined acceptance criteria. This cycle, which consists of two operators, construction and destruction, continues until a certain stopping criterion is met. In this study, a problem-specific critical path-based approach was developed in the construction-destruction phase. In addition, a novel approach based on the acceptance of solutions of decreasing quality depending on the number of iterations is proposed. The aim of this study is to contribute to the limited Turkish literature on the application of meta-heuristic algorithms in various fields. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF