Optimal Discrete Search for a Randomly Moving COVID19

2020 ◽  
Vol 9 (3) ◽  
pp. 473-481
Keyword(s):  
Discrete Search

Continuous and discrete search for one of many objects

1987 ◽  
Vol 6 (5) ◽  
pp. 205-209 ◽  
Author(s):  
David Assaf ◽  
Shmuel Zamir
Keyword(s):  
Discrete Search

Prolegomena to optimum discrete search procedures

1959 ◽  
Vol 6 (4) ◽  
pp. 273-281 ◽  
Author(s):  
Nelson M. Blachman
Keyword(s):  
Discrete Search

scholarly journals The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm

Mathematics ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 17 ◽  
Author(s):  
Yanhong Feng ◽  
Haizhong An ◽  
Xiangyun Gao
Keyword(s):  
Transfer Function ◽  
Knapsack Problem ◽  
Transfer Functions ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Continuous Optimization ◽  
Search Space ◽  
Discrete Search ◽  
Continuous Optimization Problems

Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems. One of the most common and efficient ways to discretize MS is to use a transfer function, which is in charge of mapping a continuous search space to a discrete search space. In this paper, twelve transfer functions divided into three families, S-shaped (named S1, S2, S3, and S4), V-shaped (named V1, V2, V3, and V4), and other shapes (named O1, O2, O3, and O4), are combined with MS, and then twelve discrete versions MS algorithms are proposed for solving set-union knapsack problem (SUKP). Three groups of fifteen SUKP instances are employed to evaluate the importance of these transfer functions. The results show that O4 is the best transfer function when combined with MS to solve SUKP. Meanwhile, the importance of the transfer function in terms of improving the quality of solutions and convergence rate is demonstrated as well.

scholarly journals DISCRETE SEARCH ALLOCATION GAME WITH ENERGY CONSTRAINTS

2002 ◽  
Vol 45 (1) ◽  
pp. 93-108 ◽  
Author(s):  
Ryusuke Hohzaki ◽  
Koji Iida ◽  
Toru Komiya
Keyword(s):  
Discrete Search ◽  
Energy Constraints

Optimal Stopping in a Discrete Search Problem

1973 ◽  
Vol 21 (3) ◽  
pp. 741-747 ◽  
Author(s):  
Milton C. Chew
Keyword(s):  
Optimal Stopping ◽  
Search Problem ◽  
Discrete Search
Sign in / Sign up

Export Citation Format

Share Document