Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

Currently, most combinatorial optimization problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. The objective of this work is to propose a survey and a general formalization of the selection strategy of the next node to explore, a feature that is common to all these optimization procedures.

[1]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[2]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[4]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[5]  P. P. Chakrabarti,et al.  Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds , 1991, Artif. Intell..

[6]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[7]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  茨木 俊秀,et al.  Enumerative approaches to combinatorial optimization , 1987 .

[10]  Avron Barr,et al.  The Handbook of Artificial Intelligence, Volume 1 , 1982 .

[11]  Ira Pohl,et al.  Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..

[12]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[13]  Ching-Jong Liao.  A new node selection strategy in the branch-and-bound procedure , 1994, Comput. Oper. Res..

[14]  Pallab Dasgupta,et al.  Agent Searching in a Tree and the Optimality of Iterative Deepening , 1994, Artif. Intell..

[15]  L. C. Shih,et al.  An AI-search technique-based layout planning method , 1992 .

[16]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[17]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[18]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.

[19]  Warren J. Boe,et al.  DESIGNING CELLULAR MANUFACTURING SYSTEMS: BRANCH-AND-BOUND AND A∗ APPROACHES , 1993 .

[20]  Barr and Feigenbaum Edward A. Avron.  The Handbook of Artificial Intelligence , 1981 .

[21]  Larry R. Harris.  The Bandwidth Heuristic Search , 1973, IJCAI.

[22]  Richard E. Korf,et al.  Performance of Linear-Space Search Algorithms , 1995, Artif. Intell..