Issue No. 08 - August (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.7626
<p>Dominance relations are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.</p>
artificial intelligence; optimisation; dominance relations; combined search problems; search graphs; machine learning; 0/1-knapsack problem; inventory problem; reliability-by-replication; two-machine flow shop problem; single-machine scheduling; two-machine scheduling; artificial intelligence; combinatorial mathematics; learning systems; optimisation; scheduling
B. Wah and C. Yu, "Learning Dominance Relations in Combined Search Problems," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1155-1175, 1988.