Log in

Relevant bibliographies by topics / Heuristic problem / Journal articles

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

Journal articles on the topic 'Heuristic problem'

Author: Grafiati

Published: 28 May 2022

Last updated: 30 July 2025

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 problem.'

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

Helmert, Malte. "Landmark Heuristics for the Pancake Problem." Proceedings of the International Symposium on Combinatorial Search 1, no. 1 (2010): 109–10. http://dx.doi.org/10.1609/socs.v1i1.18176.

Full text

Abstract:

We describe the gap heuristic for the pancake problem, which dramatically outperforms current abstraction-based heuristics for this problem. The gap heuristic belongs to a family of landmark heuristics that have recently been very successfully applied to planning problems.

APA, Harvard, Vancouver, ISO, and other styles

2

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 (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

3

Drake, John H., Ender Özcan, and Edmund K. Burke. "A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem." Evolutionary Computation 24, no. 1 (2016): 113–41. http://dx.doi.org/10.1162/evco_a_00145.

Full text

Abstract:

Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on

APA, Harvard, Vancouver, ISO, and other styles

4

Ö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 (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

5

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

6

Sanggala, Ekra, and Muhammad Ardhya Bisma. "Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances." Jurnal Media Teknik dan Sistem Industri 7, no. 1 (2023): 27. http://dx.doi.org/10.35194/jmtsi.v7i1.3039.

Full text

Abstract:

Travelling Salesman Problem (TSP) is the problem for finding the shortest route starting from start node then visiting number of nodes exactly once and finally go back to start node. Several heuristics are popular for solving TSP, for example Savings Algorithm and Nearest Neighbour. Performance heuristics on solving TSP are diverse, so there is need of reference for choosing a heuristic. Comparing heuristics on solving instance can be a reference for choosing a heuristic. This paper will discuss about comparison Savings Algorithm and Nearest Neighbour on Solving Russian TSP Instances. For gene

APA, Harvard, Vancouver, ISO, and other styles

7

Yao, Shunyu, Fei Liu, Xi Lin, Zhichao Lu, Zhenkun Wang, and Qingfu Zhang. "Multi-Objective Evolution of Heuristic Using Large Language Model." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 25 (2025): 27144–52. https://doi.org/10.1609/aaai.v39i25.34922.

Full text

Abstract:

Heuristics are commonly used to tackle various search and optimization problems. Design heuristics usually require tedious manual crafting with domain knowledge. Recent works have incorporated Large Language Models (LLMs) into automatic heuristic search, leveraging their powerful language and coding capacity. However, existing research focuses on the optimal performance on the target problem as the sole objective, neglecting other criteria such as efficiency and scalability, which are vital in practice. To tackle this challenge, we propose to model the heuristic search as a multi-objective opt

APA, Harvard, Vancouver, ISO, and other styles

8

Ursani, Ziauddin, and Ahsan Ahmad Ursani. "Augmented tour construction heuristics for the travelling salesman problem." International Journal of Industrial Optimization 4, no. 2 (2023): 131–44. http://dx.doi.org/10.12928/ijio.v4i2.7875.

Full text

Abstract:

Tour construction heuristics serve as fundamental techniques in optimizing the routes of a traveling salesman. These heuristics remain significant as foundational methods for generating initial solutions to the Traveling Salesman Problem (TSP), facilitating subsequent applications of tour improvement heuristics. These heuristics effectively comprise the iterative application of city node selection and insertion. However, thus far, no attempts have been made to enhance the basic structure of tour construction heuristics to bring a better initial solution for the advanced heuristics. This study

APA, Harvard, Vancouver, ISO, and other styles

9

Rayner, D. Chris, Michael Bowling, and Nathan Sturtevant. "Euclidean Heuristic Optimization." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 81–86. http://dx.doi.org/10.1609/aaai.v25i1.7815.

Full text

Abstract:

We pose the problem of constructing good search heuristics as an optimization problem: minimizing the loss between the true distances and the heuristic estimates subject to admissibility and consistency constraints. For a well-motivated choice of loss function, we show performing this optimization is tractable. In fact, it corresponds to a recently proposed method for dimensionality reduction. We prove this optimization is guaranteed to produce admissible and consistent heuristics, generalizes and gives insight into differential heuristics, and show experimentally that it produces strong heuri

APA, Harvard, Vancouver, ISO, and other styles

10

Adubi, Stephen A., Olufunke O. Oladipupo, and Oludayo O. Olugbara. "Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems." Algorithms 15, no. 11 (2022): 405. http://dx.doi.org/10.3390/a15110405.

Full text

Abstract:

Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics for cross-domain search with outstanding performances on six problem domains. However, it has recorded low performances on three supplementary problems, namely knapsack, quadratic assignment, and maximum-cut problems, which undermines its credibility across problem domains. The purpose of this study was to design an evolutionary algorithm-based i

APA, Harvard, Vancouver, ISO, and other styles

11

Okitonyumbe Y. F, Joseph, Berthold Ulungu E.-L, and Joel Kapiamba Nt. "Cobweb heuristic for multi-objective vehicle routing problem." International Journal of Applied Mathematical Research 4, no. 3 (2015): 430. http://dx.doi.org/10.14419/ijamr.v4i3.4317.

Full text

Abstract:

<p>Solving a classical vehicle routing problem (VRP) by exact methods presents many difficulties for large dimension problem. Consequently, in multi-objective framework, heuristic or metaheuristic methods are required. Due to particular VRP structure, it seems that a dedicated heuristicis more suitable than a metaheuristic. The aim of this article is to collapse different heuristics solving classical VRP and adapt them for to solve the multi-objective vehicle routing problem (MOVRP). The so-called Cobweb Algorithm simulates spider’s behavior when weaving cobweb. This paper presents the a

APA, Harvard, Vancouver, ISO, and other styles

12

Mellouli, O., I. Hafidi, and A. Metrane. "A modified choice function hyper-heuristic with Boltzmann function." Mathematical Modeling and Computing 8, no. 4 (2021): 736–46. http://dx.doi.org/10.23939/mmc2021.04.736.

Full text

Abstract:

Hyper-heuristics are a subclass of high-level research methods that function in a low-level heuristic research space. Their aim objective is to improve the level of generality for solving combinatorial optimization problems using two main components: a methodology for the heuristic selection and a move acceptance criterion, to ensure intensification and diversification [1]. Thus, rather than working directly on the problem's solutions and selecting one of them to proceed to the next step at each stage, hyper-heuristics operates on a low-level heuristic research space. The choice function is on

APA, Harvard, Vancouver, ISO, and other styles

13

Kaweegitbundit, Parinya. "Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time." Advanced Materials Research 339 (September 2011): 332–35. http://dx.doi.org/10.4028/www.scientific.net/amr.339.332.

Full text

Abstract:

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.

APA, Harvard, Vancouver, ISO, and other styles

14

WALLACE, RICHARD J. "DETERMINING THE PRINCIPLES UNDERLYING PERFORMANCE VARIATION IN CSP HEURISTICS." International Journal on Artificial Intelligence Tools 17, no. 05 (2008): 857–80. http://dx.doi.org/10.1142/s0218213008004199.

Full text

Abstract:

This paper develops the idea that variable ordering heuristics for CSPs can be characterised in terms of a small number of distinguishable actions or strategies, and that while specific heuristics may be classified differently depending on the problem type, the basic actions that determine their classification are the same. These strategies can be described as building up contention and propagating effects to future, uninstantiated variables. The propagation-of-effects type of action is related to the "simplification hypothesis" of Hooker and Vinay, but since this is only one of two independen

APA, Harvard, Vancouver, ISO, and other styles

15

Narayanan, Venkatraman, Sandip Aine, and Maxim Likhachev. "Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics." Proceedings of the International Symposium on Combinatorial Search 6, no. 1 (2021): 78–86. http://dx.doi.org/10.1609/socs.v6i1.18350.

Full text

Abstract:

Recently, several researchers have brought forth the benefits of searching with multiple (and possibly inadmissible) heuristics, arguing how different heuristics could be independently useful in different parts of the state space. However, algorithms that use inadmissible heuristics in the traditional best-first sense, such as the recently developed Multi-Heuristic A* (MHA*), are subject to a crippling calibration problem: they prioritize nodes for expansion by additively combining the cost-to-come and the inadmissible heuristics even if those heuristics have no connection with the cost-to-go

APA, Harvard, Vancouver, ISO, and other styles

16

Moon, Seongsoo, and Mary Inaba. "Boost SAT Solver with Hybrid Branching Heuristic." Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (2021): 56–63. http://dx.doi.org/10.1609/socs.v8i1.18422.

Full text

Abstract:

Most state-of-the-art satisfiability (SAT) solvers are capable of solving large application instances with efficient branching heuristics. The VSIDS heuristic is widely used because of its robustness. This paper focuses on the inherent ties in VSIDS and proposes a new branching heuristic called TBVSIDS, which attempts to break the ties with the consideration of the interplay between the branching heuristic and learned clauses. However, a branching heuristic cannot cover all problems, and its performance improves when combined with an appropriate configuration. Therefore, we also propose a hybr

APA, Harvard, Vancouver, ISO, and other styles

17

Sánchez-Díaz, Xavier, José Carlos Ortiz-Bayliss, Ivan Amaya, Jorge M. Cruz-Duarte, Santiago Enrique Conant-Pablos, and Hugo Terashima-Marín. "A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem." Applied Sciences 11, no. 21 (2021): 10209. http://dx.doi.org/10.3390/app112110209.

Full text

Abstract:

Recent years have witnessed a growing interest in automatic learning mechanisms and applications. The concept of hyper-heuristics, algorithms that either select among existing algorithms or generate new ones, holds high relevance in this matter. Current research suggests that, under certain circumstances, hyper-heuristics outperform single heuristics when evaluated in isolation. When hyper-heuristics are selected among existing algorithms, they map problem states into suitable solvers. Unfortunately, identifying the features that accurately describe the problem state—and thus allow for a prope

APA, Harvard, Vancouver, ISO, and other styles

18

E. Nugraheni, Cecilia, Luciana Abednego, and Maria Widyarini. "A Combination of Palmer Algorithm and Gupta Algorithm for Scheduling Problem in Apparel Industry." International Journal of Fuzzy Logic Systems 11, no. 1 (2021): 1–12. http://dx.doi.org/10.5121/ijfls.2021.11101.

Full text

Abstract:

The apparel industry is a class of textile industry. Generally, the production scheduling problem in the apparel industry belongs to Flow Shop Scheduling Problems (FSSP). There are many algorithms/techniques/heuristics for solving FSSP. Two of them are the Palmer Algorithm and the Gupta Algorithm. Hyper-heuristic is a class of heuristics that enables to combine of some heuristics to produce a new heuristic. GPHH is a hyper-heuristic that is based on genetic programming that is proposed to solve FSSP [1]. This paper presents the development of a computer program that implements the GPHH. Some e

APA, Harvard, Vancouver, ISO, and other styles

19

Cecilia, E. Nugraheni, Abednego Luciana, and Widyarini Maria. "A Combination of Palmer Algorithm and Gupta Algorithm for Scheduling Problem in Apparel Industry." International Journal of Fuzzy Logic Systems (IJFLS) 11, no. 1 (2023): 12. https://doi.org/10.5281/zenodo.8414116.

Full text

Abstract:

The apparel industry is a class of textile industry. Generally, the production scheduling problem in the apparel industry belongs to Flow Shop Scheduling Problems (FSSP). There are many algorithms/techniques/heuristics for solving FSSP. Two of them are the Palmer Algorithm and the Gupta Algorithm. Hyper-heuristic is a class of heuristics that enables to combine of some heuristics to produce a new heuristic. GPHH is a hyper-heuristic that is based on genetic programming that is proposed to solve FSSP [1]. This paper presents the development of a computer program that implements the GPHH. Some e

APA, Harvard, Vancouver, ISO, and other styles

20

Cichowicz, T., M. Drozdowski, M. Frankiewicz, G. Pawlak, F. Rytwinski, and J. Wasilewski. "Hyper-heuristics for cross-domain search." Bulletin of the Polish Academy of Sciences: Technical Sciences 60, no. 4 (2012): 801–8. http://dx.doi.org/10.2478/v10175-012-0093-7.

Full text

Abstract:

Abstract In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performance of both methods is studied. Useful and interesting experience gained in construction of the hyper-heuristics are presented. Conclusions and recommendations for the future advancement of hype

APA, Harvard, Vancouver, ISO, and other styles

21

Srivastava, Stuti, Richa Bansal, and Antika Thapar. "List Coloring Problem: A Heuristic Approach." Indian Journal Of Science And Technology 16, SP3 (2023): 22–29. http://dx.doi.org/10.17485/ijst/v16isp3.icrtam135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

MADENOĞLU, Fatma Selen. "SOLVING THE HYBRID FLOW SHOP SCHEDULING PROBLEM USING HEURISTIC ALGORITHMS." Business & Management Studies: An International Journal 7, no. 3 (2019): 14–25. http://dx.doi.org/10.15295/bmij.v7i3.1226.

Full text

Abstract:

A variant of the hybrid ﬂow shop (HFS) problem considering missing operations, transportation times and sequence-dependent setup times is investigated. Heuristic algorithms along with dispatching rulesand dispatching rules are used to solve the given problem. The objective function is minimization makespan. The computational experimets are conducted to test the performance of the heuristic algoirthms and dispatching rules. In order to depict the effect of the factors: number of jobs, number of machines, number of production stages, level of missing operations on the result, the additiol experi

APA, Harvard, Vancouver, ISO, and other styles

23

Icasia, Gabriella, Raras Tyasnurita, and Etria Sepwardhani Purba. "Application of Heuristic Combinations in Hyper-Heuristic Framework for Exam Scheduling Problems." Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) 4, no. 4 (2020): 664–71. http://dx.doi.org/10.29207/resti.v4i4.2066.

Full text

Abstract:

Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large scale of data, the examination timetabling problem becomes a complex problem and takes time if it solved manually. Therefore, heuristics exist to provide reasonable enough solutions and meet the constraints of the problem. In this study, a real-world dataset of Examination Timetabling (Toronto dataset) is solved using a Hill-Climbing and Tabu Search algorithm. Different from the approach in the literature, Tabu Search is a meta-h

APA, Harvard, Vancouver, ISO, and other styles

24

Chen, Dillon Z., Felipe Trevizan, and Sylvie Thiébaux. "Heuristic Search for Multi-Objective Probabilistic Planning." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 10 (2023): 11945–54. http://dx.doi.org/10.1609/aaai.v37i10.26409.

Full text

Abstract:

Heuristic search is a powerful approach that has successfully been applied to a broad class of planning problems, including classical planning, multi-objective planning, and probabilistic planning modelled as a stochastic shortest path (SSP) problem. Here, we extend the reach of heuristic search to a more expressive class of problems, namely multi-objective stochastic shortest paths (MOSSPs), which require computing a coverage set of non-dominated policies. We design new heuristic search algorithms MOLAO* and MOLRTDP, which extend well-known SSP algorithms to the multi-objective case. We furth

APA, Harvard, Vancouver, ISO, and other styles

25

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 (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

26

Lakshmipathy, D., M. Chandrasekaran, T. Balamurugan, and P. Sriramya. "A New GT Heuristic for Solving Multi Objective Job Shop Scheduling Problems." Applied Mechanics and Materials 591 (July 2014): 184–88. http://dx.doi.org/10.4028/www.scientific.net/amm.591.184.

Full text

Abstract:

The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems in manufacturing system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. New Game t

APA, Harvard, Vancouver, ISO, and other styles

27

Shieh, How-Ming, and Ming-Der May. "On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time." Transportation Research Record: Journal of the Transportation Research Board 1617, no. 1 (1998): 171–78. http://dx.doi.org/10.3141/1617-24.

Full text

Abstract:

The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combined the concepts of the “on-line algorithm,” “anytime algorithm,” and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon’s problems. By comparing with these benchmark problems, the different results between on-line and off-line

APA, Harvard, Vancouver, ISO, and other styles

28

Hutama, Rizal Risnanda, Tsani Nahdliyah, Aelisa Nailin Nabila, and Ahmad Muklason. "Perbandingan Algoritma Heuristic Selection untuk Penjadwalan Ujian Menggunakan Kerangka Kerja Hyper-Heuristics." Jurnal Teknik Elektro dan Komputer 12, no. 2 (2023): 85–92. http://dx.doi.org/10.35793/jtek.v12i2.47757.

Full text

Abstract:

Abstract — Examination timetabling is an example of a problem in operations research and an exciting issue in higher education. For example, the problems that occur in an institution are the limited number and capacity of rooms, few exam supervisors, and limited exam time. So far, exam scheduling is done manually, so it is pretty time-consuming. Until now, no algorithm can solve this problem in polynomial time. So that in the optimization world, the problem of scheduling exams is an NP-Hard problem. Solving this problem can be done using a heuristic algorithm to produce a reasonably good solut

APA, Harvard, Vancouver, ISO, and other styles

29

Clausecker, Robert K. P., and Florian Schintke. "A Measure of Quality for IDA* Heuristics." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (2021): 55–63. http://dx.doi.org/10.1609/socs.v12i1.18551.

Full text

Abstract:

We present a novel way to judge the performance of IDA* heuristics. With this measure of heuristic quality η, different heuristics for the same problem space can be compared objectively without regards to a particular problem instance. We show how η can be used to model the performance expectations of PDB heuristics. By drawing histograms of the contributions of different parts of the search space to η, we show what parts are most critical to the quality of a heuristic and contribute to the long-standing question on what h values are most critical to the performance of an IDA* heuristic.

APA, Harvard, Vancouver, ISO, and other styles

30

Lei, Yu, Maoguo Gong, Licheng Jiao, and Yi Zuo. "A memetic algorithm based on hyper-heuristics for examination timetabling problems." International Journal of Intelligent Computing and Cybernetics 8, no. 2 (2015): 139–51. http://dx.doi.org/10.1108/ijicc-02-2015-0005.

Full text

Abstract:

Purpose – The examination timetabling problem is an NP-hard problem. A large number of approaches for this problem are developed to find more appropriate search strategies. Hyper-heuristic is a kind of representative methods. In hyper-heuristic, the high-level search is executed to construct heuristic lists by traditional methods (such as Tabu search, variable neighborhoods and so on). The purpose of this paper is to apply the evolutionary strategy instead of traditional methods for high-level search to improve the capability of global search. Design/methodology/approach – This paper combines

APA, Harvard, Vancouver, ISO, and other styles

31

TELELIS, ORESTIS, and PANAGIOTIS STAMATOPOULOS. "GUIDING CONSTRUCTIVE SEARCH WITH STATISTICAL INSTANCE-BASE LEARNING." International Journal on Artificial Intelligence Tools 11, no. 02 (2002): 247–66. http://dx.doi.org/10.1142/s0218213002000885.

Full text

Abstract:

Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the underlying problem and are applicable only within its framework. We suspect, however, that search spaces of combinatorial problems are rich in intuitive statistical and numerical information, which could be exploited heuristically in a generic manner, towards achievement of optimized solutions. Our work presents such a heuristic methodology, which can be adequately configured for several types of optimization problems.

APA, Harvard, Vancouver, ISO, and other styles

32

Cohen, Yossi, Roni Stern, and Ariel Felner. "Solving the Longest Simple Path Problem with Heuristic Search." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 75–79. http://dx.doi.org/10.1609/icaps.v30i1.6647.

Full text

Abstract:

Prior approaches for finding the longest simple path (LSP) in a graph used constraints solvers and genetic algorithms. In this work, we solve the LSP problem with heuristic search. We first introduce several methods for pruning dominated path prefixes. Then, we propose several admissible heuristic functions for this problem. Experimental results demonstrate the large impact of the proposed heuristics and pruning rules.

APA, Harvard, Vancouver, ISO, and other styles

33

Lelis, Levi, Shahab Jabbari Arfaee, Sandra Zilles, and Robert Holte. "Learning Heuristic Functions Faster by Using Predicted Solution Costs." Proceedings of the International Symposium on Combinatorial Search 3, no. 1 (2021): 166–67. http://dx.doi.org/10.1609/socs.v3i1.18258.

Full text

Abstract:

Jabbari Arfaee, Zilles, and Holte presented the bootstrap learning system, a system that learns strong heuristic functions for state-space problems. They showed that IDA* with a bootstrap heuristic is able to quickly find near-optimal solutions in several problem domains. However, the process the bootstrap method uses to learn heuristic functions is time-consuming: it is on the order of days. In this paper we present a learning system that uses an approximation method instead of an exact one to generate the training set required to learn heuristics. We showed recently that solution costs can o

APA, Harvard, Vancouver, ISO, and other styles

34

Trevizan, Felipe, Sylvie Thiébaux, and Patrik Haslum. "Occupation Measure Heuristics for Probabilistic Planning." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 306–15. http://dx.doi.org/10.1609/icaps.v27i1.13840.

Full text

Abstract:

For the past 25 years, heuristic search has been used to solve domain-independent probabilistic planning problems, but with heuristics that determinise the problem and ignore precious probabilistic information. To remedy this situation, we explore the use of occupation measures, which represent the expected number of times a given action will be executed in a given state of a policy. By relaxing the well-known linear program that computes them, we derive occupation measure heuristics -- the first admissible heuristics for stochastic shortest path problems (SSPs) taking probabilities into accou

APA, Harvard, Vancouver, ISO, and other styles

35

Behera, Dhiren Kumar, and Dipak Laha. "Comparison of Heuristics for Identical Parallel Machine Scheduling." Advanced Materials Research 488-489 (March 2012): 1708–12. http://dx.doi.org/10.4028/www.scientific.net/amr.488-489.1708.

Full text

Abstract:

This paper addresses the problem of scheduling n independent jobs processed nonpreemtively on m identical parallel machines with the objective of minimizing makespan. Since these scheduling problems are well known to be NP-hard, among various solution methodologies, heuristics are preferred most. They guarantee near-optimal solutions and due to their polynomial time algorithms require reasonable computational effort, especially for solving large problem sizes. We consider three popular heuristics, multifit, combine and listfit since the seminal work of McNaughton in 1959. We present different

APA, Harvard, Vancouver, ISO, and other styles

36

Boston, Kevin, and Pete Bettinger. "An Analysis of Monte Carlo Integer Programming, Simulated Annealing, and Tabu Search Heuristics for Solving Spatial Harvest Scheduling Problems." Forest Science 45, no. 2 (1999): 292–301. http://dx.doi.org/10.1093/forestscience/45.2.292.

Full text

Abstract:

Abstract Heuristics are commonly used to solve spatial harvest scheduling problems. They can generate spatially and temporally feasible solutions to large problems that traditional mathematical programming techniques are unable to solve. A common complaint about heuristics is that the quality of the solutions is unknown. We compared three heuristic techniques commonly used to solve spatial harvest scheduling problems: Monte Carlo integer programming, simulated annealing, and tabu search. Five hundred solutions to four problems, which had between 3000 to 5000 0-1 integer variables, were generat

APA, Harvard, Vancouver, ISO, and other styles

37

Yuliza, Evi, Fitri Maya, and Siti Suzlin Supadi. "Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows." Science and Technology Indonesia 6, no. 2 (2021): 53–57. http://dx.doi.org/10.26554/sti.2021.6.2.53-57.

Full text

Abstract:

Garbage is one of the environmental problems. The process of transporting garbage sometimes occurs delays such as congestion and engine failure. Robust optimization model called a robust counterpart open capacitated vehicle routing problem (RCOCVRP) with time windows was formulated to get over this delays. This model has formulated with the limitation of vehicle capacity and time windows with an uncertainty of waste volume and travel time. The RCOCVRP model with time windows is solved by a heuristic approach. The heuristic approach used to solve the RCOCVRP model with time windows uses the nea

APA, Harvard, Vancouver, ISO, and other styles

38

Golab, Amir, Ehsan Sedgh Gooya, Ayman Al Falou, and Mikael Cabon. "Review of conventional metaheuristic techniques for resource-constrained project scheduling problem." Journal of Project Management 7, no. 2 (2022): 95–110. http://dx.doi.org/10.5267/j.jpm.2021.10.002.

Full text

Abstract:

This paper is concerned with an overview of the Resource-Constrained Project Scheduling Problem (RCPSP) and the conventional meta-heuristic solution techniques that have attracted the attention of many researchers in the field. Therefore, researchers have developed algorithms and methods to solve the problem. This paper addresses the single-mode RCPSP where the objective is to optimize and minimize the project duration while the quantities of resources are constrained during the project execution. In this problem, resource constraints and precedence relationships between activities are known t

APA, Harvard, Vancouver, ISO, and other styles

39

Melnikov, Oleg. "Heuristic Rules for the Dynamic Pricing Problem." Organizations and Markets in Emerging Economies 14, no. 2(28) (2023): 436–57. http://dx.doi.org/10.15388/omee.2023.14.99.

Full text

Abstract:

This paper is devoted to the development of heuristics for the dynamic pricing problem. A discrete time model of dynamic pricing on the fixed time horizon is proposed. It is applicable to products that satisfy two properties: 1) product value expires at a certain predetermined date, and 2) consumers demand at most a single unit of the product. This type of demand structure allows deriving a simple system of recursive equations for optimal prices using dynamic programming techniques. Optimal pricing policy is expressed as a function of time to expiration and inventory levels of unsold products.

