Transportation occupies one-third of the amount in the logistics costs, and accordingly transportation systems largely influence the performance of the logistics system. This work presents an adaptive data-driven innovative modular approach for solving the real-world vehicle routing problems (VRPs) in the field of logistics. The work consists of two basic units: (i) an innovative multistep algorithm for successful and entirely feasible solving of the VRPs in logistics and (ii) an adaptive approach for adjusting and setting up parameters and constants of the proposed algorithm. The proposed algorithm combines several data transformation approaches, heuristics, and Tabu search. Moreover, as the performance of the algorithm depends on the set of control parameters and constants, a predictive model that adaptively adjusts these parameters and constants according to historical data is proposed. A comparison of the acquired results has been made using the decision support system with predictive models: generalized linear models (GLMs) and support vector machine (SVM). The algorithm, along with the control parameters, which uses the prediction method, was acquired and was incorporated into a web-based enterprise system, which is in use in several big distribution companies in Bosnia and Herzegovina. The results of the proposed algorithm were compared with a set of benchmark instances and validated over real benchmark instances as well. The successful feasibility of the given routes, in a real environment, is also presented.

One of the frequently occurring tasks during the development of warehouse management systems is the implementation of routing algorithms of some kind. Whether it is for routing workers during order picking, delivery vehicles or company representatives, this task has proven to be challenging in the technical as well as the social sense. In other words, the task is heavily dependent on various general and company-specific constraints and it directly dictates the way employees should do their job. This paper describes a strategic approach to the development and gradual integration of such algorithms which makes sure that all constraints are satisfied and, more importantly, ensures that route suggestions are viewed by the employees as a helpful tool rather than a threat to their job. In the first part of this paper, the approach is described and evaluated on a warehouse representative routing problem through a real-world case study in a medium-to-large warehouse. In the second part, the same approach is adapted to a delivery vehicle routing problem for a smaller retailer company. In both cases, routing efficiency almost doubled in comparison to previous approaches used by the companies. The most important factors of the implementation and integration stages as well as the impact of the changes on employee satisfaction are aggregated, analysed in detail, and discussed throughout different stages of development.

The last decade was marked by rapid growth and development of technology. One example of that is the automotive industry. This industry has made an enormous progress, and its main goal is to achieve safer and better driving. The vehicle incorporates GPS devices that send information about the current location and speed of the vehicle. Large amounts of collected data can be used in companies for tracking vehicles and various analysis and statistics. Sometimes, however, GPS data is not accurate. In this paper, the potential of real data sets will be used to analyze possible anomalies that may occur when reading GPS position of vehicles. The approach for solving this problem used in this paper consists of calculating distance and time, based on GPS measurements, then calculating average speed based on these two values, and comparing that speed with the speed given by GPS device.

The purpose of the credit scoring process is the classification of the loan as default or non-default trying to reduce the risk for financial institutions. Paper aims to illustrate the implementation of a credit scoring model using boosting techniques. Specifically, the proposed solution is implemented using XGBoost algorithm discussing the role of hyperparameter tuning and feature selection in result optimization. Data used for obtaining performance scores is real-world data provided by a microfinance institution based in Bosnia and Herzegovina. Results suggest that significant optimization of XGBoost may be performed, yet, the model fails to outperform typically recommended approaches for solving credit scoring problem. Given that, it is suggested that although boosting techniques are increasingly being relied upon, it is unaccountable to make a decision without understanding the specificity of data and questioning whether other techniques are more suitable.

Paper illustrates the process of topic modeling and text classification. Specifically, the dataset used is a corpus consisting of scientific publications published by Neural Information Systems Processing Conference. Topic modeling itself is performed using Latent Dirichlet Allocation model. It is followed by optimization of a number of topics on the basis of topic coherence, a quality measure of human interpretability. Results of topic modeling are used for labeling data prior to text classification. Labels are determined based on the distribution of assigned papers' topics over time. Specifically, peak changes used for differentiating between time periods dominated by specific topics are calculated as a Kullback-Leibler divergence. Finally, transforming data into the feature vectors, several different text classification approaches are evaluated. As observed, the greatest accuracy score is recorded for the use of extreme gradient boosting classifier being 77.1%.

Vehicle Routing Problem (VRP) is the process of selection of the most favorable roads in a road network vehicle should move during the customer service, so as such, it is a generalization of problems of a commercial traveler. Most of the algorithms for successful solution of VRP problems are consisted of several controll parameters and constants, so this paper presents the data-driven prediction model for adjustment of the parameters based on historical data, especially for practical VRP problems with realistic constraints. The approach is consisted of four prediction models and decision making systems for comparing acquired results each of the used models.

A crucial part to any warehouse workflow is the process of order picking. Orders can significantly vary in the number of items, mass, volume and the total path needed to collect all the items. Some orders can be picked by just one worker, while others are required to be split up and shrunk down, so that they can be assigned to multiple workers. This paper describes the complete process of optimal order splitting. The process consists of evaluating if a given order requires to be split, determining the number of orders it needs to be split into, assigning items for every worker and optimizing the order picking routes. The complete order splitting process can be used both with and without the logistic data (mass and volume), but having logistic data improves the accuracy. Final step of the algorithm is reduction to Vehicle Routing Problem where the total number of vehicles is known beforehand. The process described in this paper is implemented in some of the largest warehouses in Bosnia and Herzegovina.

Outlier detection represents the problem of finding patterns in data that does not fit in expected behaviour. In this paper, outlier detection is done over real transactional data set of the distribution company. Outlier detection is done over time-series data, and over an ordered number of products that can be found within transactions. Unsupervised techniques and methods, S-H-ESD and LOF, are applied because data set is unlabelled. Implementation is performed in R language, and web application dashboard using R Shiny is made. Based on collected results, a proposal for creating the outlier detection and prevention system is made, and ideas for further improvements and additional analysis are given.

The identification of association rules is the problem of finding associations between different items in the same transactions. In this paper, performance comparison of different variants of Apriori, FP-Growth and ECLAT algorithms was performed over the real transactional data set of the distribution company by using R programming language and its appropriate packages, and the results obtained are later on explained. Then, the identification and visualization of the association rules of the said real data set was performed.