scispace - formally typeset
Search or ask a question
Topic

Null-move heuristic

About: Null-move heuristic is a research topic. Over the lifetime, 1240 publications have been published within this topic receiving 35934 citations.


Papers
More filters
Journal ArticleDOI
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.

5,501 citations

Journal ArticleDOI
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Abstract: In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.

2,255 citations

Journal ArticleDOI
TL;DR: An efficient probabilistic set covering heuristic is presented that provides the best known solutions to all other instances attempted to solve set covering problems that arise from Steiner triple systems.

1,038 citations

Journal ArticleDOI
TL;DR: A variation of minimax lookahead search, and an analog to alpha-beta pruning that significantly improves the efficiency of the algorithm, and a new algorithm, called Real-Time-A∗, for interleaving planning and execution, which proves that the algorithm makes locally optimal decisions and is guaranteed to find a solution.

989 citations

Journal ArticleDOI
TL;DR: In this article, the min-conflicts heuristic is used to minimize the number of constraint violations after each step in a value-ordering heuristic search, which can be used with a variety of different search strategies.

945 citations


Network Information
Related Topics (5)
Scheduling (computing)
78.6K papers, 1.3M citations
83% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Fuzzy logic
151.2K papers, 2.3M citations
79% related
Wireless sensor network
142K papers, 2.4M citations
79% related
Supply chain
84.1K papers, 1.7M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20234
202217
20185
201735
201640
201541