Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Rafał Skinderowicz"'
Publikováno v:
Entropy, Vol 21, Iss 8, p 738 (2019)
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, eac
Externí odkaz:
https://doaj.org/article/433dcce6b8ed4d1b87a084b141de9f6c
Autor:
Rafał Skinderowicz
Ant Colony Optimization (ACO) is a family of nature-inspired metaheuristics often applied to finding approximate solutions to difficult optimization problems. Despite being significantly faster than exact methods, the ACOs can still be prohibitively
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ce91b32631c8941c3dce1f320af019c
http://arxiv.org/abs/2203.02228
http://arxiv.org/abs/2203.02228
Autor:
Rafał Skinderowicz
The MAX–MIN Ant System (MMAS) is one of the best-known Ant Colony Optimization (ACO) algorithms proven to be efficient at finding satisfactory solutions to many difficult combinatorial optimization problems. The slow-down in Moore’s law, and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::046701b70cb124015ad4a17ee1957d2b
http://arxiv.org/abs/2003.11902
http://arxiv.org/abs/2003.11902
Autor:
Rafał Skinderowicz
Publikováno v:
Computers & Operations Research. 86:1-17
It is not rare that the performance of one metaheuristic algorithm can be improved by incorporating ideas taken from another. In this article we present how Simulated Annealing (SA) can be used to improve the efficiency of the Ant Colony System (ACS)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::148e83494acc91760c346b3bc6e5d629
https://doi.org/10.1016/j.cor.2017.04.012
https://doi.org/10.1016/j.cor.2017.04.012
Publikováno v:
Soft Computing. 22:7633-7648
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e7048985506af7256eddb88c635171b
https://doi.org/10.1007/s00500-017-2738-9
https://doi.org/10.1007/s00500-017-2738-9
Publikováno v:
Entropy, Vol 21, Iss 8, p 738 (2019)
Entropy
Volume 21
Issue 8
Entropy
Volume 21
Issue 8
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, eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c64676f0a1a87d62849ed4ef5a455e0
https://www.mdpi.com/1099-4300/21/8/738
https://www.mdpi.com/1099-4300/21/8/738
Autor:
Rafał Skinderowicz
Publikováno v:
Journal of Parallel and Distributed Computing. 98:48-60
The Ant Colony System (ACS) is, next to Ant Colony Optimization (ACO) and the MAX–MIN Ant System (MMAS), one of the most efficient metaheuristic algorithms inspired by the behavior of ants. In this article we present three novel parallel versions o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5666514fd609f7e8f9cc020826759e45
https://doi.org/10.1016/j.jpdc.2016.04.014
https://doi.org/10.1016/j.jpdc.2016.04.014
Autor:
Rafał Skinderowicz
Publikováno v:
Computational Collective Intelligence ISBN: 9783319984452
ICCCI (2)
ICCCI (2)
The Traveling Purchaser Problem (TPP) is a generalization of the Traveling Salesman Problem that can be used to model various real-world applications. Several exact and heuristic approaches were proposed to solving the TPP (and its variants) in recen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a59ea83ac741e916984dc853de224341
https://doi.org/10.1007/978-3-319-98446-9_24
https://doi.org/10.1007/978-3-319-98446-9_24
Autor:
Rafał Skinderowicz
Publikováno v:
Computational Collective Intelligence ISBN: 9783319670768
ICCCI (2)
ICCCI (2)
Parallel Tempering (PT) is an efficient Monte Carlo simulation method known from statistical physics. We present a novel PT-based Ant Colony Optimization algorithm (PTACO) in which multiple replicas of the Ant Colony System enhanced with a temperatur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c47fbf4085aae424930ba70c9a63a17
https://doi.org/10.1007/978-3-319-67077-5_9
https://doi.org/10.1007/978-3-319-67077-5_9
Publikováno v:
ICGA Journal. 37:187-190
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::828979dde2da2823efc958903bf51c00
https://doi.org/10.3233/icg-2014-37311
https://doi.org/10.3233/icg-2014-37311