Log in

Relevant bibliographies by topics / Heuristic research / Journal articles

To see the other types of publications on this topic, follow the link: Heuristic research.

Journal articles on the topic 'Heuristic research'

Author: Grafiati

Published: 4 June 2021

Last updated: 6 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Heuristic research.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Hyatt, Robert P. "Heuristic Research." Tradition and Discovery: The Polanyi Society Periodical 38, no. 3 (2011): 71–74. http://dx.doi.org/10.5840/traddisc2011/201238329.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Liang, Rui Shi, and Min Huang. "Heuristics for Domain-Independent Planning: A Survey." Applied Mechanics and Materials 135-136 (October 2011): 573–77. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.573.

Full text

Abstract:

Increasing interest has been devoted to Planning as Heuristic Search over the years. Intense research has focused on deriving fast and accurate heuristics for domain-independent planning. This paper reports on an extensive survey and analysis of research work related to heuristic derivation techniques for state space search. Survey results reveal that heuristic techniques have been extensively applied in many efficient planners and result in impressive performances. We extend the survey analysis to suggest promising avenues for future research in heuristic derivation and heuristic search techn

APA, Harvard, Vancouver, ISO, and other styles

3

Savolainen, Reijo. "Heuristics elements of information-seeking strategies and tactics: a conceptual analysis." Journal of Documentation 73, no. 6 (October 9, 2017): 1322–42. http://dx.doi.org/10.1108/jd-11-2016-0144.

Full text

Abstract:

Purpose The purpose of this paper is to elaborate the picture of strategies and tactics for information seeking and searching by focusing on the heuristic elements of such strategies and tactics. Design/methodology/approach A conceptual analysis of a sample of 31 pertinent investigations was conducted to find out how researchers have approached heuristics in the above context since the 1970s. To achieve this, the study draws on the ideas produced within the research programmes on Heuristics and Biases, and Fast and Frugal Heuristics. Findings Researchers have approached the heuristic elements

APA, Harvard, Vancouver, ISO, and other styles

4

Wilt, Christopher, and Wheeler Ruml. "Effective Heuristics for Suboptimal Best-First Search." Journal of Artificial Intelligence Research 57 (October 31, 2016): 273–306. http://dx.doi.org/10.1613/jair.5036.

Full text

Abstract:

Suboptimal heuristic search algorithms such as weighted A* and greedy best-first search are widely used to solve problems for which guaranteed optimal solutions are too expensive to obtain. These algorithms crucially rely on a heuristic function to guide their search. However, most research on building heuristics addresses optimal solving. In this paper, we illustrate how established wisdom for constructing heuristics for optimal search can fail when considering suboptimal search. We consider the behavior of greedy best-first search in detail and we test several hypotheses for predicting when

APA, Harvard, Vancouver, ISO, and other styles

5

Shanklin, Roslyn, Philip Kortum, and Claudia Ziegler Acemyan. "Adaptation of Heuristic Evaluations for the Physical Environment." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 64, no. 1 (December 2020): 1135–39. http://dx.doi.org/10.1177/1071181320641272.

Full text

Abstract:

Previous work has investigated the need for domain specific heuristics. Nielsen’s ten heuristics offer a general list of principles, but those principles may not capture usability issues specific to a given interface. Studies have demonstrated methods to establish a domain specific heuristic set, but very little research has been conducted on interfaces in the physical environment, creating a gap in the state-of-the-art. The research described in this paper aims to address this gap by developing an environmental heuristic set; the heuristic set was developed specifically for the Houston light

APA, Harvard, Vancouver, ISO, and other styles

6

Ursani, Ziauddin, and David W. Corne. "Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem." Journal of Optimization 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/4786268.

Full text

Abstract:

In this paper, complexity curtailing techniques are introduced to create faster version of insertion heuristics, that is, cheapest insertion heuristic (CIH) and largest insertion heuristic (LIH), effectively reducing their complexities fromO(n3)toO(n2)with no significant effect on quality of solution. This paper also examines relatively not very known heuristic concept of max difference and shows that it can be culminated into a full-fledged max difference insertion heuristic (MDIH) by defining its missing steps. Further to this the paper extends the complexity curtailing techniques to MDIH to

APA, Harvard, Vancouver, ISO, and other styles

7

