Rafał Skinderowicz

Dr. Rafał Skinderowicz


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
25 February 2022 in Applied Soft Computing
Verified
Journal Article
Closed access
RSRafał Skinderowicz
Rafał Skinderowicz

1 October 2017 in Computers & Operations Research
Verified
Journal Article
Closed access
RSRafał Skinderowicz
Rafał Skinderowicz

1 December 2016 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
RSRafał Skinderowicz
Rafał Skinderowicz

1 May 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
RSRafał Skinderowicz
Rafał Skinderowicz

27 July 2019 in Entropy
Verified
Journal Article
Open access
PDF file
ŁSŁukasz Strąk
Łukasz Strąk
RSRafał Skinderowicz
Rafał Skinderowicz
Urszula Maria BoryczkaUrszula Maria Boryczka
Urszula Maria Boryczka
ANArkadiusz Nowakowski
Arkadiusz Nowakowski
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.

28 July 2017 in Soft Computing
Verified
Journal Article
Open access
PDF file
ŁSŁukasz Strąk
Łukasz Strąk
RSRafał Skinderowicz
Rafał Skinderowicz
Urszula Maria BoryczkaUrszula Maria Boryczka
Urszula Maria Boryczka
This paper presents a detailed study of the discrete particle swarm optimization algorithm (DPSO) applied to solve the dynamic traveling salesman problem which has many practical applications in planning, logistics and chip manufacturing. The dynamic version is especially important in practical applications in which new circumstances, e.g., a traffic jam or a machine failure, could force changes to the problem specification. The DPSO algorithm was enriched with a pheromone memory which is used to guide the search process similarly to the ant colony optimization algorithm. The paper extends our previous work on the DPSO algorithm in various ways. Firstly, the performance of the algorithm is thoroughly tested on a set of newly generated DTSP instances which differ in the number and the size of the changes. Secondly, the impact of the pheromone memory on the convergence of the DPSO is investigated and compared with the version without a pheromone memory. Moreover, the results are compared with two ant colony optimization algorithms, namely the \(\mathcal {MAX}\)–\(\mathcal {MIN}\) ant system (MMAS) and the population-based ant colony optimization (PACO). The results show that the DPSO is able to find high-quality solutions to the DTSP and its performance is competitive with the performance of the MMAS and the PACO algorithms. Moreover, the pheromone memory has a positive impact on the convergence of the algorithm, especially in the face of dynamic changes to the problem’s definition.