Heuristic “Optimization”: Why, When, and How to Use It
INFORMS Journal on Applied AnalyticsPublished 1 October 1981
Stelios H. Zanakis, James R. Evans
Citations152
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents a framework for heuristic “optimization” by systematically examining this change in attitudes towards heuristics, their desirable features and proper usage.
Abstract
The pressing need of real-world problems for quick, simple, and implementable solutions coupled with a recently increased research productivity on improved and rigorously evaluated heuristic methods are rapidly increasing the need, usage, and respect for heuristics. This paper presents a framework for heuristic “optimization” by systematically examining this change in attitudes towards heuristics, their desirable features and proper usage.
Keywords
Computer ScienceEngineering
Decision SciencesHEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
1,352 Citations1977Fred Glover
Management ScienceExceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
802 Citations1977Gérard Cornuéjols, Marshall L. Fisher +1 more
Mathematics of Operations ResearchProbabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
443 Citations1977Richard M. Karp
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms.
Management ScienceNote—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
438 Citations1979Gérard Cornuéjols, Marshall L. Fisher +1 more
In the course of the deliberations of the 1977 Lanchester Prize Committee, Alan J. Goldman brought to the authors' attention an error in the proof of Lemma 1 of their paper, which is true and the original correct, but long and intricate, proof was provided.
European Journal of Operational ResearchA tutorial on heuristic methods
132 Citations1980Edward A. Silver, René Victor +2 more
This paper defines a heuristic method as a procedure for solving a well-defined mathematical problem by an intuitive approach in which the structure of the problem can be interpreted and exploited intelligently to obtain a reasonable solution.
Management ScienceWorst-Case Analysis of Heuristic Algorithms
126 Citations1980Marshall L. Fisher
In this paper the basic ground rules of worst-case analysis of heuristics are reviewed, and a large variety of the existing types ofworst-case results are described in terms of the knapsack problem.
Communications of the ACMPracniques: construction of nonlinear programming test problems
105 Citations1965J. B. Rosen, Satomi Suzuki
Clear, concise statments of wellknown but rarely docwmented methods will contribute significantly to raising the general level of professional eompetence.
Naval Research Logistics QuarterlyInterval estimation of a global optimum for large combinatorial problems
100 Citations1979Bruce Golden, Frank B. Alt
This paper develops straightforward procedures which compute confidence intervals efficiently in order to evaluate heuristic solutions and assess deviations from optimality in a host of combinatorial optimization problems.
Journal of Statistical Computation and SimulationA simulation study of some simple estimators for the three-parameter weibull distribution
97 Citations1979Stelios H. Zanakis
Management ScienceProcedures for Estimating Optimal Solution Values for Large Combinatorial Problems
71 Citations1977David G. Dannenbring
NetworksA statistical approach to the tsp
63 Citations1977Bruce Golden
This research presents a probabilistic procedure to determine the best method to characterize the response of the immune system to earthquake-triggered landslides in rural areas.
Management ScienceHeuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
55 Citations1977Stelios H. Zanakis
The Senju-Toyoda algorithm was the fastest, but least accurate on small and medium size problems, and the Kochenberger's et al. heuristic wasThe fastest (most accurate) of the three in tightly (loosely) constrained problems.
INFORMS Journal on Applied AnalyticsFrom Teaching to Implementing Inventory Management: Problems of Translation
39 Citations1980Stelios H. Zanakis, Larry M. Austin +2 more
Management ScienceControlled Experimental Design for Statistical Comparison of Integer Programming Algorithms
37 Citations1979Benjamin W. Lin, Ronald L. Rardin
This paper formulates the problem of constructing and analyzing controlled integer programming tests in the experimental design context and develops approaches to dealing with a number of issues that arise.
Journal of the Operational Research SocietySolving Large-Scale Problems: A Venture into a New Dimension
35 Citations1980James P. Ignizio
Some thoughts are presented as to the incorporation of guidelines through which largescale problems may be solved by means of efficient heuristic techniques.
Journal of the Operational Research SocietyOperations Research for Immediate Application: A Quick and Dirty Manual
29 Citations1977Graham K. Rand
Communications of the ACMOn generation of test problems for linear programming codes
22 Citations1974A. Charnes, William M. Raike +2 more
A theoretical justification and an Illustrative implementation of a method for generating linear programming test problems with known solutions that permits the generation of test problems that are of arbitrary size and have a wide range of numerical characteristics are presented.
Management ScienceExtended Pattern Search with Transformations for the Three-Parameter Weibull MLE Problem
22 Citations1979Stelios H. Zanakis
Decision SciencesPITFALLS OF ROUNDING IN DISCRETE MANAGEMENT DECISION PROBLEMS
15 Citations1975Fred Glover, David C. Sommer
PubMedAn heretical view of management science.
13 Citations1978Theresa Levitt
The author is highly critical of the new managerial tools and decision-making modes developed by management scientists in business schools and suggests using "common sense" and "logical simplicity" in management by subdividing work into organizational units.
A I I E TransactionsThe Segregated Storage Problem: Some Properties and an Effective Heuristic
11 Citations1977James R. Evans, Frank H. Cullen
Decision SciencesSAMPLING AS A SOLUTION METHODOLOGY
10 Citations1977Vincent A. Mabert, D. Clay Whybark
This paper examines the use of sampling procedures as a solution methodology for large combinatorial problems with illustrated and compared methodologies on the basis of solution quality and computer time requirements.
Communications of the ACMNew sufficient optimality conditions for integer programming and their application
2 Citations1978J. M. Fleisher, R. R. Meyer
A new class of sufficient optimality conditions for pure and mixed integer programming problems, based on primal-dual complementarity in linear programming, is presented.