Michał Okulewicz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Michał Okulewicz has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Jacek Mańdziuk
Warsaw University of Technology
6 shared publications - Mateusz Zaborski
Warsaw University of Technology
2 shared publications - Pawel D. Domanski
Institute of Control and Computation Engineering, Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
2 shared publications - Szymon Cyperski
Control System Software Sp. z o.o., ul. Rzemieślnicza 7, 81-855 Sopot, Poland
2 shared publications - Adam Żychowski
Warsaw University of Technology
1 shared publication Bartłomiej Dach
Faculty of Mathematics and Information Science Warsaw University of Technology
1 shared publication
Latest Publications
- Open Access
- 2 January 2024
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 15 (5) , 614-621
On Cost Estimation of the Full Truckload Contracts
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.
- 2 January 2024
- Published by Engineering and Technology Publishing in Journal of Advances in Information Technology
- Vol. 15 (5) , 614-621
Open AccessOn Cost Estimation of the Full Truckload Contracts
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.
- Open Access
- 27 July 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (8) , 360
Hybrid Approach to the Cost Estimation of External-Fleet Full Truckload Contracts
Freight forwarding and transportation are the backbone of the modern economy. There are thousands of transportation companies on the market whose sole purpose is to deliver ordered goods from pickup to delivery. Transportation can be carried out by two types of fleets. A company can have its own trucks, or it can use third-party companies. This transportation can be carried out in a variety of formulas, with full truckload being the most common for long routes. The shipper must be aware of the potential cost of such a service during the process of selecting a particular transport. The presented solution addresses this exact issue. There are many approaches, ranging from detailed cost calculators to machine learning solutions. The present study uses a dedicated hybrid algorithm that combines different techniques, spanning clustering algorithms, regression and kNN (k Nearest Neighbors) estimators. The resulting solution was tested on real shipping data covering multi-year contract data from several shipping companies operating in the European market. The obtained results proved so successful that they were implemented in a commercial solution used by freight forwarding companies on a daily basis.
- 27 July 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (8) , 360
Open AccessHybrid Approach to the Cost Estimation of External-Fleet Full Truckload Contracts
Freight forwarding and transportation are the backbone of the modern economy. There are thousands of transportation companies on the market whose sole purpose is to deliver ordered goods from pickup to delivery. Transportation can be carried out by two types of fleets. A company can have its own trucks, or it can use third-party companies. This transportation can be carried out in a variety of formulas, with full truckload being the most common for long routes. The shipper must be aware of the potential cost of such a service during the process of selecting a particular transport. The presented solution addresses this exact issue. There are many approaches, ranging from detailed cost calculators to machine learning solutions. The present study uses a dedicated hybrid algorithm that combines different techniques, spanning clustering algorithms, regression and kNN (k Nearest Neighbors) estimators. The resulting solution was tested on real shipping data covering multi-year contract data from several shipping companies operating in the European market. The obtained results proved so successful that they were implemented in a commercial solution used by freight forwarding companies on a daily basis.
- 21 October 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Self-Adapting Particle Swarm Optimization for continuous black box optimization
- 21 October 2022
- Published by Elsevier in Applied Soft Computing
- Vol. 131
Self-Adapting Particle Swarm Optimization for continuous black box optimization
- Open Access
Generalized Self-Adapting Particle Swarm Optimization algorithm with archive of samples
In this paper we enhance Generalized Self-Adapting Particle Swarm Optimization algorithm (GAPSO), initially introduced at the Parallel Problem Solving from Nature 2018 conference, and to investigate its properties. The research on GAPSO is underlined by the two following assumptions: (1) it is possible to achieve good performance of an optimization algorithm through utilization of all of the gathered samples, (2) the best performance can be accomplished by means of a combination of specialized sampling behaviors (Particle Swarm Optimization, Differential Evolution, and locally fitted square functions). From a software engineering point of view, GAPSO considers a standard Particle Swarm Optimization algorithm as an ideal starting point for creating a generalpurpose global optimization framework. Within this framework hybrid optimization algorithms are developed, and various additional techniques (like algorithm restart management or adaptation schemes) are tested. The paper introduces a new version of the algorithm, abbreviated as M-GAPSO. In comparison with the original GAPSO formulation it includes the following four features: a global restart management scheme, samples gathering within an R-Tree based index (archive/memory of samples), adaptation of a sampling behavior based on a global particle performance, and a specific approach to local search. The above-mentioned enhancements resulted in improved performance of M-GAPSO over GAPSO, observed on both COCO BBOB testbed and in the black-box optimization competition BBComp. Also, for lower dimensionality functions (up to 5D) results of M-GAPSO are better or comparable to the state-of-the art version of CMA-ES (namely the KL-BIPOP-CMA-ES algorithm presented at the GECCO 2017 conference).
Open AccessGeneralized Self-Adapting Particle Swarm Optimization algorithm with archive of samples
In this paper we enhance Generalized Self-Adapting Particle Swarm Optimization algorithm (GAPSO), initially introduced at the Parallel Problem Solving from Nature 2018 conference, and to investigate its properties. The research on GAPSO is underlined by the two following assumptions: (1) it is possible to achieve good performance of an optimization algorithm through utilization of all of the gathered samples, (2) the best performance can be accomplished by means of a combination of specialized sampling behaviors (Particle Swarm Optimization, Differential Evolution, and locally fitted square functions). From a software engineering point of view, GAPSO considers a standard Particle Swarm Optimization algorithm as an ideal starting point for creating a generalpurpose global optimization framework. Within this framework hybrid optimization algorithms are developed, and various additional techniques (like algorithm restart management or adaptation schemes) are tested. The paper introduces a new version of the algorithm, abbreviated as M-GAPSO. In comparison with the original GAPSO formulation it includes the following four features: a global restart management scheme, samples gathering within an R-Tree based index (archive/memory of samples), adaptation of a sampling behavior based on a global particle performance, and a specific approach to local search. The above-mentioned enhancements resulted in improved performance of M-GAPSO over GAPSO, observed on both COCO BBOB testbed and in the black-box optimization competition BBComp. Also, for lower dimensionality functions (up to 5D) results of M-GAPSO are better or comparable to the state-of-the art version of CMA-ES (namely the KL-BIPOP-CMA-ES algorithm presented at the GECCO 2017 conference).
- 1 August 2019
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 48, 44-61
A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space
- 1 August 2019
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 48, 44-61
A metaheuristic approach to solve Dynamic Vehicle Routing Problem in continuous search space
- Open Access
Bringing Together Project Simulation and Psychometric Tests: A Business Game Proposal
This article identifies a gap between the existence of a various psychometric tests approaches and other team performance assessment tools (e.g. business and management games). As a response to the lack of tools able to utilize the knowledge about the behaviour patterns expressed in work environment and descriptive business games, the article presents a game proposal. The mechanics of the proposed game should allow for a quantifiable assessment of an individual in the simulated project development environment, making it possible to evaluate not only the team's performance, but the impact of actions of the individual players and their interactions.
Open AccessBringing Together Project Simulation and Psychometric Tests: A Business Game Proposal
This article identifies a gap between the existence of a various psychometric tests approaches and other team performance assessment tools (e.g. business and management games). As a response to the lack of tools able to utilize the knowledge about the behaviour patterns expressed in work environment and descriptive business games, the article presents a game proposal. The mechanics of the proposed game should allow for a quantifiable assessment of an individual in the simulated project development environment, making it possible to evaluate not only the team's performance, but the impact of actions of the individual players and their interactions.
- 22 August 2018
- Published by Springer Nature
- p. 29-40
Generalized Self-adapting Particle Swarm Optimization Algorithm
- 22 August 2018
- Published by Springer Nature
- p. 29-40
Generalized Self-adapting Particle Swarm Optimization Algorithm
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
2-Dimensional rectangles-in-circles packing and stock cutting with particle swarm optimization
This article aims at closing a gap between the research on solving theoretical packing and stock cutting problems and the research on strictly practical aspects of timber sawing. In order to do that, the article proposes a simple model of a timber log and its sawing procedure, solves a set of packing and stock cutting problems with the usage of a Particle Swarm Optimization based algorithm, and promotes a publicly available benchmark data set for the solved problem. In this article a problem of packing a set of rectangular shapes into a circular containers is formulated and solved with the usage of Particle Swarm Optimization algorithm, one-dimensional solutions dictionary and a greedy insertion heuristic for two-dimensional problem. The optimization problem is motivated by the sawn timber production and models the process of cutting out a stock of sawn timber out of the sets of tree logs. Proposed algorithm provides results of a stable quality with a reasonably high yield (low material waste). Quality of results obtained for different user parameter settings gives also some insight about the trade-off between the value of produced stock, material loss, number of created product types and possible production process costs (which are related to the number of allowed rotations of the input source material).
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
2-Dimensional rectangles-in-circles packing and stock cutting with particle swarm optimization
This article aims at closing a gap between the research on solving theoretical packing and stock cutting problems and the research on strictly practical aspects of timber sawing. In order to do that, the article proposes a simple model of a timber log and its sawing procedure, solves a set of packing and stock cutting problems with the usage of a Particle Swarm Optimization based algorithm, and promotes a publicly available benchmark data set for the solved problem. In this article a problem of packing a set of rectangular shapes into a circular containers is formulated and solved with the usage of Particle Swarm Optimization algorithm, one-dimensional solutions dictionary and a greedy insertion heuristic for two-dimensional problem. The optimization problem is motivated by the sawn timber production and models the process of cutting out a stock of sawn timber out of the sets of tree logs. Proposed algorithm provides results of a stable quality with a reasonably high yield (low material waste). Quality of results obtained for different user parameter settings gives also some insight about the trade-off between the value of produced stock, material loss, number of created product types and possible production process costs (which are related to the number of allowed rotations of the input source material).
- 1 September 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 58, 586-604
The impact of particular components of the PSO-based algorithm solving the Dynamic Vehicle Routing Problem
- 1 September 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 58, 586-604
The impact of particular components of the PSO-based algorithm solving the Dynamic Vehicle Routing Problem
- 2 October 2016
- Published by Polish Information Processing Society PTI
- Vol. 9, 205-210
Finding an Optimal Team
- 2 October 2016
- Published by Polish Information Processing Society PTI
- Vol. 9, 205-210
Finding an Optimal Team