ARTICLE | doi:10.20944/preprints202102.0260.v3
Subject: Mathematics & Computer Science, Algebra & Number Theory Keywords: Feature Selection; Discrete Data; Heuristics; Running average
Online: 7 December 2021 (11:28:35 CET)
By applying a running average (with a window-size= d), we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. this optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.
ARTICLE | doi:10.20944/preprints202012.0563.v2
Subject: Mathematics & Computer Science, Artificial Intelligence & Robotics Keywords: kidney exchange; Particle Swarm; Meta-heuristics; Optimization
Online: 14 May 2021 (11:03:30 CEST)
In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.
ARTICLE | doi:10.20944/preprints201810.0755.v1
Subject: Mathematics & Computer Science, Information Technology & Data Management Keywords: digital interventions; shop floor; evaluation framework; heuristics; smart factory
Online: 1 November 2018 (17:51:49 CET)
The introduction of innovative digital tools for supporting manufacturing processes has far-reaching effects on an organizational and an individual level due to the development of Industry 4.0. The FACTS4WORKERS project funded by H2020, i.e. Worker-Centric Workplaces in Smart Factories, aims to develop user-centered assistance systems in order to demonstrate their impact and applicability at the shop floor. To do so it is important to understand how to develop such tools and how to assess if advantages can be derived from the created ICT system. This study introduces the technology of a workplace solution that is linked to a specific industrial challenge. Subsequently, a 2-stepped approach to evaluate the presented system is discussed. Heuristics, which are an output of project “Heuristics for Industry 4.0”, are used to test if the developed solution covers critical aspects of socio-technical system design. Insights into the design, development and holistic evaluation of digital tools at the shop floor should be shown.
ARTICLE | doi:10.20944/preprints202010.0605.v1
Subject: Mathematics & Computer Science, Algebra & Number Theory Keywords: Smart cities; Meta-heuristics; Travelling Salesman Problem; TLBO; Parallelism; GPU
Online: 29 October 2020 (09:34:23 CET)
The development of the smart city concept and the inhabitants’ need to reduce travel time, as well as society’s awareness of the reduction of fuel consumption and respect for the environment, lead to a new approach to the classic problem of the Travelling Salesman Problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?” Nowadays, with the development of IoT devices and the high sensoring capabilities, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the purpose is to give solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm TLBO (Teacher Learner Based Optimization). In addition, to improve performance, the solution is implemented using a parallel GPU architecture, specifically a CUDA implementation.