Jaroslav Janáček
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jaroslav Janáček has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Marek Kvet
Faculty of Management Science and Informatics, University of Zilina, Univerzitna 8215/1, 010 26 Zilina, Slovakia
19 shared publications Marek Kvet
University of Zilina, Faculty of Management Science and Informatics
4 shared publications- Michal Kvet
University of Žilina
3 shared publications - Michal Koháni
University of Žilina
2 shared publications - René Fabricius
Faculty of Management Science and Informatics, University of Zilina, Zilina, Slovakia
2 shared publications - David Mičulka
Department of Air Transport, Institute of Transport, Faculty of Mechanical Engineering, VŠB—Technical University of Ostrava, 17. Listopadu 2172/15, 708 33 Ostrava-Poruba, Czech Republic
1 shared publication
Latest Publications
- Open Access
Intelligent Swap-Based Heuristics for Two-Objective Location Problems in Emergency Services
This scholarly article focuses on a specific application of discrete optimization methods in the emergency services. The search for the optimal deployment of service centers is one of the strategic decisions made in the field of urgent pre-hospital healthcare management. Since the consequences of the decisions are important for everyone and can directly affect the availability of the emergency medical service, different opinion groups are often taken into account when formulating a mathematical model. If there are two or more different conflicting objectives, the Pareto front of solutions usually needs to be constructed. It may serve as a good basis for finding the final system design. Since the construction of the exact Pareto set is very time-consuming and requires large computing resources, the efforts of many experts are focused on the development of efficient algorithms enabling the approximation of the original Pareto frontier in a short time. This paper introduces one of such heuristics. Even if the proposed algorithm of gradual refinement follows the idea of sequential processing of the current set of non-dominated solutions item by item inspecting the neighborhood of each element for possible extension of the Pareto front approximation, it can be simply adjusted and generalized making use of several parameters. Such an adjustment naturally raises the question of their optimal settings. Therefore, we gradually tried several procedures, from simple experimental verification of suitable values up to the development of sophisticated tuning of parameters based on machine learning methods. In this way, we created a complex advanced algorithm with elements of artificial intelligence. A series of numerical experiments are carried out utilizing real-world benchmarks that have their Pareto fronts applied in order to quantify and measure the efficacy of the proposed heuristic method.
Open AccessIntelligent Swap-Based Heuristics for Two-Objective Location Problems in Emergency Services
This scholarly article focuses on a specific application of discrete optimization methods in the emergency services. The search for the optimal deployment of service centers is one of the strategic decisions made in the field of urgent pre-hospital healthcare management. Since the consequences of the decisions are important for everyone and can directly affect the availability of the emergency medical service, different opinion groups are often taken into account when formulating a mathematical model. If there are two or more different conflicting objectives, the Pareto front of solutions usually needs to be constructed. It may serve as a good basis for finding the final system design. Since the construction of the exact Pareto set is very time-consuming and requires large computing resources, the efforts of many experts are focused on the development of efficient algorithms enabling the approximation of the original Pareto frontier in a short time. This paper introduces one of such heuristics. Even if the proposed algorithm of gradual refinement follows the idea of sequential processing of the current set of non-dominated solutions item by item inspecting the neighborhood of each element for possible extension of the Pareto front approximation, it can be simply adjusted and generalized making use of several parameters. Such an adjustment naturally raises the question of their optimal settings. Therefore, we gradually tried several procedures, from simple experimental verification of suitable values up to the development of sophisticated tuning of parameters based on machine learning methods. In this way, we created a complex advanced algorithm with elements of artificial intelligence. A series of numerical experiments are carried out utilizing real-world benchmarks that have their Pareto fronts applied in order to quantify and measure the efficacy of the proposed heuristic method.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000261-000264
Valued Neighborhood Search for Determination of Pareto-Optimal Solutions
Classical version of the neighborhood search based on exchange operation tests objective function of solution obtained by the exchange operation and depending on the objective function value decides on further progress. When a series of Pareto-optimal solutions of the p-location problem is determined, huge number of such operations must be tested and evaluated. As many of exchanges are repeated with the same consequence for the further progress, it is questionable whether the previously obtained information about their success can be taken into account in the decision process. In this contribution, we focus on answering this question. We perform the associated research of influence of information about previous success or failure on effectiveness of the neighborhood search application to determination of a set of Pareto-optimal solutions.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 000261-000264
Valued Neighborhood Search for Determination of Pareto-Optimal Solutions
Classical version of the neighborhood search based on exchange operation tests objective function of solution obtained by the exchange operation and depending on the objective function value decides on further progress. When a series of Pareto-optimal solutions of the p-location problem is determined, huge number of such operations must be tested and evaluated. As many of exchanges are repeated with the same consequence for the further progress, it is questionable whether the previously obtained information about their success can be taken into account in the decision process. In this contribution, we focus on answering this question. We perform the associated research of influence of information about previous success or failure on effectiveness of the neighborhood search application to determination of a set of Pareto-optimal solutions.
- 15 September 2024
- Published by Springer Nature
- p. 175-184
Artificial Intelligence for Metaheuristic Parameter Setting
- 15 September 2024
- Published by Springer Nature
- p. 175-184
Artificial Intelligence for Metaheuristic Parameter Setting
- 15 September 2024
- Published by Springer Nature
- p. 185-193
Hyperheuristic as Tuning Tool of Generalized Swap Strategy
- 15 September 2024
- Published by Springer Nature
- p. 185-193
Hyperheuristic as Tuning Tool of Generalized Swap Strategy
- Open Access
- 23 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2418
Kit of Uniformly Deployed Sets for p-Location Problems
This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of a uniformly deployed set of p-location problems from the solution of the p-location problem for that specific instance. The research presented in this paper is focused on methods of construction of uniformly deployed sets of solutions and the examination of their impact on the efficiency of subsequent optimization algorithms. The approaches to the construction are used for the constitution of predetermined families of uniformly deployed sets of p-location problem solutions, which have standard sizes. We introduce two methods of uniformly deployed set construction: the first one is based on composition, followed by an enlargement process; and the second one makes use of voltage graphs. The construction approaches are completed by an algorithm, which adjusts the set of solutions to the sizes of a solved instance. The influence of a set construction approach on solving process efficiency is studied on real-world benchmarks, which include both the p-median objective function and the generalized disutility function. The solving process is performed alternatively using the swap or path-relinking based methods. Results of the computational study obtained by all combinations of the mentioned approaches are presented and evaluated in the concluding part of the paper to make the studied characteristics visible.
- 23 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (11) , 2418
Open AccessKit of Uniformly Deployed Sets for p-Location Problems
This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of a uniformly deployed set of p-location problems from the solution of the p-location problem for that specific instance. The research presented in this paper is focused on methods of construction of uniformly deployed sets of solutions and the examination of their impact on the efficiency of subsequent optimization algorithms. The approaches to the construction are used for the constitution of predetermined families of uniformly deployed sets of p-location problem solutions, which have standard sizes. We introduce two methods of uniformly deployed set construction: the first one is based on composition, followed by an enlargement process; and the second one makes use of voltage graphs. The construction approaches are completed by an algorithm, which adjusts the set of solutions to the sizes of a solved instance. The influence of a set construction approach on solving process efficiency is studied on real-world benchmarks, which include both the p-median objective function and the generalized disutility function. The solving process is performed alternatively using the swap or path-relinking based methods. Results of the computational study obtained by all combinations of the mentioned approaches are presented and evaluated in the concluding part of the paper to make the studied characteristics visible.
- Open Access
- 11 April 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (8) , 4810
Directed Search for Non-Dominated Emergency Medical System Designs
This research paper is aimed at a specific group of emergency medical service location problems, which are solved to save people’s lives and reduce the rate of mortality and morbidity. Since searching for the optimal service center deployment is a big challenge, many operations researchers, programmers, and healthcare practitioners have been making a great effort to find effective solutions since the 1960s. Within this paper, we study such a system design problem in which two contradictory objectives are taken into account. Since the optimization of one criterion causes deterioration in the value of the other, a specific small finite set of solutions seems to be a sufficient output of the associated solving process for further decision-making. Therefore, we study here several heuristic approaches that enable us to approximate the original Pareto fronts of non-dominated system designs. In addition to the theoretical explanation, we provide the readers with the results of numerical experiments in order to evaluate the quality of the proposed algorithms. Based on the presented results, it can be stated that the suggested approach is able to produce a good approximation of the Pareto front of emergency medical service system designs in acceptable computational time, which is in orders shorter than the one required by the former exact method.
- 11 April 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (8) , 4810
Open AccessDirected Search for Non-Dominated Emergency Medical System Designs
This research paper is aimed at a specific group of emergency medical service location problems, which are solved to save people’s lives and reduce the rate of mortality and morbidity. Since searching for the optimal service center deployment is a big challenge, many operations researchers, programmers, and healthcare practitioners have been making a great effort to find effective solutions since the 1960s. Within this paper, we study such a system design problem in which two contradictory objectives are taken into account. Since the optimization of one criterion causes deterioration in the value of the other, a specific small finite set of solutions seems to be a sufficient output of the associated solving process for further decision-making. Therefore, we study here several heuristic approaches that enable us to approximate the original Pareto fronts of non-dominated system designs. In addition to the theoretical explanation, we provide the readers with the results of numerical experiments in order to evaluate the quality of the proposed algorithms. Based on the presented results, it can be stated that the suggested approach is able to produce a good approximation of the Pareto front of emergency medical service system designs in acceptable computational time, which is in orders shorter than the one required by the former exact method.
- 1 January 2023
- Published by IPSI doo, Belgrade in IPSI Transactions on Internet Research
- Vol. 19 (01) , 12-17
Elements of simulated annealing in Pareto front search
Determination of the Pareto front of location problem solutions represents one of the very complex and computational time demanding tasks, when solved by exact means of mathematical programming. This paper is motivated by possible application of the metaheuristic simulated annealing to the process of obtaining a close approximation of the Pareto front by a set of non-dominated solutions of the p-location problem. Contrary to the other approaches, the suggested method is based on minimization of non-dominated solution set area, which directly describes quality of the approximation. Elements of the simulated annealing method are used for random breaking some limits imposed on local characteristics of the improving process. The presented results of the numerical experiments give an insight to relations among the simulated annealing parameters and optimization process efficiency.
- 1 January 2023
- Published by IPSI doo, Belgrade in IPSI Transactions on Internet Research
- Vol. 19 (01) , 12-17
Elements of simulated annealing in Pareto front search
Determination of the Pareto front of location problem solutions represents one of the very complex and computational time demanding tasks, when solved by exact means of mathematical programming. This paper is motivated by possible application of the metaheuristic simulated annealing to the process of obtaining a close approximation of the Pareto front by a set of non-dominated solutions of the p-location problem. Contrary to the other approaches, the suggested method is based on minimization of non-dominated solution set area, which directly describes quality of the approximation. Elements of the simulated annealing method are used for random breaking some limits imposed on local characteristics of the improving process. The presented results of the numerical experiments give an insight to relations among the simulated annealing parameters and optimization process efficiency.
- 30 July 2022
- Published by Springer Nature
- p. 56-82
Selected Approximate Approaches to Robust Emergency Service System Design
- 30 July 2022
- Published by Springer Nature
- p. 56-82
Selected Approximate Approaches to Robust Emergency Service System Design
- Open Access
- 1 October 2021
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 23 (4) , E68-E75
Two Objective Public Service System Design Problem
The? public? service? system? serves? population? spread? over? a? geographical? area from a given number of service centers. One of the possible approaches to? the? problem? with? two? or? more? simultaneously? applied? contradicting? objecti...
- 1 October 2021
- Published by University of Zilina in Communications - Scientific letters of the University of Zilina
- Vol. 23 (4) , E68-E75
Open AccessTwo Objective Public Service System Design Problem
The? public? service? system? serves? population? spread? over? a? geographical? area from a given number of service centers. One of the possible approaches to? the? problem? with? two? or? more? simultaneously? applied? contradicting? objecti...