APA, Harvard, Vancouver, ISO, and other styles

40

Chen, Ruey-Maw, and Chuin-Mu Wang. "Project Scheduling Heuristics-Based Standard PSO for Task-Resource Assignment in Heterogeneous Grid." Abstract and Applied Analysis 2011 (2011): 1–20. http://dx.doi.org/10.1155/2011/589862.

Full text

Abstract:

The task scheduling problem has been widely studied for assigning resources to tasks in heterogeneous grid environment. Effective task scheduling is an important issue for the performance of grid computing. Meanwhile, the task scheduling problem is an NP-complete problem. Hence, this investigation introduces a named “standard“ particle swarm optimization (PSO) metaheuristic approach to efficiently solve the task scheduling problems in grid. Meanwhile, two promising heuristics based on multimode project scheduling are proposed to help in solving interesting scheduling problems. They are the bes

APA, Harvard, Vancouver, ISO, and other styles

41

Felner, A., R. E. Korf, and S. Hanan. "Additive Pattern Database Heuristics." Journal of Artificial Intelligence Research 22 (November 1, 2004): 279–318. http://dx.doi.org/10.1613/jair.1480.

Full text

Abstract:

We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases, which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heuristics, however, we partition our problems into disjoint subproblems, so that the costs of solving the different subproblems can be added together without overestimating the cost of solving the original problem. Previously, we showed how to statically partition the sliding-tile puzzles into disjoint groups of tiles to compute an ad

