{"type":"ScholarlyArticle","title":"The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving","authors":[{"name":"Ira Pohl","slug":"ira-pohl","given":"Ira","family":"Pohl","affiliation":""}],"abstract":"To solve difficult problems heuristically, requires detailed attention to computational efficiency. This paper describes how a heuristic problem solving system, HPA, attempts to find a near optimal solution to the traveling salesman problem. A critical innovation over previous search algorithms is an explicit dynamic weighting of the heuristic information. The heuristic information is weighted inversely proportional to its depth in the search tree--in consequence it produces a narrower depth first search than traditional weightings. At the same time, dynamic weighting retains the catastrophe protection of ordinary branch and bound algorithms.","doi":null,"url":"https://ijcai.org/proceedings/1973/2","pdf":"https://ijcai.org/proceedings/1973/0002.pdf","markdown":"https://ijcai.org/proceedings/1973/2.md","bibtex":"https://ijcai.org/proceedings/1973/bibtex/2","volume":{"slug":"1973","title":"Proceedings of the Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1973","url":"https://ijcai.org/proceedings/1973/","year":1973,"location":"Stanford, California, USA","dates":"20-23 August 1973","editors":"Nils J. Nilsson","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theory of Heuristic Search","track":"Theory of Heuristic Search","number":2,"pages":{"first":12,"last":16},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}