Project Title
Dynamic meta-heuristic optimization

Project (Grand) No
TUBITAK (214M240)

Project Members
Adil Baykasoglu
Fehmi Burcin Ozsoydan

Project Summary

Generally in optimization problems, the values of all parameters are assumed to be exactly known beforehand and remain stationary throughout the optimization process. This might be valid for static environments; however, for most of the real life cases, those parameters as well as decision variables or constraints might change depending on the state or time. For example, through the ongoing optimization process, new arrivals or cancellations of decision variables (arrivals or cancellations of new jobs), revealing or cancellation of constraints or similarly the changes occurring on the system parameters are frequently encountered cases of real life manufacturing systems. For such cases, the aim is tracking of the moving optima rather than obtaining the optimum as in traditional static optimization problems. Such problems involving at least one of those mentioned features are called dynamic optimization problems in the literature.  

Because dynamic optimization is still a developing research area and it is closer to real life cases as well as it is open for further developments, it has attracted a notable attention from researchers. However, in the current circumstance, it can be said that it's still at the theoretical stage and the reported studies focus on test problems provided within the scope of operations research literature. Those studies commonly include unconstrained problems where only continuous variables and changing parameters are handled as in moving peaks problem and time dependent function optimization problems. However, most of the real life problems can be represented by dynamic optimization problems where structural changes exist such as  arrivals/cancellations of new decision variables or constraints including the changes in the domain set where the problem is defined. The significance of dynamic optimization for manufacturing systems has become a seriously studied research field and a notable increase in the number of the papers published on this field is observed particularly over the past decade. However, as a conflict, only few reported works are available yet with practical scope from diverse fields. As a result, this shows that practical studies in this field which will be introduced to the literature in the near feature, are demanded.

In accordance with these thoughts, meta-heuristic based dynamic optimization techniques, supported by representative problems which are thought to have real life reflections, are aimed to be developed within the scope of the project. Distinctly from the existing literature, these techniques will be provided to perform under both structural and parametric changes. In this regard, greedy randomized adaptive search procedure (GRASP) as a constructive technique is selected as the base methods. Our research has demonstrated that a constructive based approach might provide crucial advantages and they might be successful on dynamic optimization problems as well.

Papers produced from the project

Note: Project is completed...