APA, Harvard, Vancouver, ISO, and other styles

42

Jiang, He, Junying Qiu, and Jifeng Xuan. "A Hyper-Heuristic Using GRASP with Path-Relinking." Journal of Information Technology Research 4, no. 2 (2011): 31–42. http://dx.doi.org/10.4018/jitr.2011040103.

Full text

Abstract:

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedure of HyGrasPr consists of three phases, namely the construction phase, the local search phase, and the path-relinking phase. To show the performance of the HyGrasPr, the authors use the nurse rostering

APA, Harvard, Vancouver, ISO, and other styles

43

Cox, James L., Stephen Lucci, and Tayfun Pay. "Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem." Inteligencia Artificial 22, no. 63 (2019): 1–15. http://dx.doi.org/10.4114/intartif.vol22iss63pp1-15.

Full text

Abstract:

We carry out a detailed analysis of the effects of different dynamic variable and value ordering heuristics on the search space of Sudoku when the encoding method and the filtering algorithm are fixed. Our study starts by examining lexicographical variable and value ordering and evaluates different combinations of dynamic variable and value ordering heuristics. We eventually build up to a dynamic variable ordering heuristic that has two rounds of tie-breakers, where the second tie-breaker is a dynamic value ordering heuristic. We show that our method that uses this interlinked heuristic outper