Özcan, Ender, Mustafa Misir, Gabriela Ochoa, and Edmund K. Burke. "A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling." International Journal of Applied Metaheuristic Computing 1, no. 1 (January 2010): 39–59. http://dx.doi.org/10.4018/jamc.2010102603.

Full text

Abstract:

Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selection and move acceptance) until a set of termination criteria is satisfied. A motivating goal of hyper-heuristic research is to create automated techniques that are applicable to a wide range of problems wi

APA, Harvard, Vancouver, ISO, and other styles

8

Drake, John H., Matthew Hyde, Khaled Ibrahim, and Ender Ozcan. "A genetic programming hyper-heuristic for the multidimensional knapsack problem." Kybernetes 43, no. 9/10 (November 3, 2014): 1500–1511. http://dx.doi.org/10.1108/k-09-2013-0201.

Full text

Abstract:

Purpose – Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions. The purpose of this paper is to investigate the suitability of using genetic programming as a hyper-heuristic methodology to generate constructive heuristics to solve the multidimensional 0-1 knapsack problem Design/methodology/approach – Early hyper-heuristics focused on selecting and applying a low-level heuristic at each stage of a search. Recent trends in hyper-heuristic research have led to a number of approaches being de

APA, Harvard, Vancouver, ISO, and other styles

9

HIGGINS, A. J. "A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS." Asia-Pacific Journal of Operational Research 22, no. 02 (June 2005): 171–88. http://dx.doi.org/10.1142/s0217595905000492.

Full text

Abstract:

This article presents a new heuristic for generalized assignment problems with a very large number of jobs. The heuristic applies a probabilistic acceptance of a move, based on a percentile threshold, using information from recent moves. This percentile search heuristic (PSH) is compared to tabu search, simulated annealing, and threshold accepting using a rigorous computational experimentation with randomly generated problem instances of up to 50,000 jobs and 40 agents. The PSH did find the best solution among the heuristics for 45% of the instances, particularly larger size problems, versus 3

APA, Harvard, Vancouver, ISO, and other styles

10

Goldenberg, Meir. "The Heuristic Search Research Framework." Knowledge-Based Systems 129 (August 2017): 1–3. http://dx.doi.org/10.1016/j.knosys.2017.05.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Pham, V. H., M. Martinez, and J. Favrel. "Assembly Sequence Generation - Heuristic Research." IFAC Proceedings Volumes 31, no. 31 (November 1998): 139–44. http://dx.doi.org/10.1016/s1474-6670(17)41018-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Fortunato, David, and Randolph T. Stevenson. "Heuristics in Context." Political Science Research and Methods 7, no. 2 (October 17, 2016): 311–30. http://dx.doi.org/10.1017/psrm.2016.37.

Full text

Abstract:

A growing literature in political science has pointed to the importance of heuristics in explaining citizens’ political attitudes, beliefs, and behaviors. At the same time, the multidisciplinary research on heuristics in general has revealed that individuals seem to use heuristics sensibly—applying them (perhaps subconsciously) when they are likely to be helpful but not otherwise. We extend this multidisciplinary work to political behavior and present a general theory of contextual variation in political heuristic use applied to discover under what conditions (i.e., what political contexts) vo

APA, Harvard, Vancouver, ISO, and other styles

13

Ericson, Keith Marzilli, and Amanda Starc. "Heuristics and Heterogeneity in Health Insurance Exchanges: Evidence from the Massachusetts Connector." American Economic Review 102, no. 3 (May 1, 2012): 493–97. http://dx.doi.org/10.1257/aer.102.3.493.

Full text

Abstract:

We examine heuristic decision rules in consumer choice on health insurance exchanges using data from the Massachusetts Connector. Consumers may have difficulty making optimal choices in a complex environment. The heuristic “choose the cheapest plan” is suggested by the decision context, previous research, and the data: about 20% of enrollees choose the cheapest plan possible. We find evidence of this heuristic in many models, but while heuristics may play a role, preference heterogeneity is also important. Our most flexible models find an insignificant heuristic effect. In part because holding

APA, Harvard, Vancouver, ISO, and other styles

14

Rott, Benjamin. "Rethinking heuristics – characterizations and vignettes." Lumat: International Journal of Math, Science and Technology Education 3, no. 1 (February 28, 2015): 122–26. http://dx.doi.org/10.31129/lumat.v3i1.1055.

