Explore the vast range of titles available.

Optimization and decision making problems in various fields of engineering have a major impact in this current era. Processing time and utilizing memory is very high for the currently available data. This is due to its size and the need for scaling from zettabyte to yottabyte. Some problems need to find solutions and there are other types of issues that need to improve their current best solution. Modelling and implementing a new heuristic algorithm may be time consuming but has some strong primary motivation - like a minimal improvement in the solution itself can reduce the computational cost. The solution thus obtained was better. In both these situations, designing heuristics and meta-heuristics algorithm has proved it’s worth. Hyper heuristic solutions will be needed to compute solutions in a much better time and space complexities. It creates a solution by combining heuristics to generate automated search space from which generalized solutions can be tuned out. This paper provides in-depth knowledge on nature-inspired computing models, meta-heuristic models, hybrid meta heuristic models and hyper heuristic model. This work’s major contribution is on building a hyper heuristics approach from a meta-heuristic algorithm for any general problem domain. Various traditional algorithms and new generation meta heuristic algorithms has also been explained for giving readers a better understanding.

Human communication is increasingly intermixed with language generated by AI. Across chat, email, and social media, AI systems suggest words, complete sentences, or produce entire conversations. AI-generated language is often not identified as such but presented as language written by humans, raising concerns about novel forms of deception and manipulation. Here, we study how humans discern whether verbal self-presentations, one of the most personal and consequential forms of language, were generated by AI. In six experiments, participants (N = 4,600) were unable to detect self-presentations generated by state-of-the-art AI language models in professional, hospitality, and dating contexts. A computational analysis of language features shows that human judgments of AI-generated language are hindered by intuitive but flawed heuristics such as associating first-person pronouns, use of contractions, or family topics with human-written language. We experimentally demonstrate that these heuristics make human judgment of AI-generated language predictable and manipulable, allowing AI systems to produce text perceived as “more human than human.” We discuss solutions, such as AI accents, to reduce the deceptive potential of language generated by AI, limiting the subversion of human intuition.

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

We recently introduced a research program on how firms can effectively capture fleeting opportunities using heuristics. Heuristics, we advocate, are the essence of strategy, especially in unpredictable markets where opportunities are often numerous, fast moving, and uncertain. Our emphasis on heuristics invites comparison with prominent research programs in cognitive psychology. We address this opportunity by comparing our \"simple rules\" heuristics approach with \"heuristics-and-biases\" and \"fast-and-frugal\" heuristics research. Collectively, the three approaches offer a rich understanding of heuristics.

Does cooperating require the inhibition of selfish urges? Or does \"rational\" self-interest constrain cooperative impulses? I investigated the role of intuition and deliberation in cooperation by meta-analyzing 67 studies in which cognitive-processing manipulations were applied to economic cooperation games (total N = 17,647; no indication of publication bias using Egger's test, Begg's test, or p-curve). My meta-analysis was guided by the social heuristics hypothesis, which proposes that intuition favors behavior that typically maximizes payoffs, whereas deliberation favors behavior that maximizes one's payoff in the current situation. Therefore, this theory predicts that deliberation will undermine pure cooperation (i.e., cooperation in settings where there are few future consequences for one's actions, such that cooperating is not in one's self-interest) but not strategic cooperation (i.e., cooperation in settings where cooperating can maximize one's payoff). As predicted, the meta-analysis revealed 17.3% more pure cooperation when intuition was promoted over deliberation, but no significant difference in strategic cooperation between more intuitive and more deliberative conditions.

The social heuristic hypothesis posits that human cooperation is an intuitive response that is expressed especially under conditions of time-constraint. Conversely, it proposes that for individuals given an opportunity for reflection, cooperation is more likely to be curtailed by an optimizing process calibrated to maximize individual benefit in a given situation. Notably, the steroid hormone testosterone has also been implicated in intuitive decision-making, including both prosocial and anti-social behaviors, with effects strongest in men with particular dispositional characteristics. This raises the possibility that increased testosterone may augment the effects predicted by the social heuristic hypothesis, particularly among men higher in specific dispositional characteristics (dominance, impulsivity, independent self-construal: high risk for testosterone-induced antisocial behavior). Here, in a testosterone administration study with a relatively large sample of men (N = 400), we test this possibility in a double-blind, placebo-controlled paradigm, with men randomly assigned to play a one-shot public goods game either under time-pressure (forced intuition) or with a time delay (forced reflection). Results revealed that within the placebo group, time-pressure (versus forced delay) increased cooperation among low risk men, but decreased cooperation among high risk men. Testosterone further moderated this pattern by abolishing the time-pressure effect in low risk men and—in high risk men—reversing the effect by selectively reducing offers (compared to placebo) under forced delay. This is the first evidence that testosterone and personality can interact with time-pressure and delay to predict human cooperation.

