Miloš Sedak

Mr. Miloš Sedak

Belgrade University, Faculty of Mechanical Engineering
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
25 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MSMiloš Sedak
Miloš Sedak
BRBožidar Rosić
Božidar Rosić
This paper considers the problem of constrained multi-objective non-linear optimization of planetary gearbox based on hybrid metaheuristic algorithm. Optimal design of planetary gear trains requires simultaneous minimization of multiple conflicting objectives, such as gearbox volume, center distance, contact ratio, power loss, etc. In this regard, the theoretical formulation and numerical procedure for the calculation of the planetary gearbox power efficiency has been developed. To successfully solve the stated constrained multi-objective optimization problem, in this paper a hybrid algorithm between particle swarm optimization and differential evolution algorithms has been proposed and applied to considered problem. Here, the mutation operators from the differential evolution algorithm have been incorporated into the velocity update equation of the particle swarm optimization algorithm, with the adaptive population spacing parameter employed to select the appropriate mutation operator for the current optimization condition. It has been shown that the proposed algorithm successfully obtains the solutions of the non-convex Pareto set, and reveals key insights in reducing the weight, improving efficiency and preventing premature failure of gears. Compared to other well-known algorithms, the numerical simulation results indicate that the proposed algorithm shows improved optimization performance in terms of the quality of the obtained Pareto solutions.

27 June 2024 in Machines
Verified
Journal Article
Open access
PDF file
Tatjana M. LazovićTatjana M. Lazović
Tatjana M. Lazović
Aleksandar B MarinkovićAleksandar B Marinković
Aleksandar B Marinković
Ivana AtanasovskaIvana Atanasovska
Ivana Atanasovska
MSMiloš Sedak
Miloš Sedak
Blaza StojanovićBlaza Stojanović
Blaza Stojanović
This review paper is an homage to Arvid Palmgren’s pioneering paper on rolling bearing service life to highlight its relevance a century later. It follows the evolution of bearing service life theory from Palmgren’s fundamental research to the contemporary international standard ISO 281. Palmgren’s theory, based on the previously published papers of Stribeck and Hertz, laid the basis for the later development of bearing service life assessment methodology. Based on the Weibull theory of probability of damage, Lundberg and Palmgren introduced stochastic elements to explain the effect of reliability on bearing service life prediction. Harris and Ioannides, who made a significant contribution to the revision of the international standard on rolling bearing load rating and rating life are mentioned as well. Zaretsky’s critical analysis also was not neglected in this review, due to a different approach respecting the original influence of material properties and bearing performances. Despite standardization, ongoing research by leading advanced bearing industries and academic institutions continues to refine methodologies for service life assessment. Through a comprehensive review and analysis, this paper offers insight into the current state of bearing service life theory, highlighting the collaborative efforts bringing progress in this field.

4 January 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MRMaja Božidar Rosić
Maja Božidar Rosić
MSMiloš Sedak
Miloš Sedak
MSMirjana Simic
Mirjana Simic
PPPredrag Pejović
Predrag Pejović
This paper addresses the problem of time difference of arrival (TDOA) based passive target localizationand proposes an improved chaos-driven hybrid differential evolution (DE) algorithm and butterfly optimization algorithm (BOA), named ICDEBOA, to solve this complex optimization problem. The proposed algorithm consists of a new mutation strategy with the mechanisms of the BOA algorithm incorporated into the DE algorithm. To boost optimization effectiveness, chaos theory is employed to adjust the control parameter values. The considered localization problem is formulated using the maximum likelihood estimator. To perform the accuracy comparison, the convex constrained weighting least squares algorithm is applied to the considered localization problem as the widely used method in literature. The statistical analysis shows that the proposed modifications to the ICDEBOA algorithm improve its optimization performance, as demonstrated by the improved performance on the CEC2014 benchmark problems. The ICDEBOA algorithm is also shown to be more robust than existing algorithms in noisy environments. Numerical simulation results show that the proposed ICDEBOA algorithm meets the CRLB and achieves better performance than the CWLS, DE, and BOA algorithms.

1 January 2025 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
PDF file
MRMaja Rosić
Maja Rosić
BRBožidar Rosić
Božidar Rosić
MSMiloš Sedak
Miloš Sedak
This paper introduces a hybrid multi-objective optimization algorithm, designated HMODESFO, which amalgamates the exploratory prowess of Differential Evolution (DE) with the rapid convergence attributes of the Sailfish Optimi... | Find, read and cite all the research you need on Tech Science Press

25 October 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MSMiloš Sedak
Miloš Sedak
MRMaja Božidar Rosić
Maja Božidar Rosić
The multi-objective optimization (MOO) of a planetary gearbox is a challenging optimization problem, which includes simultaneous minimization of a number of conflicting objectives including gearbox volume, contact ratio, power loss, etc., and at the same time satisfying a number of complex constraints. This paper addresses this complex problem by proposing a modified hybrid algorithm, named Multi-objective Hybrid Butterfly Optimization and Particle Swarm Optimization Algorithm (HMOBPSO), which integrates PSO and Particle Swarm Optimization (BOA) algorithms with the aim to improve the performance with respect to the considered problem. The proposed approach solves the non-convex Pareto set and provides vital insights for lowering gear weight and efficiency and avoiding early failure. The experimental analysis employs numerical simulations to determine the Pareto optimal solutions to the formulated MOO problem. The results show that the proposed method offers significant improvements in terms of gearbox size, efficiency, and spacing compared to the conventional methods. In addition, an assessment of the optimization performance of the proposed HMOBPSO algorithm has been conducted by comparing it to other established algorithms across several ZDT and DTLZ benchmark problems, where it demonstrated its effectiveness.

31 July 2022 in Sensors
Verified
Journal Article
Open access
PDF file
MRMaja Božidar Rosić
Maja Božidar Rosić
MSMiloš Sedak
Miloš Sedak
MSMirjana Simic
Mirjana Simic
PPPredrag Pejović
Predrag Pejović
This paper considers the problem of finding the position of a passive target using noisy time difference of arrival (TDOA) measurements, obtained from multiple transmitters and a single receiver. The maximum likelihood (ML) estimator’s objective function is extremely nonlinear and non-convex, making it impossible to use traditional optimization techniques. In this regard, this paper proposes the chaos-enhanced adaptive hybrid butterfly particle swarm optimization algorithm, named CAHBPSO, as the hybridization of butterfly optimization (BOA) and particle swarm optimization (PSO) algorithms, to estimate passive target position. In the proposed algorithm, an adaptive strategy is employed to update the sensory fragrance of BOA algorithm, and chaos theory is incorporated into the inertia weight of PSO algorithm. Furthermore, an adaptive switch probability is employed to combine global and local search phases of BOA with the PSO algorithm. Additionally, the semidefinite programming is employed to convert the considered problem into a convex one. The statistical comparison on CEC2014 benchmark problems shows that the proposed algorithm provides a better performance compared to well-known algorithms. The CAHBPSO method surpasses the BOA, PSO and semidefinite programming (SDP) algorithms for a broad spectrum of noise, according to simulation findings, and achieves the Cramer–Rao lower bound (CRLB).