Full text

Abstract:

The concept of “heuristics” or “heuristic strategies” is central to (mathematical) problem solving and related research; however, there is no generally accepted definition of this term. Trying to clarify the concept might help avoiding misunderstandings and difficulties in dealing with studies that use different terms meaning the same concepts or that use the same terms meaning different concepts. Therefore, the research presented in this paper aims at a clarification of the term “heuristics” and suggestions for the use of it in future research. Building on previous work from last year’s ProMa

APA, Harvard, Vancouver, ISO, and other styles

15

Štukelj, Gašper. "On the simplicity of simple heuristics." Adaptive Behavior 28, no. 4 (August 6, 2019): 261–71. http://dx.doi.org/10.1177/1059712319861589.

Full text

Abstract:

Recent evidence suggests that the take-the-best heuristic—flagship of “fast and frugal heuristics” research program—might in fact not be as frugal as tallying, which is considered to be a more complex strategy. Characterizing a simple decision strategy has always seemed straightforward, and the debate around the simplicity of the take-the-best heuristic is mostly concerned with a proper specification of the heuristic. I argue that the predominate conceptions of “simplicity” and “frugality” need to be revised. To this end, a number of recent behavioral and neuroscientific results are discussed.

APA, Harvard, Vancouver, ISO, and other styles

16

Lohmüller, Valentin, Daniel Schmaderer, and Christian Wolff. "A Heuristic Checklist for Second Screen Applications." i-com 18, no. 1 (April 26, 2019): 55–65. http://dx.doi.org/10.1515/icom-2019-0003.

Full text

Abstract:

Abstract This paper presents domain-specific heuristics for second screen applications and the development of a heuristics checklist to enable a more intuitive and structured application of the created heuristics. The heuristics presented were developed on the basis of Nielsen [12] Ten Usability Heuristics in a research-based approach using specific literature and a focus group. In order to evaluate the quality of the derived checklist, a heuristic evaluation of a second screen application with five users was carried out and its results compared to a user study with 20 participants. This resul

APA, Harvard, Vancouver, ISO, and other styles

17

Jasper, Fabian, and Tuulia M. Ortner. "The Tendency to Fall for Distracting Information While Making Judgments." European Journal of Psychological Assessment 30, no. 3 (January 1, 2014): 193–207. http://dx.doi.org/10.1027/1015-5759/a000214.

Full text

Abstract:

Despite much research on thinking biases such as the representativeness, availability, and anchoring heuristics, a psychometrically sound measurement instrument for assessing the degree of heuristic thinking is still missing. Therefore, it was the goal of this study to develop and validate a new test to assess the degree of heuristic thinking associated with three particular thinking heuristics (i.e., the representativeness, availability, and anchoring heuristics). The resulting Objective Heuristic Thinking Test (OHTT) was evaluated with regard to its internal consistency, factor structure, co

APA, Harvard, Vancouver, ISO, and other styles

18

Shevlin, Henry. "General Intelligence: An Ecumenical Heuristic for Artificial Consciousness Research?" Journal of Artificial Intelligence and Consciousness 07, no. 02 (July 27, 2020): 245–56. http://dx.doi.org/10.1142/s2705078520500149.

Full text

Abstract:

The science of consciousness has made great strides in recent decades. However, the proliferation of competing theories makes it difficult to reach consensus about artificial consciousness. While for purely scientific purposes we might wish to adopt a ‘wait and see’ attitude, we may soon face practical and ethical questions about whether, for example, agents artificial systems are capable of suffering. Moreover, many of the methods used for assessing consciousness in humans and even non-human animals are not straightforwardly applicable to artificial systems. With these challenges in mind, I p

APA, Harvard, Vancouver, ISO, and other styles

19

Weis, Patrick P., and Eva Wiese. "Speed Considerations Can Be of Little Concern When Outsourcing Thought to External Devices." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 62, no. 1 (September 2018): 14–18. http://dx.doi.org/10.1177/1541931218621004.

Full text

Abstract:

Most research on human cognition has focused on processes “inside the box”. Recently, researchers questioned this monopoly, promoting the relevance of cognitive processing “outside the box”, for instance, when using a GPS to navigate. For processing that is distributed between internal and external resources to work efficiently, humans need good heuristics that help them decide when to use which resource. A novel human-computer-interaction paradigm was employed to explore whether people follow the “minimal memory” heuristic and offload cognitive processing onto external resources whenever poss