APA, Harvard, Vancouver, ISO, and other styles

44

Romanuke, Vadim. "A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness." Applied Computer Systems 27, no. 1 (2022): 1–12. http://dx.doi.org/10.2478/acss-2022-0001.

Full text

Abstract:

Abstract A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal schedule whenever finding the exact solution is practically intractable. The three heuristics are based on the well-known rules, whereas the 21 heuristics are introduced first. Therefore, the hyper-heuristic selects the best heuristic schedule among 24 schedule versions, whose total weighted tardiness is minimal. Each of the 24 heuristics ca

APA, Harvard, Vancouver, ISO, and other styles

45

Aliferis, C. F., and R. A. Miller. "On the Heuristic Nature of Medical Decision-Support Systems." Methods of Information in Medicine 34, no. 01/02 (1995): 5–14. http://dx.doi.org/10.1055/s-0038-1634584.

Full text

Abstract:

Abstract:In the realm of medical decision-support systems, the term “heuristic systems” is often considered to be synonymous with “medical artificial intelligence systems” or with “systems employing informal model(s) of problem solving”. Such a view may be inaccurate and possibly impede the conceptual development of future systems. This article examines the nature of heuristics and the levels at which heuristic solutions are introduced during system design and implementation. The authors discuss why heuristics are ubiquitous in all medical decision-support systems operating at non-trivial doma

