Skip to main content
SpringerLink
Log in

Pruning by upperbounds in heuristic search: Use of approximate algorithms

  • Search
  • Conference paper
  • First Online:
Knowledge Based Computer Systems (KBCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 444))

Included in the following conference series:

  • 1954 Accesses

Abstract

The use of approximate algorithms in aiding heuristic search is explored. Approximate algorithms are coupled with algorithm A to generate an algorithm BFPR which maintains provably good quality of solutions. Experiments were performed with Euclidean Traveling Salesman problem and with the problem of Scheduling Independent Tasks. It is found that the algorithm expands considerably fewer number of nodes and yet very often produces optimal solutions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chakrabarti PP, Ghose S, Pandey A, and DeSarkar SC. Increasing search efficiency using multiple heuristics. Information Processing Letters, 30, pp 33–36, 1989.

    Google Scholar 

  2. Garey MR and Johnson DS. Computers and Intractability, A guide to the theory of NP — completeness. W. H. Freeman and Co., New York, 1979.

    Google Scholar 

  3. Golden B, Bodlin L, Doyle T, and Stewart W Jr. Approximate traveling salesman algorithms. Operations Research, Vol 28, No. 3, pp 694–711, May — June 1980.

    Google Scholar 

  4. Horowitz E and Sahni S. Fundamental of computer algorithms. Galgotia, 1984.

    Google Scholar 

  5. Kunde M and Steppat H. On the worst case ratio of a compound multiprocessor scheduling algorithm. Information Processing Letters, 25, pp 389–396, 1987.

    Google Scholar 

  6. Nilsson NJ. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.

    Google Scholar 

  7. Pearl J. HEURISTICS Intelligent Search Strategies for Computer Problem Solving. Addison Wesley, 1984.

    Google Scholar 

  8. Rosenkrantz DJ, Stearns RE, and Lewis PM. An analysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing, Vol 6, No. 3, pp 563–581, September 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, 721302, Kharagpur, India

    UK Sarkar, PP Chakrabarti, S Ghose & SC DeSarkar

Authors
  1. UK Sarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. PP Chakrabarti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S Ghose
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. SC DeSarkar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Ramani R. Chandrasekar K. S. R. Anjaneyulu

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarkar, U., Chakrabarti, P., Ghose, S., DeSarkar, S. (1990). Pruning by upperbounds in heuristic search: Use of approximate algorithms. In: Ramani, S., Chandrasekar, R., Anjaneyulu, K.S.R. (eds) Knowledge Based Computer Systems. KBCS 1989. Lecture Notes in Computer Science, vol 444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018402

Download citation

  • DOI: https://doi.org/10.1007/BFb0018402

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52850-0

  • Online ISBN: 978-3-540-47168-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation