Abstract
The problem of estimating the global optimal values of intractable combinatorial optimization problems is of interest to researchers developing and evaluating heuristics for these problems. In this paper we present a method for combining statistical optimum prediction techniques with local search methods such as simulated annealing and tabu search and illustrate the approach on a single machine scheduling problem. Computational experiments show that the approach yields useful estimates of optimal values with very reasonable computational effort.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boender, C.G.E., A.H.G. Rinnooy Kan, L. Stougie, and G.T. Timmer. (1982). “A Stochastic Method for Global Optimization.” Mathematical Programming 22, 125–140.
Dannenbring, D. (1977). “Estimating Optimal Solutions for Large Combinatorial Problems.” Management Science 23, 1273–1283.
Derigs, U. (1985). “Using Confidence Limits for the Global Optimal in Combinatorial Optimization.” Operations Research 33, 1024–1049.
Fisher, R. and L. Tippett. (1928). “Limiting Forms of the Frequency Distribution of the Largest or Smallest Member of a Sample.” Proceedings of the Cambridge Philosophical Society 24, 180–190.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
Glover, F. (1989). “Tabu Search Part I.” ORSA Journal on Computing 1, 190–206.
Glover, F. (1990). “Tabu Search Part II.” ORSA Journal on Computing 2, 4–32.
Golden, B.L. and F.B. Alt. (1979). “Interval Estimation of a Global Optimum for Large Combinatorial Problems.” Naval Research Logistics Quarterly 26, 69–77.
Golden, B.L. and W.R. Stewart. (1985). “Empirical Analysis of Heuristics.” In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: John Wiley.
Law, A.M. and W.D. Kelton. (1982). Simulation Modeling and Analysis. New York: McGraw-Hill.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.). (1990). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: John Wiley.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1993). “Sequencing and Scheduling: Algorithms and Complexity.” In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (eds.), Handbooks in Operations Research and Management Science Vol. 4: Logistics of Production and Inventory. North-Holland.
Lenstra, J.K. (1977). Sequencing by Enumerative Methods. Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam.
Los, M. and M.C. Lardinois. (1982). “Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem.” Transportation Research 16B, 89–124.
Lundy, M. and A. Mees. (1986). “Convergence of an Annealing Algorithm.” Mathematical Programming 34, 111–124.
Matsuo, H., C.J. Suh, and R.S. Sullivan. (1987). “A Controlled Search Simulated Annealing Method for the Single Machine Weighted Tardiness Problem.” Working Paper #87–12–2, Dept. of Management, Graduate School of Business, University of Texas at Austin.
Matsuo, H., C.J. Suh, and R.S. Sullivan. (1988). “A Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem.” Working Paper 03–04–88, Department of Management, University of Texas at Austin.
Ovacik, I.M. and R. Uzsoy. (1994). “Rolling Horizon Algorithms for a Single Machine Dynamic Scheduling Problem with Sequence-Dependent Setup Times.” International Journal of Production Research, forthcoming.
Parker, R.G. and R.L. Rardin. (1988). Discrete Optimization. Boston: Academic Press.
Sadeh, N. and Y. Nakakuki. (1994). “Focused Simulated Annealing: An Application to Job Shop Scheduling.” Research Report, Center for Integrated Manufacturing Decision Systems, The Robotics Institute, Carnegie-Mellon University.
Uzsoy, R., C.Y. Lee, and L.A. Martin-Vega. (1992). “Scheduling Semiconductor Test Operations: Minimizing Maximum Lateness and Number of Tardy Jobs on a Single Machine.” Naval Research Logistics 39, 369–388.
Van Laarhoven, P.J.M. and E.H.L. Aarts. (1987). Simulated Annealing: Theory and Applications. Dordrecht, Holland: Dortmund Reidel.
Van Laarhoven, P.J.M., E.H.L. Aarts, and J.K. Lenstra. (1992). “Job Shop Scheduling by Simulated Annealing.” Operations Research 40, 113–125.
Zanakis, S.H. (1977). “Computational Experience with Some Nonlinear Optimization Algorithms for Deriving Maximum Likelihood Estimates for Three Parameter Weibull Distribution.” TIMS Studies in Management Science 7, 63–77.
Zanakis, S.H. (1979). “A Simulation Study of Some Simple Estimators of the Three-Parameter Weibull Distribution.” Journal of Statistical Computing and Simulation 9, 419–428.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ovacik, I.M., Rajagopalan, S. & Uzsoy, R. Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems. Journal of Heuristics 6, 481–500 (2000). https://doi.org/10.1023/A:1009669326107
Issue Date:
DOI: https://doi.org/10.1023/A:1009669326107