APA, Harvard, Vancouver, ISO, and other styles

46

Skyler, Shawn, Dor Atzmon, Tamir Yaffe, and Ariel Felner. "Solving the Watchman Route Problem with Heuristic Search." Journal of Artificial Intelligence Research 75 (November 9, 2022): 747–93. http://dx.doi.org/10.1613/jair.1.13685.

Full text

Abstract:

This paper solves the Watchman Route Problem (WRP) on a general discrete graph with Heuristic Search. Given a graph, a line-of-sight (LOS) function, and a start vertex, the task is to (offline) find a (shortest) path through the graph such that all vertices in the graph will be visually seen by at least one vertex on the path. WRP is reminiscent but different from graph covering and mapping problems, which are done online on an unknown graph. We formalize WRP as a heuristic search problem and solve it optimally with an A*-based algorithm. We develop a series of admissible heuristics with incre

APA, Harvard, Vancouver, ISO, and other styles

47

Kuroiwa, Ryo, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, and J. Christopher Beck. "LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions." Proceedings of the International Conference on Automated Planning and Scheduling 31 (May 17, 2021): 210–18. http://dx.doi.org/10.1609/icaps.v31i1.15964.

Full text

Abstract:

We consider optimal numeric planning with numeric conditions consisting of linear expressions of numeric state variables and actions that increase or decrease numeric state variables by constant quantities. We build on previous research to introduce a new variant of the numeric hmax heuristic based on the delete-relaxed version of such planning tasks. Although our hmax heuristic is inadmissible, it yields a numeric version of the classical LM-cut heuristic which is admissible. Further, we prove that our LM-cut heuristic neither dominates nor is dominated by the existing numeric heuristic hmax(

APA, Harvard, Vancouver, ISO, and other styles

48

JÓŹWIAK, LECH. "AN EFFICIENT HEURISTIC METHOD FOR STATE ASSIGNMENT OF LARGE SEQUENTIAL MACHINES." Journal of Circuits, Systems and Computers 02, no. 01 (1992): 1–26. http://dx.doi.org/10.1142/s0218126692000027.

Full text

Abstract:

VLSI circuit design is a “trial and error” process that consists of solving a number of design problems. An optimal state assignment is one of the most important problems in the logic synthesis for sequential machines and it consists of choosing a binary representation for symbolic internal states of a sequential machine, so that the resulting logic is optimal for a given objective. This problem belongs to the class of most complex computational problems in VLSI design – it is NP hard. In a strict sense, it has never been solved, except for exhaustive search, which is impossible for large mach

APA, Harvard, Vancouver, ISO, and other styles

49

Tüű-Szabó, Boldizsár, Péter Földesi, and László T. Kóczy. "An Efficient Tour Construction Heuristic for Generating the Candidate Set of the Traveling Salesman Problem with Large Sizes." Mathematics 12, no. 19 (2024): 2960. http://dx.doi.org/10.3390/math12192960.

Full text

Abstract:

In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches and heuristics, depend greatly on the quality of these candidate sets but often struggle in large-scale situations due to insufficient edge coverage or high time complexity. We present a new heuristic based on fuzzy clustering, designed to produce high-quality candidate sets with nearly linear time complexity. Thoroughly tested on benchmark instan

APA, Harvard, Vancouver, ISO, and other styles

50

Müller, Felipe Martins, and Iaê Santos Bonilha. "Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems." Algorithms 15, no. 1 (2021): 9. http://dx.doi.org/10.3390/a15010009.

Full text

Abstract:

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with Dynamic Optimization Problems (DOPs) properly. Despite the good results obtained by the integration of local search operators with ACO, little has been done to tackle DOPs. In this research, one of the most reliable ACO schemes, the MAX-MIN Ant System (MMAS), has been integrated with advanced and effective local search operators, resulting in a

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!