A heuristic search approach for solving a minimum path problem requiring Arc cost determination

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 26, Issue 5, 1996, Pages 545-551

  Liaw, Ching Fang ^b   White III, Chelsea C ^a,c  

^a IEEE

^b CHAOYANG UNIVERSITY OF TECHNOLOGY   (Taiwan)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ESTIMATION; HEURISTIC METHODS; OPTIMIZATION; SET THEORY; TREES (MATHEMATICS);

ARC COST DETERMINATION; HEURISTIC SEARCH APPROACH; MINIMUM PATH PROBLEM;

GRAPH THEORY;

EID: 0030241424     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.531902     Document Type: Article

References (5)

1. R. Dechter and J. Pearl, "Generalized best-first search strategies and the optimality of A*," J. ACM, vol. 32, pp. 505-536, 1985.
2. J. Pearl, Heuristics: Intelligent Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.
3. P. E. Hart, N. J. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst., Sci., Cybern., vol. SSC-4, pp. 100-107, 1968.
4. P. E. Hart, N. J. Nilsson, and B. Raphael, "Correction to a formal basis for the heuristic determination of minimum cost paths," SIGART Newsletter, vol. 37, pp. 28-29, 1972.
5. C. F. Liaw, C. C. White, III, and J. Bander, "A decision support system for the bimodal dial-a-ride problem," IEEE Trans. Syst., Man, Cybern. A., this issue, pp. 552-565.