Skip to main content

Part of the book series: CISM International Centre for Mechanical Sciences ((CISM,volume 320))

Abstract

Many decision problems can be considered as searching for an element in a finite set. Classical approaches lead to sophisticated combinatorial optimization algorithms that exploit a lot of the structure of the decision situation. Often these algorithms are not easy to adapt to new constraints on decisions imposed by the decision makers.

Our approach to the generation of decisions is to use general search methods that are easy to adapt in case of new constraints. In general they give less good decisions but are more robust. A general-purpose shell based on these search methods is sketched using Prolog. As an illustration two decision problems are treated: the travelling salesman problem and precedence constrained scheduling.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  • Aarts, E.H.L. and Korst, J., Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, Wiley, 1989.

    Google Scholar 

  • Checkland, P., Systems Thinking and Systems Practice, Wiley, 1981.

    Google Scholar 

  • Eiben, A.E. and van Hee, K.M.: Knowledge Representation and Search Methods for Decision Support Systems, in: Gaul, W. and Schader, M., Ed., Data, Expert Knowledge and Decisions, Springer -Verlag, 1990.

    Google Scholar 

  • Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman and Co, 1978.

    Google Scholar 

  • van Hee, K.M. and Lapinski, A., OR and AI approaches to decision support, Decision Support Systems 4 (1989), pp 447–459.

    Google Scholar 

  • Keen, P.G.W. and Scott Morton, M.S., Decision support systems: an organized perspective, Addison-Wesley, 1978.

    Google Scholar 

  • Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, 1985.

    MATH  Google Scholar 

  • Papadimitriou, C.H. and Stieglitz, K., Combinatorial optimization: algorithms and complexity, Prentice -Hall, 1982.

    Google Scholar 

  • Pearl, J.R., Artificial intelligence: the heuristic programming approach, McGraw-Hill, 1971.

    Google Scholar 

  • Schnupp, P. and Bernhard L.W., Productive Prolog Programming, Prentice Hall, 1986.

    Google Scholar 

  • Spivey, M., The Z notation, Prentice Hall, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Wien

About this chapter

Cite this chapter

van Hee, K.M., Nuijten, W.P.M. (1991). A Decision Generator Shell in Prolog. In: Lewandowski, A., Serafini, P., Speranza, M.G. (eds) Methodology, Implementation and Applications of Decision Support Systems. CISM International Centre for Mechanical Sciences, vol 320. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2606-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2606-6_3

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82297-5

  • Online ISBN: 978-3-7091-2606-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics