This thesis presents findings from an online experiment aimed at evaluating individuals' attitudes towards their own cognitive biases that lead to objective mistakes. In a number of incentivized decision problems, a participant in the experiment might make a mistake and choose a dominated lottery (FOSD lottery), which is likely to result from a particular heuristic or cognitive bias. In this case, she is then confronted with her error under one of two treatments: a confrontation with an explanation only regarding the mistake or one with the addition of the supposed mechanism (bias). Following this explanation, her comfort level with her choice is measured. A bias that acted as a mechanism for the observed error could be considered advantageous (i.e., useful given alternative costs) or disadvantageous (i.e., mostly harmful) in other decision-making scenarios encountered during one's lifetime. Consequently, the perception of cognitive biases is subjective and may vary among decision makers, who may emphasize either the positive or negative aspects of such biases. The proposed methodology allows to determine whether these biases are perceived as useful rules of thumb, despite leading to a dominated lottery choice in that particular context, or unfavorable.Results revealed significant differences between the two treatments and across five different decision problems. Interestingly, the results showed that in only 60% of the cases, the participants felt uneasy about their mistakes. In the remaining instances, the participants demonstrated either indifference or a sense of comfort with their choice of a dominated lottery. The net effect of providing information on the cognitive biases that presumably lead to the mistakes, measured as the difference between treatments, revealed a negative perception of the mechanism behind the error in one problem, contentment with the mechanism for another, and no significant effect for the remaining biases.

In this study, we address the formidable challenge of solving large-scale Max-Cut problems (MCP). We introduce a rapid computational procedure utilizing a hybrid 1-flip/r-flip local search heuristic. This innovative strategy significantly reduces the computational time required for MCP problems while consistently generating solutions of exceptional quality. The paper presents substantial computational insights, showcasing the effectiveness of our approach on very-large-scale Max-Cut instances with varying densities. Our proposed heuristic is rigorously evaluated by comparing its performance against a quantum annealing solver, leveraging a multi-start Tabu Search framework. The results underscore the potency of this unique combination as an efficient and effective solution for large-scale QUBO problems. Notably, our hybrid heuristic consistently delivers high-quality solutions within the stringent CPU time limits of 600 seconds, demonstrating its efficacy across Max-Cut instances ranging from 10,000 to 40,000 variables. This research contributes to advancing the state-of-the-art in large-scale QUBO problem-solving, offering a powerful and time-efficient approach with broad applicability.

Despite the serious threat of global warming caused by carbon emissions, commercial refrigeration systems that generate cooling are unable to adjust their usage time. Therefore, it is essential to enhance the energy efficiency of refrigeration systems themselves. Recently developed refrigeration systems offer improved energy consumption efficiency, as they utilize inverter-type outdoor units that can communicate with indoor units. However, traditional legacy refrigeration systems still suffer from poor energy efficiency because the existing indoor units cannot communicate with inverter-type outdoor units. Hence, this paper introduces a heuristic energy efficiency improvement algorithm for commercial refrigeration systems using legacy indoor units when an inverter-type outdoor unit is installed. In particular, to reduce the computational complexity of the process of selecting the optimal temperature difference and target low-pressure variables that can enhance energy efficiency, the algorithm employs the Monte Carlo method. Finally, the performance of the proposed heuristic energy efficiency improvement algorithm was evaluated in a laboratory environment to confirm its applicability.

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.

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.

This work addresses the lot-sizing and production scheduling problem of multi-stage multi-product food industrial facilities. More specifically, the production scheduling problem of the semi-continuous yogurt production process, for two large-scale Greek dairy industries, is considered. Production scheduling decisions are taken using two approaches: i) an optimization and ii) a rule-based approach, followed by a comparative study. A MILP model is applied for the optimization of short-term production scheduling of the two industries. Then, the same problems are solved using the commercial scheduling tool ScheduleProTM, which derives scheduling decisions, using simulation-based techniques and empirical rules. It is concluded that both methods, despite having their advantages and disadvantages, are suitable for addressing complex food industrial scheduling problems. The optimization-based approach leads to better results in terms of operating cost reduction. On the other hand, the complexity of the problem and the experience of production engineers and plant operators can significantly impact the quality of the obtained solutions for the rule-based approach.

We present a new model formulation for a class of capacitated lot-sizing problem considering setup costs, product returns, and remanufacturing (CLSP-RM). We investigate a broad class of instances that fall into two groups, in the first group we can reformulate the problem with a relaxation and test whether the original problem is solvable. The relaxation gives near optimal solutions and the solution of this class does not give any difficulty to known solvers such as Cplex, Gurobi or Xpress. The second group of instances are of category NP and will be solved with a simple period-by-period simulation

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.

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.

The container relocation problem (CRP) is one of the important topics in container terminals, which aims to find the optimal sequence of movements to minimize the total number of relocations needed to retrieve all the containers within a bay according to a given specific layout and retrieval order. However, determining such an order may be difficult due to uncertainty. Various CRP solution methods proposed so far show a common pitfall concerning the complexity of the solving process, whose scale grows exponentially with the number of containers. Considering the retrieval operation process of the inbound containers in a bay consists of several operation rounds, this paper focuses on the real-time operation scenario of each round to minimize the actual number of relocations during the pick-up process, i.e., starting from the initial layout of the bay, we minimize the sum of the incremental number of blocking containers due to the layout change and the number of reallocated containers unrelated to the target container. We present a heuristic algorithm (called SPFH) based on the three rules (LL, MSS, and FSS), considering the adjustment of the pick-up order of containers. Numerical experiments on a set of instances generated from the literature are performed. The proposed methodology excels in both execution efficiency and solution quality and is capable of solving instances that were impossible to solve before. This also makes our methods appealing for being applied in practice. The source codes are available at https://github.com/zhou-sf/rt-scrp.

Heart disease is a global health concern of paramount importance, causing a significant number of fatalities and disabilities. Precise and timely diagnosis of heart disease is pivotal in pre-venting adverse outcomes and improving patient well-being, thereby creating a growing demand for intelligent approaches to predict heart disease effectively. This paper introduces an Ensemble Heuristic-Metaheuristic Feature Fusion Learning (EHMFFL) algorithm for heart disease diagnosis. Within the EHMFFL algorithm, a diverse ensemble learning model is crafted, featuring different feature subsets for each heterogeneous base learner, including support vector machine, K-nearest neighbors, logistic regression, random forest, naive bayes, decision tree, and XGBoost. The primary objective is to identify the most pertinent features for each base learner, leveraging a combined heuristic-metaheuristic approach that integrates the heuristic knowledge of Pearson correlation coefficient with the metaheuristic-driven grey wolf optimizer. The second objective is to aggregate the decision outcomes of the various base learners through ensemble learning, aimed at constructing a robust prediction model. The performance of the EHMFFL algorithm is rigorously assessed using the Cleveland and Statlog datasets yielding remarkable results with an accuracy of 91.8% and 88.9%, respectively, surpassing state-of-the-art machine learning, ensemble learning, and feature selection techniques in heart disease diagnosis. These findings underscore the potential of the EHMFFL algorithm in enhancing diagnostic accuracy for heart disease and providing valuable support to clinicians in making more informed decisions regarding patient care.