Horizon-scan: a heuristic search technique

Authors:
Pramesh Chand;Ly Fie Sugianto
Affiliations:
School of Business Systems, Building 63B, Monash University, Clayton, Victoria 3800, Australia;School of Business Systems, Building 63B, Monash University, Clayton, Victoria 3800, Australia
Venue:
Design and application of hybrid intelligent systems
Year:
2003

Citing 6
Cited 0

Operations research: an introduction, 4th ed.

Operations research: an introduction, 4th ed.
Direct search methods: then and now

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
A simulated annealing algorithm for dynamic layout problem

Computers and Operations Research
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Evolutionary Optimization

Evolutionary Optimization
Tabu search for a class of single-machine scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims to introduce a new heuristic based global search technique for optimisation problems. Horizon-Scan (HS) derives its name from the employed heuristic method and is designed for nonlinear solution space. It is a variant of the commonly known Hill -Climbing technique and works contrary to the temperature-cooling scheme used in Simulated-Annealing. In this paper the technique is described in detail and some test results are presented. Results shown demonstrate the performance of the algorithm.