{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T07:19:45Z","timestamp":1772176785186,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0164-1212(00)00064-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T21:09:52Z","timestamp":1049490592000},"page":"103-113","source":"Crossref","is-referenced-by-count":7,"title":["Heuristic search revisited"],"prefix":"10.1016","volume":"55","author":[{"given":"Abdel-Elah","family":"Al-Ayyoub","sequence":"first","affiliation":[]},{"given":"Fawaz A","family":"Masoud","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(00)00064-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322358.322359","article-title":"Search algorithms under different kind of heuristics: a comparative study","volume":"30","author":"Bagchi","year":"1983","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB2","doi-asserted-by":"crossref","unstructured":"Davis, H., Pollack, R., Golden, D., 1986a. A technique for comparing search algorithm run-times. In: Proceedings of the 14th Annual ACM CSC-86. pp. 301\u2013308","DOI":"10.1145\/324634.325438"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB3","doi-asserted-by":"crossref","unstructured":"Davis, H., Pollack, R., Golden, D., 1986b. Towards a domain independent method for comparing search algorithm run-times. In: Proceedings of the Sixth Canadian Conference on AI. pp. 240\u2013244","DOI":"10.1145\/324634.325438"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/322358.322360","article-title":"Bi-directional heuristic search again","volume":"30","author":"DeChampeaux","year":"1983","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322003.322004","article-title":"An improved bi-directional heuristic search algorithm","volume":"24","author":"DeChampeaux","year":"1977","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/S0164-1212(00)00064-9_BIB6","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","article-title":"Generalized best-first search strategies and the optimality of A*","volume":"32","author":"Dechter","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB7","unstructured":"Gaschnig, J., 1979. Performance measurement and analysis of certain search algorithms, Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0004-3702(77)90005-4","article-title":"On the optimality of A*","volume":"8","author":"Gelperin","year":"1977","journal-title":"Artificial intelligence"},{"issue":"3","key":"10.1016\/S0164-1212(00)00064-9_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0255(92)90070-O","article-title":"Criticising solutions to relaxed models yields powerful admissible heuristics","volume":"63","author":"Hansson","year":"1992","journal-title":"Information Science"},{"issue":"2","key":"10.1016\/S0164-1212(00)00064-9_BIB10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for heuristic determination for minimum cost paths","volume":"SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Transactions on System Science and Cybernetics"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB11","first-page":"1","article-title":"Continuous speech recognition based on A* search word-pair constraint as heuristics","author":"Kawahara","year":"1994","journal-title":"Transaction of the Institute of Electronics, Information and Communication Engineers D-II"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","article-title":"Linear-space best-first search","volume":"62","author":"Korf","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90002-9","article-title":"On the complexity of admissible search algorithms","volume":"8","author":"Martelli","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(84)90003-1","article-title":"Heuristic search algorithm with modifiable estimate","volume":"23","author":"Mero","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB16","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1972"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB17","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB18","series-title":"Heuristics: Intelligent search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB19","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/TPAMI.1982.4767270","article-title":"Studies on semi admissible heuristics","volume":"4","author":"Pearl","year":"1982","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB20","first-page":"127","article-title":"Bi-directional search","volume":"6","author":"Phol","year":"1971","journal-title":"Machine Intelligence"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB21","unstructured":"Politowski, G., Phol, I., 1984. D-node re-targeting in bi-directional heuristic search. In: Proceedings of the National Conference on Artificial Intelligence. pp. 274\u2013277"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB22","unstructured":"Sike, S., 1993. Heuristic graph-search in drug design. In: Third Conference on Artificial Intelligence, Budapest, Hungary, pp. 211\u2013220"},{"key":"10.1016\/S0164-1212(00)00064-9_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90053-2","article-title":"Some models of noise signals and heuristic search for weighted-order statistics","volume":"18","author":"Znak","year":"1993","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121200000649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121200000649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T02:35:33Z","timestamp":1579228533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121200000649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0164121200000649"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(00)00064-9","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}