Neighborhood size in the Simulated Annealing Algorithm
American Journal of Mathematical and Management Sciences
A note on the effect of neighborhood structure in simulated annealing
Computers and Operations Research
Job shop scheduling by simulated annealing
Operations Research
A heuristic algorithm for mean flowtime objective in flowshop scheduling
Computers and Operations Research
A systematic procedure for setting parameters in simulated annealing algorithms
Computers and Operations Research
A simulation-based heuristic algorithm for disposition of direction finders
Computers and Industrial Engineering
| Hi-index | 0.01 |
We consider the problem of determining a route of a search resource to search visually multiple areas in which targets are expected to be located. It is assumed that the probability a target exists in each area is given as a result of target detection operations and that the probability decreases as time passes. It is necessary to search the areas using a search resource, and identify the exact locations of the targets. We propose heuristic algorithms including a simulated annealing (SA) algorithm for the search sequencing problem. Since the search sequence must be determined as quickly as possible not to delay the search, heuristics for search sequencing should not take too much time. We introduce a new neighborhood generation method and a new parameter for an easier control of the overall computation time in the SA algorithm. A series of computational experiments is performed for evaluating the suggested algorithms, and results are reported.