Design theories provide explicit prescriptions, such as principles of form and function, for constructing an artifact that is designed to meet a set of defined requirements and solve a problem. Design theory generation is increasing in importance because of the increasing number and diversity of problems that require the participation and proactive involvement of academic researchers to build and test artifact-based solutions. Heuristic search involves alternating between structuring the problem at hand and generating new artifact design components, whereas heuristic synthesis involves different ways of thinking, including reflection and learning and forms of reasoning, that complement the use of heuristics for theorizing purposes. The authors illustrate the effectiveness of our heuristic theorizing framework through a detailed example of a multiyear design science research program in which we proactively generated a design theory for solving problems in the area of intelligent information management and so-called big data in the finance domain.

This paper innovatively proposes the Black Kite Algorithm (BKA), a meta-heuristic optimization algorithm inspired by the migratory and predatory behavior of the black kite. The BKA integrates the Cauchy mutation strategy and the Leader strategy to enhance the global search capability and the convergence speed of the algorithm. This novel combination achieves a good balance between exploring global solutions and utilizing local information. Against the standard test function sets of CEC-2022 and CEC-2017, as well as other complex functions, BKA attained the best performance in 66.7, 72.4 and 77.8% of the cases, respectively. The effectiveness of the algorithm is validated through detailed convergence analysis and statistical comparisons. Moreover, its application in solving five practical engineering design problems demonstrates its practical potential in addressing constrained challenges in the real world and indicates that it has significant competitive strength in comparison with existing optimization techniques. In summary, the BKA has proven its practical value and advantages in solving a variety of complex optimization problems due to its excellent performance. The source code of BKA is publicly available at https://www.mathworks.com/matlabcentral/fileexchange/161401-black-winged-kite-algorithm-bka .

Cloud computing has emerged as the most favorable computing platform for researchers and industry. The load balanced task scheduling has emerged as an important and challenging research problem in the Cloud computing. Swarm intelligence-based meta-heuristic algorithms are considered more suitable for Cloud scheduling and load balancing. The optimization procedure of swarm intelligence-based meta-heuristics consists of two major components that are the local and global search. These algorithms find the best position through the local and global search. To achieve an optimized mapping strategy for tasks to the resources, a balance between local and global search plays an effective role. The inertia weight is an important control attribute to effectively adjust the local and global search process. There are many inertia weight strategies; however, the existing approaches still require fine-tuning to achieve optimum scheduling. The selection of a suitable inertia weight strategy is also an important factor. This paper contributed an adaptive Particle Swarm Optimisation (PSO) based task scheduling approach that reduces the task execution time, and increases throughput and Average Resource Utilization Ratio (ARUR). Moreover, an adaptive inertia weight strategy namely Linearly Descending and Adaptive Inertia Weight (LDAIW) is introduced. The proposed scheduling approach provides a better balance between local and global search leading to an optimized task scheduling. The performance of the proposed approach has been evaluated and compared against five renown PSO based inertia weight strategies concerning makespan and throughput. The experiments are then extended and compared the proposed approach against the other four renowned meta-heuristic scheduling approaches. Analysis of the simulated experimentation reveals that the proposed approach attained up to 10%, 12% and 60% improvement for makespan, throughput and ARUR respectively.

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies. The term hyper-heuristic is relatively new; it was first used in 2000 to describe heuristics to choose heuristics in the context of combinatorial optimisation. However, the idea of automating the design of heuristics is not new; it can be traced back to the 1960s. The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems. Two main hyper-heuristic categories can be considered: heuristic selection and heuristic generation. The distinguishing feature of hyper-heuristics is that they operate on a search space of heuristics (or heuristic components) rather than directly on the search space of solutions to the underlying problem that is being addressed. This paper presents a critical discussion of the scientific literature on hyper-heuristics including their origin and intellectual roots, a detailed account of the main types of approaches, and an overview of some related areas. Current research trends and directions for future research are also discussed.