Skip to main content

Bayesian Heuristic Approach (BHA) and Applications to Discrete Optimization

  • Chapter
From Local to Global Optimization

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 53))

  • 459 Accesses

Abstract

Industrial size discrete optimization problems are most often solved using “heuristics” (expert opinions defining how to solve a family of problems). The paper is concerned about ways to speed up the search in a discrete optimization problem by combining several heuristics involving randomization. Using expert knowledge an a priori distribution on a set of heuristic decision rules is defined and is continuously updated while solving a particular problem. This approach (BHA or Bayesian Heuristic Approach) is different from the traditional Bayesian Approach (BA) where the a priori distribution is defined on a set of functions to be minimized. The paper focuses on the main objective of BHA that is improving any given heuristic by “mixing” it with other decision rules. In addition to providing almost sure convergence such mixed decision rules often outperform (in terms of speed) even the best heuristics as judged by the three considered examples. However, the final results of BHA depend on the quality of the specific heuristic. That means the BHA should be regarded as a tool for enhancing the best heuristics but not for replacing them.

This way the formal Bayesian Approach (BA) is extended to a semiformal Bayesian Heuristic Approach (BHA) where heuristics may be included more flexibly. The paper is concluded by an example of Dynamic Visualization Approach (DVA). The goal of DVA is to exploit heuristics directly, bypassing any formal mathematical framework.

The formal description of BHA and its application is published in a number of books and papers. In this paper the BHA is introduced and explained using three examples as illustrations, namely knapsack, flow-shop, and batch scheduling. This helps to show when and why BHA works more efficiently as compared with the traditional optimization methods. The global optimization software is described in short as a tool needed implementing BHA.

