Zoltán Süle
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zoltán Süle has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- János Abonyi
University of Pannonia
7 shared publications - Tamás Kegyes
HUN-REN-PE Complex Systems Monitoring Research Group, University of Pannonia, Egyetem Utca 10, 8200 Veszprém, Hungary
3 shared publications János Baumgartner
2 shared publications- Szilárd Jaskó
Department of Applied Informatics, University Center for Circular Economy, University of Pannonia, 8200 Veszprém, Hungary
2 shared publications - Tamás Terlaky
Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, USA
2 shared publications - Tibor Holczinger
Department of Applied Informatics, University of Pannonia, Nagykanizsa, Hungary
2 shared publications
Latest Publications
- Open Access
- 31 March 2024
- Published by MDPI AG in Information
- Vol. 15 (4) , 193
Generally Applicable Q-Table Compression Method and Its Application for Constrained Stochastic Graph Traversal Optimization Problems
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line balancing problems belong to the class of constrained shortest pathfinding problems, which can be represented as mixed-integer optimization problems. Reinforcement learning (RL) methods have proven their efficiency in multiple complex problems. However, researchers concluded that the learning time increases radically by growing the state- and action spaces. In continuous cases, approximation techniques are used, but these methods have several limitations in mixed-integer searching spaces. We present the Q-table compression method as a multistep method with dimension reduction, state fusion, and space compression techniques that project a mixed-integer optimization problem into a discrete one. The RL agent is then trained using an extended Q-value-based method to deliver a human-interpretable model for optimal action selection. Our approach was tested in selected constrained stochastic graph traversal use cases, and comparative results are shown to the simple grid-based discretization method.
- 31 March 2024
- Published by MDPI AG in Information
- Vol. 15 (4) , 193
Open AccessGenerally Applicable Q-Table Compression Method and Its Application for Constrained Stochastic Graph Traversal Optimization Problems
We analyzed a special class of graph traversal problems, where the distances are stochastic, and the agent is restricted to take a limited range in one go. We showed that both constrained shortest Hamiltonian pathfinding problems and disassembly line balancing problems belong to the class of constrained shortest pathfinding problems, which can be represented as mixed-integer optimization problems. Reinforcement learning (RL) methods have proven their efficiency in multiple complex problems. However, researchers concluded that the learning time increases radically by growing the state- and action spaces. In continuous cases, approximation techniques are used, but these methods have several limitations in mixed-integer searching spaces. We present the Q-table compression method as a multistep method with dimension reduction, state fusion, and space compression techniques that project a mixed-integer optimization problem into a discrete one. The RL agent is then trained using an extended Q-value-based method to deliver a human-interpretable model for optimal action selection. Our approach was tested in selected constrained stochastic graph traversal use cases, and comparative results are shown to the simple grid-based discretization method.
- Open Access
- 16 May 2023
- Published by Nemzetbiztonsagi Szemle in Nemzetbiztonsági szemle
- Vol. 11 (1) , 62-77
Az információmenedzsment szerepe az ABV-védelemben
Az atom-, bio- és vegyi (ABV-) incidensek felderítése kiemelt fontosságú feladat, amely évtizedek óta intenzíven kutatott téma. A folyamatos technológiai, adatfeldolgozási és automatizálási vívmányok újabb és újabb fejlesztési potenciált nyitnak az ABV-védelem terén is, amely napjainkra komplex, interdiszciplináris tudományterületté vált. Ennek megfelelően kémikusok, fizikusok, meteorológusok, katonai szakértők, programozók és adattudósok egyaránt közreműködnek a kutatásokban. A hazai ABV-védelmi képességek hatékony növelésének a kulcsa is abban rejlik, hogy megfelelően strukturált koncepció mentén folyamatos és célirányos fejlesztés történjen. Kutatásunk célja, hogy áttekintést adjunk a modern ABV-védelmi technológiák főbb komponenseiről, ezen belül összefoglaljuk az ABV-felderítés, illetve a döntéstámogatási lépések koncepcionális követelményeit, és bemutatjuk az információmenedzsment szerepét és legújabb lehetőségeit a folyamatokban.
- 16 May 2023
- Published by Nemzetbiztonsagi Szemle in Nemzetbiztonsági szemle
- Vol. 11 (1) , 62-77
Open AccessAz információmenedzsment szerepe az ABV-védelemben
Az atom-, bio- és vegyi (ABV-) incidensek felderítése kiemelt fontosságú feladat, amely évtizedek óta intenzíven kutatott téma. A folyamatos technológiai, adatfeldolgozási és automatizálási vívmányok újabb és újabb fejlesztési potenciált nyitnak az ABV-védelem terén is, amely napjainkra komplex, interdiszciplináris tudományterületté vált. Ennek megfelelően kémikusok, fizikusok, meteorológusok, katonai szakértők, programozók és adattudósok egyaránt közreműködnek a kutatásokban. A hazai ABV-védelmi képességek hatékony növelésének a kulcsa is abban rejlik, hogy megfelelően strukturált koncepció mentén folyamatos és célirányos fejlesztés történjen. Kutatásunk célja, hogy áttekintést adjunk a modern ABV-védelmi technológiák főbb komponenseiről, ezen belül összefoglaljuk az ABV-felderítés, illetve a döntéstámogatási lépések koncepcionális követelményeit, és bemutatjuk az információmenedzsment szerepét és legújabb lehetőségeit a folyamatokban.
- Open Access
- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 74977-75017
Scheduling Under Uncertainty for Industry 4.0 and 5.0
This article provides a review about how uncertainties in increasingly complex production and supply chains should be addressed in scheduling tasks. Uncertainty management will be particularly important in Industry 5.0 solutions that will require the close integration of operators and technical systems. To prepare for these challenging developments, this work reviews the sources of uncertainty and the scheduling algorithms that deal with the different types of models developed to handle the uncertain nature of the elements and the environment of complex technological systems. The paper not only identifies the challenges, but also the main building blocks that can help to manage and reduce uncertainties based on the I4.0 and I5.0 solutions. We hope that this study will serve as a starting point for R&D projects and algorithm developments, which will be needed primarily in the field of multi-agent, multistage and inverse optimizations.
- 15 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 74977-75017
Open AccessScheduling Under Uncertainty for Industry 4.0 and 5.0
This article provides a review about how uncertainties in increasingly complex production and supply chains should be addressed in scheduling tasks. Uncertainty management will be particularly important in Industry 5.0 solutions that will require the close integration of operators and technical systems. To prepare for these challenging developments, this work reviews the sources of uncertainty and the scheduling algorithms that deal with the different types of models developed to handle the uncertain nature of the elements and the environment of complex technological systems. The paper not only identifies the challenges, but also the main building blocks that can help to manage and reduce uncertainties based on the I4.0 and I5.0 solutions. We hope that this study will serve as a starting point for R&D projects and algorithm developments, which will be needed primarily in the field of multi-agent, multistage and inverse optimizations.
- Open Access
- 1 January 2021
- Published by Wiley in Complexity
- Vol. 2021 (1)
The Applicability of Reinforcement Learning Methods in the Development of Industry 4.0 Applications
Reinforcement learning (RL) methods can successfully solve complex optimization problems. Our article gives a systematic overview of major types of RL methods, their applications at the field of Industry 4.0 solutions, and it provides methodological guidelines to determine the right approach that can be fitted better to the different problems, and moreover, it can be a point of reference for R&D projects and further researches.
- 1 January 2021
- Published by Wiley in Complexity
- Vol. 2021 (1)
Open AccessThe Applicability of Reinforcement Learning Methods in the Development of Industry 4.0 Applications
Reinforcement learning (RL) methods can successfully solve complex optimization problems. Our article gives a systematic overview of major types of RL methods, their applications at the field of Industry 4.0 solutions, and it provides methodological guidelines to determine the right approach that can be fitted better to the different problems, and moreover, it can be a point of reference for R&D projects and further researches.
- Open Access
- 1 January 2021
- Published by Wiley in Complexity
- Vol. 2021 (1)
Industry 4.0‐Driven Development of Optimization Algorithms: A Systematic Overview
The Fourth Industrial Revolution means the digital transformation of production systems. Cyber‐physical systems allow for the horizontal and vertical integration of these production systems as well as the exploitation of the benefits via optimization tools. This article reviews the impact of Industry 4.0 solutions concerning optimization tasks and optimization algorithms, in addition to the identification of the new R&D directions driven by new application options. The basic organizing principle of this overview of the literature is to explore the requirements of optimization tasks, which are needed to perform horizontal and vertical integration. This systematic review presents content from 900 articles on Industry 4.0 and optimization as well as 388 articles on Industry 4.0 and scheduling. It is our hope that this work can serve as a starting point for researchers and developers in the field.
- 1 January 2021
- Published by Wiley in Complexity
- Vol. 2021 (1)
Open AccessIndustry 4.0‐Driven Development of Optimization Algorithms: A Systematic Overview
The Fourth Industrial Revolution means the digital transformation of production systems. Cyber‐physical systems allow for the horizontal and vertical integration of these production systems as well as the exploitation of the benefits via optimization tools. This article reviews the impact of Industry 4.0 solutions concerning optimization tasks and optimization algorithms, in addition to the identification of the new R&D directions driven by new application options. The basic organizing principle of this overview of the literature is to explore the requirements of optimization tasks, which are needed to perform horizontal and vertical integration. This systematic review presents content from 900 articles on Industry 4.0 and optimization as well as 388 articles on Industry 4.0 and scheduling. It is our hope that this work can serve as a starting point for researchers and developers in the field.
- 21 August 2018
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 27 (2) , 357-375
Test-sequence optimisation by survival analysis
- 21 August 2018
- Published by Springer Nature in Central European Journal of Operations Research
- Vol. 27 (2) , 357-375
Test-sequence optimisation by survival analysis
- 8 November 2013
- Published by Springer Nature in Optimization and Engineering
- Vol. 14 (4) , 501-502
Veszprém Optimization Conference: Advanced Algorithms (VOCAL) 2010
- 8 November 2013
- Published by Springer Nature in Optimization and Engineering
- Vol. 14 (4) , 501-502
Veszprém Optimization Conference: Advanced Algorithms (VOCAL) 2010
- Open Access
- 1 June 2011
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 26 (3) , 345-346
Preface
- 1 June 2011
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 26 (3) , 345-346
Open AccessPreface