Vassil Georgiev Guliashki

Dr. Vassil Georgiev Guliashki


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2015 in Cybernetics and Information Technologies
Verified
Journal Article
Open access
KGKrasimira Genova
Krasimira Genova
Leoneed KirilovLeoneed Kirilov
Leoneed Kirilov
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
Many real life scheduling problems can be formulated as Flexible Job Shop Scheduling Problems FJSSPs which simultaneously optimize several conflicting criteria. A typical feature of such problems is their high computational complexity. The purpose of this paper is to provide a review of the techniques, developed to solve multiple objective FJSSPs during the last decade. These techniques could be classified into two groups: approaches with application of mathematical models and heuristic approaches. Usually hybrid metaheuristic algorithms are proposed for large dimensional real life problems and they outlay the tendency for the future developments of efficient solution approaches for multiple objective FJSSPs.

9 July 2024
Verified
Conference Paper
Closed access
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
Galia MarinovaGalia Marinova
Galia Marinova
In this paper, optimal energy management in a grid-connected microgrid including a three-phase load of a small group of houses, a PV system, a proton exchange membrane fuel cells (PEMFC) stack, a battery energy storage system (BESS), and an energy management system (EMS) is considered. A classical proportional-integral (PI) control strategy for BESS is applied. Optimization of the operating schedules of the PEMFC stack and the BESS was performed using a MATLAB solver. In this way, the load on the PEMFC is minimized and the system's life time is extended. The presented approach is promising. Validation of the results using simulation of the microgrid operation in MATLAB (Simulink and SimPowerSystems toolboxes) is possible.

1 June 2025 in Cybernetics and Information Technologies
Verified
Journal Article
Open access
PDF file
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
Leoneed KirilovLeoneed Kirilov
Leoneed Kirilov
Galia MarinovaGalia Marinova
Galia Marinova
The Job Shop Scheduling Problem (JSSP) attracts many researchers due to its combinatorial nature and its discovery in numerous practical applications. This type of problem is characterized by high computational complexity; therefore, solving large-sized problems is not accessible with exact optimization methods. Very often, real JSSP problems can be presented as Flexible Job Shop Scheduling Problems (FJSSP). For these problems, there are single-criterion and multi-criteria mathematical models. On the other hand, the ways to solve this type of problems include exact methods and heuristic or metaheuristic algorithms. This paper the aim to review the progress of research in the field of solving FJSSP over the last 10 years, as well as to show current trends for future scientific developments in this area.

9 July 2024
Verified
Conference Paper
Closed access
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
GMGašper Mušič
Gašper Mušič
Galia MarinovaGalia Marinova
Galia Marinova
An efficient heuristic algorithm with polynomial computational complexity developed for solving the aircraft static landing problem (ALP) is proposed in this paper. The optimal solution of ALP is considered for the case where a set of aircraft is available for landing. The problem is considered under specific constraints. Three test instances with 10, 20, and 30 landing airplanes were solved. For each of them, three variants were solved: 1) landing on one runway, 2) landing on two runways, and 3) landing on three runways. Optimal solutions were obtained for all test instances. A comparison of the obtained results with those of a genetic algorithm is discussed. The proposed novel algorithm is efficient and can successfully solve larger problems with a larger number of landing aircraft and more runways.

1 June 2018
Verified
Conference Paper
Closed access
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
Galia MarinovaGalia Marinova
Galia Marinova
An accelerated genetic algorithm called ASOGA for solving multi-objective optimization problems in a grid-connected microgrid is proposed in this paper. One four-criterial optimization problem is formulated. By means of the weighted sum scalarization the problem is transformed into single objective one and corresponding Pareto-optimal schedules of energy flows in the microgrid are obtained. The comparison of the novel algorithm with a trivial genetic algorithm shows an essential reduction of iterations number, necessary to achieve the final solution.

19 June 2023
Verified
Conference Paper
Closed access
VGVassil Georgiev Guliashki
Vassil Georgiev Guliashki
GMGašper Mušič
Gašper Mušič
Galia MarinovaGalia Marinova
Galia Marinova
This paper considers Aircraft Landing Problem (ALP) in the context of optimal runway utilization. A heuristic algorithm is proposed to minimize a penalty cost function associated with the difference between the determined landing time and the target landing time. The objective is to obtain an optimal schedule for a sequence of a finite number of aircraft that can use 1, 2, or 3 runways. The constraints are defined in relation to the time window bounded by the earliest and latest landing times. Six single-objective simulation optimization tasks were solved, namely 2 tasks on 1 runway, one with sequences of 10 and the second with sequences of 20 aircraft, 2 tasks on 2 runways with sequences of 10 and 20 aircraft, respectively, and 2 tasks on 3 runways with sequences of 10 and 20 aircraft. The solutions found are optimal. The results show that the proposed algorithm has a good performance and can be used for solving real-life optimization problems of this type.