Andrzej Jaszkiewicz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrzej Jaszkiewicz has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Piotr Zielniewicz
Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland
10 shared publications - Roman Słowiński
Institute of Computing Science Poznań University of Technology 60-965 Poznań Poland
6 shared publications Maciej Hapke
Poznań University of Technology ul
4 shared publicationsKrzysztof Dembczyński
Poznań Univesity of Technology
3 shared publications- Thibaut Lust
Sorbonne Université, CNRS, LIP6
3 shared publications - Marek Rogalski
University of Lodz
2 shared publications
Latest Publications
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1495-1523
Recent developments in data structures and algorithms for evolutionary multiobjective optimization
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1495-1523
Open AccessRecent developments in data structures and algorithms for evolutionary multiobjective optimization
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 223-226
Lazy Hypervolume Subset Selection Algorithm with Contributions Update
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 223-226
Open AccessLazy Hypervolume Subset Selection Algorithm with Contributions Update
- 1 February 2025
- Published by AIP Publishing in Physics of Fluids
- Vol. 37 (2)
Implicit modeling of equivariant tensor basis with Euclidean turbulence closure neural network
Improved turbulence models are necessary for achieving more accurate solutions in Reynolds-averaged Navier–Stokes (RANS) simulations. RANS is widely used in various engineering applications, and enhancing its accuracy is crucial for geometry design and control applications. With the increasing availability of high-fidelity datasets, machine learning (ML) techniques offer the opportunity for data-driven inference of RANS equation closure terms. By Pope's theoretical analysis, ML turbulence closure models for RANS simulations are often used alongside physics-informed preprocessing of equivariant tensor basis. In this work, we replace this established approach by designing an equivariant turbulence model with Euclidean Neural Networks (e3nn). We demonstrate that Pope's tensor basis is a special case of our model. We test the model on the periodic hills flow case dataset. Our approach significantly improves the prediction of anisotropic components of Reynolds stresses, leading to more accurate modeling of the flow field when integrated into RANS through a single injection.
- 1 February 2025
- Published by AIP Publishing in Physics of Fluids
- Vol. 37 (2)
Implicit modeling of equivariant tensor basis with Euclidean turbulence closure neural network
Improved turbulence models are necessary for achieving more accurate solutions in Reynolds-averaged Navier–Stokes (RANS) simulations. RANS is widely used in various engineering applications, and enhancing its accuracy is crucial for geometry design and control applications. With the increasing availability of high-fidelity datasets, machine learning (ML) techniques offer the opportunity for data-driven inference of RANS equation closure terms. By Pope's theoretical analysis, ML turbulence closure models for RANS simulations are often used alongside physics-informed preprocessing of equivariant tensor basis. In this work, we replace this established approach by designing an equivariant turbulence model with Euclidean Neural Networks (e3nn). We demonstrate that Pope's tensor basis is a special case of our model. We test the model on the periodic hills flow case dataset. Our approach significantly improves the prediction of anisotropic components of Reynolds stresses, leading to more accurate modeling of the flow field when integrated into RANS through a single injection.
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (4) , 1227-1238
Exact Calculation and Properties of the R2 Multiobjective Quality Indicator
Quality indicators play an essential role in evolutionary multiobjective optimization (EMO). Most likely the most often used quality indicator in EMO is hypervolume, due to its strict monotonicity with respect to the dominance relation. However, hypervolume is not free of some weak points. For example, a number of recent papers pointed out its high sensitivity to the specification of the reference point. Furthermore, hypervolume is based on fully geometric reasoning which may lead to some undesired results. Thus, it is worth to consider also other quality indicators. In this paper we prove that another well-known R2 quality indicator is also strictly monotonic with respect to the dominance relation when calculated exactly and the reference point strongly dominates any solution in the evaluated set. Furthermore, we adapt the Improved Quick Hypervolume algorithm to the exact calculation of R2 indicator. To our knowledge this is the first exact algorithm for R2 calculation with publicly available implementation. In addition, through both theoretical analysis and computational experiments we show that R2 performs consistently for Pareto fronts with different shapes. We discuss also differences of Pareto fronts representations generated by an indicator-based EMO with hypervolume and R2, where the latter tends to generate solutions having a high chance to be preferred by the DM, not necessarily uniformly distributed in geometric sense. All of these results, make R2 a sound alternative or a complement to hypervolume in EMO.
- 7 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (4) , 1227-1238
Exact Calculation and Properties of the R2 Multiobjective Quality Indicator
Quality indicators play an essential role in evolutionary multiobjective optimization (EMO). Most likely the most often used quality indicator in EMO is hypervolume, due to its strict monotonicity with respect to the dominance relation. However, hypervolume is not free of some weak points. For example, a number of recent papers pointed out its high sensitivity to the specification of the reference point. Furthermore, hypervolume is based on fully geometric reasoning which may lead to some undesired results. Thus, it is worth to consider also other quality indicators. In this paper we prove that another well-known R2 quality indicator is also strictly monotonic with respect to the dominance relation when calculated exactly and the reference point strongly dominates any solution in the evaluated set. Furthermore, we adapt the Improved Quick Hypervolume algorithm to the exact calculation of R2 indicator. To our knowledge this is the first exact algorithm for R2 calculation with publicly available implementation. In addition, through both theoretical analysis and computational experiments we show that R2 performs consistently for Pareto fronts with different shapes. We discuss also differences of Pareto fronts representations generated by an indicator-based EMO with hypervolume and R2, where the latter tends to generate solutions having a high chance to be preferred by the DM, not necessarily uniformly distributed in geometric sense. All of these results, make R2 a sound alternative or a complement to hypervolume in EMO.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (3) , 726-733
Improving the Efficiency of the Distance-Based Hypervolume Estimation Using ND-Tree
Hypervolume is most likely the most often used quality indicator in EMO due to its monotonicity with respect to the dominance relation. Since, however, exact calculation of hypervolume is computationally demanding, many researchers have proposed methods for hypervolume estimation. Many of such methods use numerical integration of the distance from the reference point to the upper boundary of the dominated region along uniformly sampled directions. To find this distance for a given direction, the maximum value of the inverse weighted Chebycheff function needs to be found. For small solution sets this could be done by the exhaustive search which, however, may be very inefficient for large solution sets, e.g. for unbounded external archives of EMO algorithms. In this paper, we adapt the ND-Tree-based algorithm for finding the minimum of the standard weighted Chebycheff function to finding the maximum of the inverse function. Through a computational experiment we show that this ND-Tree-based algorithm may be used either for reduction of the running time of hypervolume estimation by up to two orders of magnitude or for improving the estimation accuracy with the same time budget up to an order of magnitude for data sets with up to 12 objectives and 50000 points.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (3) , 726-733
Improving the Efficiency of the Distance-Based Hypervolume Estimation Using ND-Tree
Hypervolume is most likely the most often used quality indicator in EMO due to its monotonicity with respect to the dominance relation. Since, however, exact calculation of hypervolume is computationally demanding, many researchers have proposed methods for hypervolume estimation. Many of such methods use numerical integration of the distance from the reference point to the upper boundary of the dominated region along uniformly sampled directions. To find this distance for a given direction, the maximum value of the inverse weighted Chebycheff function needs to be found. For small solution sets this could be done by the exhaustive search which, however, may be very inefficient for large solution sets, e.g. for unbounded external archives of EMO algorithms. In this paper, we adapt the ND-Tree-based algorithm for finding the minimum of the standard weighted Chebycheff function to finding the maximum of the inverse function. Through a computational experiment we show that this ND-Tree-based algorithm may be used either for reduction of the running time of hypervolume estimation by up to two orders of magnitude or for improving the estimation accuracy with the same time budget up to an order of magnitude for data sets with up to 12 objectives and 50000 points.
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 371-374
On-line Quick Hypervolume Algorithm
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 371-374
Open AccessOn-line Quick Hypervolume Algorithm
- 15 August 2022
- Published by Springer Nature
- p. 164-178
Greedy Decremental Quick Hypervolume Subset Selection Algorithms
- 15 August 2022
- Published by Springer Nature
- p. 164-178
Greedy Decremental Quick Hypervolume Subset Selection Algorithms
- 14 August 2022
- Published by Springer Nature
- p. 279-293
Evolutionary Algorithm for Vehicle Routing with Diversity Oscillation Mechanism
- 14 August 2022
- Published by Springer Nature
- p. 279-293
Evolutionary Algorithm for Vehicle Routing with Diversity Oscillation Mechanism
- 4 April 2022
- Published by Springer Nature
- p. 62-78
Deep Infeasibility Exploration Method for Vehicle Routing Problems
- 4 April 2022
- Published by Springer Nature
- p. 62-78
Deep Infeasibility Exploration Method for Vehicle Routing Problems
- 9 February 2022
- Published by Springer Nature
- p. 297-306
The Use of Decision Maker’s Preferences in Multiobjective Metaheuristics
- 9 February 2022
- Published by Springer Nature
- p. 297-306
The Use of Decision Maker’s Preferences in Multiobjective Metaheuristics