The purpose of the paper is to inform the authors inventing and applying various heuristics about the possibilities and limitations of BHA hoping that they will improve their heuristics using this powerful tool.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I.P. Androulakis and V. Venkatasubramanian. A genetic algorithmic framework for process design and optimization. Computers in Chemical Engineering, 15: 217–228, 1991.

    Article  Google Scholar 

  2. Kenneth R. Baker. Introduction to Sequencing and Scheduling. John Wiley * Sons, New York, 1974.

    Google Scholar 

  3. T.L. Chorba, Ri. Berkelman, S.K. Safford, N.P. Gibbs, and H.F. Hull. Mandatory reporting of infectious diseases by clinicians. Journal of the American Medical Association, 262: 3018–3019, 1989.

    Article  Google Scholar 

  4. H. Das, P.T. Cummings, and M.D. LeVan. Scheduling of serial multiproduct batch processes via simulated annealing Computers and Chemical Engineering, 14: 1351–1362, 1990.

    Article  Google Scholar 

  5. M. DeGroot. Optimal Statistical Decisions. McGraw-Hill, New York, 1970.

    MATH  Google Scholar 

  6. L.C.W. Dixon and G.P. Szego. Towards global optimisation 2. North Holland, Amsterdam, 1978.

    MATH  Google Scholar 

  7. W.F. Eddy and A. Mockus. An example of the estimation and display of a smoothly varying function of time and space–the incidence of the disease mumps. Journal of the American Society for Information Science, 45 (9): 686–693, 1994.

    Article  Google Scholar 

  8. William Eddy and Audris Mockus. Dynamic visualization in modeling and optimization of ill defined problems, case studies and generalizations. In C. A. Floudas and Panos M. Pardalos, editors, State of the Art in Global Optimization: Computational Methods and Applications, volume 7 of Nonconvex Optimization and its Applications, pages 499–520. Kluwer Academic Publishers, 1996.

    Google Scholar 

  9. T.A. Feo, M.G.C. Resende, and Smith. Operations Research, 42: 860–878.

    Google Scholar 

  10. Fisher and Thompson. In Industrial Scheduling. Prentice-Hall, 1963.

    Google Scholar 

  11. F. Glover. Cahiers de Recherche Operationalle, 6: 131–168, 1994.

    MathSciNet  Google Scholar 

  12. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  13. P. Heiman, B.M.E. Moret, and H.D. Shapiro. An exact characterization of greedy structures. SIAM Journal of Discrete Mathematics, 6: 274–283, 1993.

    Article  Google Scholar 

  14. Chris Jones. Visualization and Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996.

    Google Scholar 

  15. U.S. Karmarkar and R.S. Nainbimadom. Material allocation in mrp with tardness penalties. Journal of Global Optimization, 9: 453–482, 1996.

    Article  MATH  Google Scholar 

  16. Ker-I Ko.Complexity Theory of Real Functions. Birkhauser, Boston, 1991

    Google Scholar 

  17. A. Mockus. Predicting a Space-Time Process from Aggregate Data Exemplified by the Animation of Mumps Disease. PhD thesis, Department of Statistics, Carnegie Mellon University, 1994.

    Google Scholar 

  18. A. Mockus, J. Mockus, and L. Mockus. Bayesian approach adapting stochastic and heuristic methods of global and discrete optimization. INFORMATICA, 5 (1–2): 123–166, 1994.

    MathSciNet  MATH  Google Scholar 

  19. A. Mockus, J. Mockus, and L. Mockus. Discrete optimization, information based complexity, and bayesian heuristics approach. In Proceedings of International Symposium on Operations Research with Applications in Engineering Technology and Management (ISORA’95), August 19–22, Beijing, 1995.

    Google Scholar 

  20. A. Mockus and L. Mockus. Design of software for global optimization. Informatica, 1: 71–88, 1990.

    MathSciNet  Google Scholar 

  21. J. Mockus. Bayesian approach to global optimization. Kluwer Academic Publishers, Dordrecht-London-Boston, 1989.

    Book  MATH  Google Scholar 

  22. J. Mockus. Average complexity and bayesian heuristics approach to discrete optimization. Informatica, 6: 193–224, 1995.

    MathSciNet  MATH  Google Scholar 

  23. J. Mockus, W. Eddy, A. Mockus, L. Mockus, and G. Reklaitis. Bayesian Heuristic Approach to Discrete and Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.

    Google Scholar 

  24. J. Mockus and L. Mockus. Bayesian approach to global optimization and applications to multiobjective and constrained optimization. Journal of Optimization Theory and Applications, 70 (1): 155–171, July 1991.

    Article  MathSciNet  Google Scholar 

  25. J. Mockus and A. Soofi. The long-run economic relationships: An optimization approach to fractional integrated and bilinear time series. INFORMATICA, 6: 61 70, 1995.

    Google Scholar 

  26. J. Mockus and A. S. Soofi. Long memory processes and exchange rate forecasting. In Procedings of the Conference on Forecasting Financial Markets,pages 1–15, London, U.K., 1996. Chemical Bank and Imperial College.

    Google Scholar 

  27. Jonas Mockus. Application of bayesian approach to numerical methods of global and stochastic optimization. Journal of Global Optimization, 4 (4): 347–366, June 1994.

    Article  MathSciNet  MATH  Google Scholar 

  28. L. Mockus and G. V. Reklaitis. Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization. Computers Chem. Engng, 20: 1173–1177, 1996.

    Article  Google Scholar 

  29. L. Mockus and G. V. Reklaitis. A new global optimization algorithm for hatch process scheduling. In C. A. Floudas and Panos M. Pardalos, editors, State of the Art in Global Optimization: Computational Methods and Applications, volume 7 of Nonconvex Optimization and its Applications, pages 521–538. Kluwer Academic Publishers, 1996.

    Google Scholar 

  30. L. Mockus and G.V. Reklaitis. A new global optimization algorithm for batch process scheduling. In Proceedings of State of the Art in Global Optimization: Computational Methods and Applications, Princeton, NJ, 1995.

    Google Scholar 

  31. P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende. Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing and GRASP. In A. Ferreira and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Problems, Proceedings of the Second International Workshop -Irregular’95, volume 980 of Lecture Notes in Computer Science, pages 317–331. Springer-Verlag, 1995.

    Google Scholar 

  32. G.V. Reklaitis and L. Mockus. Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization. Acta Chimica Slovenica, 42 (1): 81–86, 1995.

    Google Scholar 

  33. K. Schittkowski. Nlpql: A fortran subroutine solving constrained nonlinear programming problems. Annals of Operations Research,5:485–500, 1985/86.

    Google Scholar 

  34. I.M. Sobolj. On a systematic search in a hypercube. SIAM Journal on Numerical Analysis, 16: 790–793, 1967.

    Article  Google Scholar 

  35. A. Torn and A. Zilinskas. Global optimization. Springer-Verlag, Berlin, 1989.

    Book  Google Scholar 

  36. P.J.M. VanLaarhoven, C.G.E. Boender, E.H.L. Aarts, and A.H.D. RinnooyKan. A bayesian approach to simulated annealing. Probability in the Engineering and Information Sciences, 3: 453–475, 1989.

    Article  Google Scholar 

  37. M. G. Zentner, J. F. Pekny, D. L. Miller, and G. V. Reklaitis. RCSP++: A scheduling system for the chemical process industry. In Proc. PSE’94, pages 491–495, Kyongju, Korea, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Mockus, J. (2001). Bayesian Heuristic Approach (BHA) and Applications to Discrete Optimization. In: Migdalas, A., Pardalos, P.M., Värbrand, P. (eds) From Local to Global Optimization. Nonconvex Optimization and Its Applications, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5284-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5284-7_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4852-6

  • Online ISBN: 978-1-4757-5284-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics