You are not currently logged in.
Access JSTOR through your library or other institution:
The Heuristic Problem-Solving Approach
L. R. Foulds
The Journal of the Operational Research Society
Vol. 34, No. 10 (Oct., 1983), pp. 927-934
Stable URL: http://www.jstor.org/stable/2580891
Page Count: 8
You can always find the topics here!Topics: Heuristics, Mathematical problems, Algorithms, Tours, Operations research, Optimal solutions, Business orders, Combinatorial optimization, Scheduling, Mathematical objects
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
For a variety of reasons, the finding of an optimal solution is impractical for many O.R. problems. A common way of overcoming this unhappy state of affairs is the development of heuristic (approximate) methods. The purpose of this paper is to discuss some of the issues that arise with such an approach-that is, the use of a method which, on the basis of experience of judgement, seems likely to yield good solutions but which cannot guarantee optimality. The use of such methods is motivated by the emergence of the theory of NP-completeness, i.e. the study of the complexity of algorithms, which is briefly introduced. A number of heuristic methods are presented in order to illustrate some of the ideas discussed. Heuristic procedures are classified according to design. Some of the problems of both how to design effective heuristics and how to use heuristics in the real world are discussed.
The Journal of the Operational Research Society © 1983 Operational Research Society