Rafał Skinderowicz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rafał Skinderowicz has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jan Kozak
University of Economics in Katowice
3 shared publications - Arkadiusz Nowakowski
University of Silesia in Katowice
2 shared publications - Kornel Chromiński
University of Silesia in Katowice
2 shared publications - Małgorzata Przybyła-Kasperek
University of Silesia in Katowice, Institute of Computer Science
2 shared publications Przemysław Juszczuk
2 shared publications- Urszula Boryczka
University of Silesia in Katowice
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 17 (6)
Enhancing Genetic Algorithms Optimization Using Epigenetic-Inspired Mechanisms
JAIT is a scientific open access journal which focuses on empirical research results and critical analysis of technology development, use, management and impacts in information technology.
- 1 January 2026
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 17 (6)
Open AccessEnhancing Genetic Algorithms Optimization Using Epigenetic-Inspired Mechanisms
JAIT is a scientific open access journal which focuses on empirical research results and critical analysis of technology development, use, management and impacts in information technology.
- 11 March 2025
- Published by Springer Nature
- p. 193-207
New Approach to Learning Cyber-Security in Secondary School
- 11 March 2025
- Published by Springer Nature
- p. 193-207
New Approach to Learning Cyber-Security in Secondary School
- 28 August 2024
- Published by Springer Nature
- p. 41-54
Enhancing Focused Ant Colony Optimization for Large-Scale Traveling Salesman Problems Through Adaptive Parameter Tuning
- 28 August 2024
- Published by Springer Nature
- p. 41-54
Enhancing Focused Ant Colony Optimization for Large-Scale Traveling Salesman Problems Through Adaptive Parameter Tuning
- Top Cited Papers
- 25 February 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 120
Improving Ant Colony Optimization efficiency for solving large TSP instances
- 25 February 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 120
Top Cited PapersImproving Ant Colony Optimization efficiency for solving large TSP instances
- 1 May 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 106, 277-295
Implementing a GPU-based parallel MAX–MIN Ant System
- 1 May 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 106, 277-295
Implementing a GPU-based parallel MAX–MIN Ant System
- Open Access
A Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP
This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, each of which is an instance of the TSP. In the proposed DPSO algorithm, the information gathered while solving a sub-problem is retained in the form of a pheromone matrix and used by the algorithm while solving the next sub-problem. We present a method for automatically setting the values of the key DPSO parameters (except for the parameters directly related to the computation time and size of a problem).We show that the diversity of parameters values has a positive effect on the quality of the generated results. Furthermore, the population in the proposed algorithm has a higher level of entropy. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.
Open AccessA Self-Adaptive Discrete PSO Algorithm with Heterogeneous Parameter Values for Dynamic TSP
This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, each of which is an instance of the TSP. In the proposed DPSO algorithm, the information gathered while solving a sub-problem is retained in the form of a pheromone matrix and used by the algorithm while solving the next sub-problem. We present a method for automatically setting the values of the key DPSO parameters (except for the parameters directly related to the computation time and size of a problem).We show that the diversity of parameters values has a positive effect on the quality of the generated results. Furthermore, the population in the proposed algorithm has a higher level of entropy. We compare the performance of the proposed heterogeneous DPSO with two ant colony optimization (ACO) algorithms. The proposed algorithm outperforms the base DPSO and is competitive with the ACO.
- 8 August 2018
- Published by Springer Nature
- p. 257-267
Solving the Uncapacitated Traveling Purchaser Problem with the MAX–MIN Ant System
- 8 August 2018
- Published by Springer Nature
- p. 257-267
Solving the Uncapacitated Traveling Purchaser Problem with the MAX–MIN Ant System
- 1 October 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 86, 1-17
An improved Ant Colony System for the Sequential Ordering Problem
- 1 October 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 86, 1-17
An improved Ant Colony System for the Sequential Ordering Problem
- 7 September 2017
- Published by Springer Nature
- p. 87-96
Improving ACO Convergence with Parallel Tempering
- 7 September 2017
- Published by Springer Nature
- p. 87-96
Improving ACO Convergence with Parallel Tempering
- Open Access
- 28 July 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (22) , 7633-7648
Adjustability of a discrete particle swarm optimization for the dynamic TSP
- 28 July 2017
- Published by Springer Nature in Soft Computing
- Vol. 22 (22) , 7633-7648
Open AccessAdjustability of a discrete particle swarm optimization for the dynamic TSP