Journal publications






M. M. Komarnicki, M. W. Przewozniczek, H. Kwasnicka and K. Walkowiak, Incremental Recursive Ranking Grouping for Large Scale Global Optimization, IEEE Transactions on Evolutionary Computation, 2022. (in press)



M. W. Przewozniczek, M. M. Komarnicki, Empirical problem decomposition the key to the evolutionary effectiveness in solving a large-scale non-binary discrete real-world problem, Applied Soft Computing, vol. 113, 2021.



M. W. Przewozniczek, P. Dziurzanski, S. Zhao, L. S. Indrusiak, Multi-Objective Parameter-less Population Pyramid for Solving Industrial Process Planning Problems, Swarm and Evolutionary Computation, vol. 60, 2021.




M.W. Przewozniczek, M. M. Komarnicki, Empirical linkage learning, IEEE Transactions on Evolutionary Computation, vol. 24, no. 6, pp. 1097-1111, 2020.




M. W. Przewoźniczek, Subpopulation initialization driven by linkage learning for dealing with the Long-Way-To-Stuck effect, Information Sciences, vol. 521, pp. 62-80, 2020.




M. W. Przewozniczek, R. Datta, K. Walkowiak, M. Komarnicki, Splitting the fitness and penalty factor for temporal diversity increase in practical problem solving, Expert Systems With Applications, vol. 145, pp.1-11, 2020.




M.W. Przewozniczek, R, Goścień, P. Lechowicz, K. Walkowiak, Metaheuristic Algorithms with Solution Encoding Mixing for Effective Optimization of SDM Optical Networks, Engineering Applications of Artificial Intelligence, vol. 95, 2020.




P. Dziurzanski, S. Zhao, M. W. Przewoźniczek, M. M. Komarnicki, L. S. Indrusiak, Scalable distributed evolutionary algorithm orchestration using Docker containers, Journal of Computational Science, vol. 40, pp. 1-14, 2020.




M. W. Przewozniczek, R. Goścień, Universal Strategy of Dynamic Subpopulation Number Management in Practical Network Optimization Problems, Applied Soft Computing, vol. 82, pp. 1-19, 2019.




M. W. Przewozniczek, K. Walkowiak, A. Sen, M. Komarnicki, P. Lechowicz, The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application, Information Sciences, vol. 479, pp. 19, 2019.




M. W. Przewozniczek, K. Walkowiak, M. Aibin, The evolutionary cost of baldwin effect in the routing and spectrum allocation problem in elastic optical networks, Applied Soft Computing, vol. 52, no. C, pp. 843862, 2017.




M. Przewozniczek, Active Multi Population Pattern Searching Algorithm for Flow Optimization in Computer Networks the novel coevolution schema combined with linkage learning, Information Sciences, Vol. 255-256, pp. 15-36 2016.




M. Przewozniczek, R. Goscien, K. Walkowiak, M. Klinkowski, Towards Solving Practical Problems of Large Solution Space Using a Novel Pattern Searching Hybrid Evolutionary Algorithm - An Elastic Optical Network Optimization Case Study, Expert Systems with Applications, Vol. 42, pp. 7781-7796, 2015.




K. Walkowiak, M. Przewozniczek, K. Pająk, Heuristic Algorithms for Survivable P2P Multicasting, Applied Artificial Intelligence, Vol. 27, No.4, pp. 278-303, 2013.




H. Kwasnicka, M. Przewozniczek, Multi Population Pattern Searching Algorithm: a new evolutionary method based on the idea of messy Genetic Algorithm, IEEE Transactions on Evolutionary Computation, Vol. 15, No.5, pp. 715-734, 2011.




M. Przewozniczek, K. Walkowiak, M. Woźniak, Optimizing distributed computing systems for k-nearest neighbours classifiers - evolutionary approach, Logic Journal of the IGPL , Vol. 19, No.2, pp. 357-372, 2011.




K. Walkowiak, M. Przewozniczek, Modeling and optimization of survivable P2P multicasting, Computer Communications, Vol. 34, No.8, pp. 921-1042, 2011.




M. Przewoźniczek, K. Walkowiak, Quasi-hierarchical Evolution Algorithm for Flow Assignment in Survivable Connection-Oriented Networks, International Journal of Applied Mathematics and Computer Science, Vol. 16, No. 4, pp. 101-116, 2006.




M. Przewozniczek, K. Walkowiak, Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks, Lecture Notes in Computer Science, Vol. 3483, pp. 802-811, 2005.