APA, Harvard, Vancouver, ISO, and other styles

20

West, Todd, John Sessions, and Bogdan M. Strimbu. "Heuristic Optimization of Thinning Individual Douglas-Fir." Forests 12, no. 3 (February 28, 2021): 280. http://dx.doi.org/10.3390/f12030280.

Full text

Abstract:

Research Highlights: (1) Optimizing mid-rotation thinning increased modeled land expectation values by as much as 5.1–10.1% over a representative reference prescription on plots planted at 2.7 and 3.7 m square spacings. (2) Eight heuristics, five of which were newly applied to selecting individual trees for thinning, produced thinning prescriptions of near identical quality. (3) Based on heuristic sampling properties, we introduced a variant of the hero heuristic with a 5.3–20% greater computational efficiency. Background and Objectives: Thinning, which is arguably the most subjective human in

APA, Harvard, Vancouver, ISO, and other styles

21

Ríos-Mercado, Roger Z. "Special issue of the Journal of Heuristics on “Heuristic Research: Advances and Applications”." Journal of Heuristics 15, no. 2 (June 20, 2008): 105–7. http://dx.doi.org/10.1007/s10732-008-9086-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Cavarretta, Fabrice L. "On the hard problem of selecting bundles of rules: a conceptual exploration of heuristic emergence processes." Management Decision 59, no. 7 (May 10, 2021): 1598–616. http://dx.doi.org/10.1108/md-09-2019-1322.

Full text

Abstract:

PurposeSo far, the simplicity of heuristics has been mostly studied at the rule level. However, actors' bounded rationality implies that small bundles of rules drive behavior. This study thus conducts a conceptual elaboration around such bundling. This leads to reflections on the various processes of heuristic emergence and to qualifications of the respective characteristics of basic heuristic classes.Design/methodology/approachDetermining which rules – out of many possible ones – to select in one's small bundle constitutes a difficult combinatorial problem. Fortunately, past research has demo

APA, Harvard, Vancouver, ISO, and other styles

23

Hanafi, Saïd, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, and Igor Crévits. "New variable neighbourhood search based 0-1 MIP heuristics." Yugoslav Journal of Operations Research 25, no. 3 (2015): 343–60. http://dx.doi.org/10.2298/yjor140219014h.

Full text

Abstract:

In recent years many so-called matheuristics have been proposed for solving Mixed Integer Programming (MIP) problems. Though most of them are very efficient, they do not all theoretically converge to an optimal solution. In this paper we suggest two matheuristics, based on the variable neighbourhood decomposition search (VNDS), and we prove their convergence. Our approach is computationally competitive with the current state-of-the-art heuristics, and on a standard benchmark of 59 0-1 MIP instances, our best heuristic achieves similar solution quality to that of a recently published VNDS heuri

APA, Harvard, Vancouver, ISO, and other styles

24

Knappertsbusch, Felix. "“Fractal Heuristics” for Mixed Methods Research: Applying Abbott’s “Fractal Distinctions” as a Conceptual Metaphor for Method Integration." Journal of Mixed Methods Research 14, no. 4 (December 19, 2019): 456–72. http://dx.doi.org/10.1177/1558689819893573.

Full text

Abstract:

With the interest in advancing integration in the field of mixed methods research (MMR), researchers need powerful metaphors for conceiving and implementing mixing strategies. This article contributes to the field of MMR by showing how Abbott’s “fractal distinctions” provide a valuable heuristic for the application of method combinations as well as the methodological reflection of MMR. Based on its core notion, the “self-similarity” of methods approaches, I propose three heuristic guidelines: (a) deliberately seek out qualitative aspects in quantitative methods (and vice versa); (b) assume a n

APA, Harvard, Vancouver, ISO, and other styles

25

Burke, Edmund K., Matthew R. Hyde, Graham Kendall, and John Woodward. "Automating the Packing Heuristic Design Process with Genetic Programming." Evolutionary Computation 20, no. 1 (March 2012): 63–89. http://dx.doi.org/10.1162/evco_a_00044.

Full text

Abstract:

The literature shows that one-, two-, and three-dimensional bin packing and knapsack packing are difficult problems in operational research. Many techniques, including exact, heuristic, and metaheuristic approaches, have been investigated to solve these problems and it is often not clear which method to use when presented with a new instance. This paper presents an approach which is motivated by the goal of building computer systems which can design heuristic methods. The overall aim is to explore the possibilities for automating the heuristic design process. We present a genetic programming s

APA, Harvard, Vancouver, ISO, and other styles

26

VALENTE, JORGE M. S. "BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS." Asia-Pacific Journal of Operational Research 26, no. 03 (June 2009): 319–39. http://dx.doi.org/10.1142/s0217595909002225.

Full text

Abstract:

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Several dispatching rules are considered as evaluation functions, to analyze the effect of different rules on the effectiveness of the beam search algorithms. The computational results show that using better rules improves the performance of the beam search heuristics. The detailed

APA, Harvard, Vancouver, ISO, and other styles

27

Van Allen, Eliezer Mendel, Nikhil Wagle, Gregory Kryukov, Alexis Ramos, Gad Getz, and Levi A. Garraway. "A heuristic platform for clinical interpretation of cancer genome sequencing data." Journal of Clinical Oncology 30, no. 15_suppl (May 20, 2012): 10502. http://dx.doi.org/10.1200/jco.2012.30.15_suppl.10502.

Full text

Abstract:

10502 Background: The ability to identify and effectively sort the full spectrum of biologically and therapeutically relevant genetic alterations identified by massively parallel sequencing may improve cancer care. A major challenge involves rapid and rational categorization of data-intensive output, including somatic mutations, insertions/deletions, copy number alterations, and rearrangements into ranked categories for clinician review. Methods: A database of clinically actionable alterations was created, consisting of over 100 annotated genes known to undergo somatic genomic alterations in c

APA, Harvard, Vancouver, ISO, and other styles

28

Alquhayz, Hani, and Mahdi Jemmali. "Max-Min Processors Scheduling." Information Technology and Control 50, no. 1 (March 25, 2021): 5–12. http://dx.doi.org/10.5755/j01.itc.50.1.25531.

Full text

Abstract:

This paper focuses on the maximization of the minimum completion time on identical parallel processors. The objective of this maximization is to ensure fair distribution. Let a set of jobs to be assigned to several identical parallel processors. This problem is shown as NP-hard. The research work of this paper is based essentially on the comparison of the proposed heuristics with others cited in the literature review. Our heuristics are developed using essentially the randomization method and the iterative utilization of the knapsack problem to solve the studied problem. Heuristics are assesse

APA, Harvard, Vancouver, ISO, and other styles

29

Han, Ai Li. "Complexity Research on B Algorithm." Applied Mechanics and Materials 20-23 (January 2010): 173–77. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.173.

Full text

Abstract:

The time complexity of B algorithm, one of the intelligent search algorithms, is discussed. By anatomizing some instances, it is pointed out that the cost of calculating the value of heuristic function should be included in the range of time complexity analysis for B algorithm. And then, an algorithm of calculating the value of heuristic function is presented. By analyzing the cost of calculating the value of heuristic function, it is pointed out that the number of recursions in B algorithm is O(n!) in the worst case. Therefore, the time complexity of B algorithm is exponential instead of O(n2

APA, Harvard, Vancouver, ISO, and other styles

30

Tarraq, Ali, Faissal Elmariami, Aziz Belfqih, and Touria Haidi. "Meta-heuristic optimization methods applied to renewable distributed generation planning: A review." E3S Web of Conferences 234 (2021): 00086. http://dx.doi.org/10.1051/e3sconf/202123400086.

Full text

Abstract:

Due to its proven efficiency and computational speed, the most recent developed meta-heuristic optimization methods are widely used to better integrate renewable distributed generation (RDG) into the electricity grid. The main objective of this paper is to obtain a better knowledge of current trends in meta-heuristics applied to optimally integrate RDGs to the distribution network. This is a review of well known meta-heuristic approaches, used to solve the problem of optimal renewable distributed generation allocation planning (ORDGAP). In this context, some research gaps were mentioned, and r

APA, Harvard, Vancouver, ISO, and other styles

31

McKay, David A., and Oscar Mink. "Validity in organizational research: A heuristic model." Human Resource Development Quarterly 3, no. 1 (1992): 51–71. http://dx.doi.org/10.1002/hrdq.3920030106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Gonzaga de Oliveira, Sanderson L., and Libério M. Silva. "Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy." RAIRO - Operations Research 55, no. 4 (July 2021): 2247–64. http://dx.doi.org/10.1051/ro/2021102.

Full text

Abstract:

This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising fro

APA, Harvard, Vancouver, ISO, and other styles

33

Pugazhenthi, R., and M. Anthony Xavior. "Minimizing Material Processing Time and Idle Time of a Critical Machine in a Flow Shop." Advanced Materials Research 984-985 (July 2014): 106–10. http://dx.doi.org/10.4028/www.scientific.net/amr.984-985.106.

Full text

Abstract:

In this research article aims to develop a heuristic for minimizing the total material processing time and idle time of the critical machine in a flow shop. This heuristic is proposed through the Exponential Distribution (ED) factor which helps in developing a mathematical model with less computational instance. When the idle time of the critical machine is reduced then it is indirectly affects the total material processing time of the flow shop, which makes the objective of critical machine utilization as vital. And a set of constrain had been established to position the critical machines in

APA, Harvard, Vancouver, ISO, and other styles

34

Moser, Andrea K. "Buying organic – decision-making heuristics and empirical evidence from Germany." Journal of Consumer Marketing 33, no. 7 (November 14, 2016): 552–61. http://dx.doi.org/10.1108/jcm-04-2016-1790.

Full text

Abstract:

Purpose Identifying the drivers that positively influence consumption of organic products is of utmost importance to reach consumers beyond the niche. Therefore, this study aims to propose an innovative framework which conceptualizes motivating beliefs and a simple decision-making heuristic as predictors of buying organic. Design/methodology/approach A structural equation approach is applied. Data were obtained from a nationwide panel (n = 1,760) and included survey data and scanner data for five different food categories. Findings The model is supported by actual purchasing data in all catego

APA, Harvard, Vancouver, ISO, and other styles

35

Li, Yingping, Wei Wang, Hui Cai, Jian Chen, and Ying Wang. "The Research of Home Energy Management Strategy Based on a New Meta-Heuristic Algorithm." International Journal of Materials, Mechanics and Manufacturing 6, no. 6 (December 2018): 407–14. http://dx.doi.org/10.18178/ijmmm.2018.6.6.417.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Tian, Li, Qiang Qiang Wang, and An Zhao Cao. "Research on SVM Line Loss Rate Prediction Based on Heuristic Algorithm." Applied Mechanics and Materials 291-294 (February 2013): 2164–68. http://dx.doi.org/10.4028/www.scientific.net/amm.291-294.2164.

Full text

Abstract:

With the characteristic of line loss volatility, a research of line loss rate prediction was imperatively carried out. Considering the optimization ability of heuristic algorithm and the regression ability of support vector machine, a heuristic algorithm-support vector machine model is constructed. Case study shows that, compared with other heuristic algorithms’, the search efficiency and speed of genetic algorithm are good, and the prediction model is with high accuracy.

APA, Harvard, Vancouver, ISO, and other styles

37

Chen, James C., Chien Wei Wu, Tran Dinh Duy Thao, Ling Huey Su, Wen Haiung Hsieh, and Tiffany Chen. "Hybrid Genetic Algorithm for Solving Assembly Line Balancing Problem in Footwear Industry." Advanced Materials Research 939 (May 2014): 623–29. http://dx.doi.org/10.4028/www.scientific.net/amr.939.623.

Full text

Abstract:

This research develops a heuristic algorithm for assembly line balancing problem (ALBP) of stitching lines in footwear industry. The proposed algorithm can help to design the stitching line with workstations, machines and operators for the production of every new product model. Rank-positional-weighted heuristics and hybrid genetic algorithms are proposed to solve ALBP. First, the heuristics assign tasks and machines to workstations. This solution is then used as an initiative population for hybrid genetic algorithm for further improvement. Real data from footwear manufacturers and experimenta

APA, Harvard, Vancouver, ISO, and other styles

38

Sihotang, Emil Hasudungan, Muhamad Adam, Marlina Widiyanti, and Yuliani Yuliani. "PENGARUH PERILAKU KEUANGAN HEURISTIK TERHADAP KEPUTUSAN INVESTASI SAHAM PADA BURSA EFEK INDONESIA DENGAN INVESTASI ETIS SEBAGAI VARIABEL INTERVENING STUDI EMPIRIS PADA MASYARAKAT INVESTOR KOTA PALEMBANG." Jurnal Riset Ekonomi dan Bisnis 13, no. 1 (April 21, 2020): 28. http://dx.doi.org/10.26623/jreb.v13i1.2108.

Full text

Abstract:

<p class="BasicParagraph">Tujuan dari penelitian ini untuk mengetahui bukti empiris pengaruh perilaku keuangan heuristik (<em>salience, rerpresentativness dan mental accounting</em>) dan investasi etis terhadap keputusan investasi saham yang dilakukan oleh investor individu di kota Palembang pada tahun 2019. Penelitian ini bersifat kausal menggunakan data primer 145 responden dengan teknik purposive sampling. Program analisis Structural Equation Modeling (SEM) Amos digunakan untuk mengukur hubungan antara variabel penelitian. Hasil penelitian menunjukkan bahwa perilaku keuang

APA, Harvard, Vancouver, ISO, and other styles

39

Xu, Yan-xin. "An Efficient Heuristic Approach for Irregular Cutting Stock Problem in Ship Building Industry." Mathematical Problems in Engineering 2016 (2016): 1–12. http://dx.doi.org/10.1155/2016/8703782.

Full text

Abstract:

This paper presents an efficient approach for solving a real two-dimensional irregular cutting stock problem in ship building industry. Cutting stock problem is a common cutting and packing problem that arises in a variety of industrial applications. A modification of selection heuristic Exact Fit is applied in our research. In the case referring to irregular shapes, a placement heuristics is more important to construct a complete solution. A placement heuristic relating to bottom-left-fill is presented. We evaluate the proposed approach using generated instance only with convex shapes in lite

APA, Harvard, Vancouver, ISO, and other styles

40

Bornstein, Claudio Thomas, and Manoel Campêlo. "An ADD/DROP procedure for the capacitated plant location problem." Pesquisa Operacional 24, no. 1 (April 2004): 151–62. http://dx.doi.org/10.1590/s0101-74382004000100008.

Full text

Abstract:

The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.

APA, Harvard, Vancouver, ISO, and other styles

41

Urosevic, Dragan. "Variable neighborhood search for maximum diverse grouping problem." Yugoslav Journal of Operations Research 24, no. 1 (2014): 21–33. http://dx.doi.org/10.2298/yjor121223003u.

Full text

Abstract:

This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.

APA, Harvard, Vancouver, ISO, and other styles

42

Vis, Barbara. "Heuristics and Political Elites’ Judgment and Decision-Making." Political Studies Review 17, no. 1 (February 1, 2018): 41–52. http://dx.doi.org/10.1177/1478929917750311.

Full text

Abstract:

It is broadly assumed that political elites (e.g. party leaders) regularly rely on heuristics in their judgments or decision-making. In this article, I aim to bring together and discuss the scattered literature on this topic. To address the current conceptual unclarity, I discuss two traditions on heuristics: (1) the heuristics and biases (H&B) tradition pioneered by Kahneman and Tversky and (2) the fast and frugal heuristics (F&F) tradition pioneered by Gigerenzer et al. I propose to concentrate on two well-defined heuristics from the H&B tradition— availability and representative

APA, Harvard, Vancouver, ISO, and other styles

43

Vilchynskaya, Liudmila. "DEVELOPMENT OF INTERNAL MOTIVATION OF EDUCATIONAL ACTIVITY IN STUDENTS-ATHLETES ON THE BASIS OF USE OF HEURISTIC METHODS IN TEACHING SUBJECT "ANATOMY"." SOCIETY. INTEGRATION. EDUCATION. Proceedings of the International Scientific Conference 1 (May 26, 2017): 422. http://dx.doi.org/10.17770/sie2017vol1.2302.

Full text

Abstract:

In the article the role of heuristic methods of training in development of an intrinsic motivation of the educational activity of students of specialty "Physical culture" reveals. The methodological basis of research is constituted by pedagogical heuristics – methodology of training through own search. Content of heuristic training includes two parts: invariant which is set from the outside and is acquired by the student, and variable, created by each of them in the course of educational activity.The problem of research is formulated as a question: how it is possible to strengthen an intrinsic

APA, Harvard, Vancouver, ISO, and other styles

44

Rötheli, Tobias. "Heuristics versus econometrics as a basis for forecasting international inflation differentials." foresight 21, no. 2 (April 8, 2019): 216–26. http://dx.doi.org/10.1108/fs-07-2018-0070.

Full text

Abstract:

Purpose This study aims to address the issue of prediction of inflation differences for an economy that considers either fixing its exchange rate or joining a currency union. In this setting, individual countries have limited control over their inflation, and anticipating the possible course of domestic inflation relative to inflation abroad becomes an important input in policy-making. In this context, the author compares simple forecast heuristics and econometric modeling. Design/methodology/approach The study compares two basically different approaches. The first approach of forecasting cons

APA, Harvard, Vancouver, ISO, and other styles

45

Peng, Ya Li, Jia Yao Liu, and Hong Yin. "Research on Vehicle Path Planning Based on the BDD in the Uncertain Environment." Applied Mechanics and Materials 373-375 (August 2013): 1144–49. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.1144.

Full text

Abstract:

Aimed at the high dynamics and uncertainty of road traffic, we propose a method combine BDD (binary decision diagram)-Based heuristic algorithm which used to do the initial path planning with BDD-Based incremental to solve the route replanning problem. In order to get the optimal path set, BDD-Based heuristic Search is firstly used for global planning. BDD is a compact data structure, the BDD-Based heuristic Search use this characteristic to represent state space and compress the search space through heuristic information at the same time; when the road network information changes, incremental

APA, Harvard, Vancouver, ISO, and other styles

46

Aickelin, Uwe, and Alistair Clark. "Heuristic optimisation." Journal of the Operational Research Society 62, no. 2 (February 2011): 251–52. http://dx.doi.org/10.1057/jors.2010.160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chen, James C., Wun Hao Jaong, Cheng Ju Sun, Hung Yu Lee, Jenn Sheng Wu, and Chung Chao Ku. "Applying Genetic Algorithm to Resource Constrained Multi-Project Scheduling Problems." Key Engineering Materials 419-420 (October 2009): 633–36. http://dx.doi.org/10.4028/www.scientific.net/kem.419-420.633.

Full text

Abstract:

Resource-constrained multi-project scheduling problems (RCMPSP) consider precedence relationship among activities and the capacity constraints of multiple resources for multiple projects. RCMPSP are NP-hard due to these practical constraints indicating an exponential calculation time to reach optimal solution. In order to improve the speed and the performance of problem solving, heuristic approaches are widely applied to solve RCMPSP. This research proposes Hybrid Genetic Algorithm (HGA) and heuristic approach to solve RCMPSP with an objective to minimize the total tardiness. HGA is compared w

APA, Harvard, Vancouver, ISO, and other styles

48

Shah, Syed Zulfiqar Ali, Maqsood Ahmad, and Faisal Mahmood. "Heuristic biases in investment decision-making and perceived market efficiency." Qualitative Research in Financial Markets 10, no. 1 (February 5, 2018): 85–110. http://dx.doi.org/10.1108/qrfm-04-2017-0033.

Full text

Abstract:

Purpose This paper aims to clarify the mechanism by which heuristics influences the investment decisions of individual investors, actively trading on the Pakistan Stock Exchange (PSX), and the perceived efficiency of the market. Most studies focus on well-developed financial markets and very little is known about investors’ behaviour in less developed financial markets or emerging markets. The present study contributes to filling this gap in the literature. Design/methodology/approach Investors’ heuristic biases have been measured using a questionnaire, containing numerous items, including ind

APA, Harvard, Vancouver, ISO, and other styles

49

Xu, Qiang, Le-chang Sun, and Hai-tao Liu. "Research on the Heuristic Bootstrapping Mechanism for Kademlia." Journal of Electronics & Information Technology 33, no. 2 (March 3, 2011): 266–71. http://dx.doi.org/10.3724/sp.j.1146.2010.00348.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Gregory, Robert Wayne, and Jan Muntermann. "Research Note—Heuristic Theorizing: Proactively Generating Design Theories." Information Systems Research 25, no. 3 (September 2014): 639–53. http://dx.doi.org/10.1287/isre.2014.0533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!