About: Heuristic is a research topic. Over the lifetime, 23100 publications have been published within this topic receiving 565299 citations. The topic is also known as: discover & heuristic function.
TL;DR: A new optimization algorithm based on the law of gravity and mass interactions is introduced and the obtained results confirm the high performance of the proposed method in solving various nonlinear functions.
TL;DR: This work presents a simple and efficient implementation of Lloyd's k-means clustering algorithm, which it calls the filtering algorithm, and establishes the practical efficiency of the algorithm's running time.
Abstract: In k-means clustering, we are given a set of n data points in d-dimensional space R/sup d/ and an integer k and the problem is to determine a set of k points in Rd, called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's (1982) algorithm. We present a simple and efficient implementation of Lloyd's k-means clustering algorithm, which we call the filtering algorithm. This algorithm is easy to implement, requiring a kd-tree as the only major data structure. We establish the practical efficiency of the filtering algorithm in two ways. First, we present a data-sensitive analysis of the algorithm's running time, which shows that the algorithm runs faster as the separation between clusters increases. Second, we present a number of empirical studies both on synthetically generated data and on real data sets from applications in color quantization, data compression, and image segmentation.
TL;DR: Fast and frugal heuristics as discussed by the authors are simple rules for making decisions with realistic mental resources and can enable both living organisms and artificial systems to make smart choices, classifications, and predictions by employing bounded rationality.
Abstract: Fast and frugal heuristics - simple rules for making decisions with realistic mental resources - are presented here. These heuristics can enable both living organisms and artificial systems to make smart choices, classifications, and predictions by employing bounded rationality. But when and how can such fast and frugal heuristics work? What heuristics are in the mind's adaptive toolbox, and what building blocks compose them? Can judgments based simply on a single reason be as accurate as those based on many reasons? Could less knowledge even lead to systematically better predictions than more knowledge? This book explores these questions by developing computational models of heuristics and testing them through experiments and analysis. It shows how fast and frugal heuristics can yield adaptive decisions in situations as varied as choosing a mate, dividing resources among offspring, predicting high school drop-out rates, and playing the stock market.
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Abstract: The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of three parts containing contributions from well-known experts. The first part covers basic VRP, known more commonly as capacitated VRP. The second part covers three main variants of VRP with time windows, backhauls, and pickup and delivery. The third part covers issues arising in real-world VRP applications and includes both case studies and references to software packages. The book will be of interest to both researchers and graduate-level students in the communities of operations research and matematical sciences. It focuses on a specific family of problems while offering a complete overview of the effective use of the most important techniques proposed for the solution of hard combinatorial problems. Practitioners will find this book particularly usef
TL;DR: Research indicates that individuals and organizations often rely on simple heuristics in an adaptive way, and ignoring part of the information can lead to more accurate judgments than weighting and adding all information, for instance for low predictability and small samples.
Abstract: As reflected in the amount of controversy, few areas in psychology have undergone such dramatic conceptual changes in the past decade as the emerging science of heuristics. Heuristics are efficient cognitive processes, conscious or unconscious, that ignore part of the information. Because using heuristics saves effort, the classical view has been that heuristic decisions imply greater errors than do “rational” decisions as defined by logic or statistical models. However, for many decisions, the assumptions of rational models are not met, and it is an empirical rather than an a priori issue how well cognitive heuristics function in an uncertain world. To answer both the descriptive question (“Which heuristics do people use in which situations?”) and the prescriptive question (“When should people rely on a given heuristic rather than a complex strategy to make better judgments?”), formal models are indispensable. We review research that tests formal models of heuristic inference, including in business organizations, health care, and legal institutions. This research indicates that (a) individuals and organizations often rely on simple heuristics in an adaptive way, and (b) ignoring part of the information can lead to more accurate judgments than weighting and adding all information, for instance for low predictability and small samples. The big future challenge is to develop a systematic theory of the building blocks of heuristics as well as the core capacities and environmental structures these exploit.