Multi-objective, preference-based search in acyclic OR-graphs

Multi-objective, preference-based search in acyclic OR-graphs

0.00 Avg rating0 Votes
Article ID: iaor19941804
Country: Netherlands
Volume: 56
Issue: 3
Start Page Number: 357
End Page Number: 363
Publication Date: Feb 1992
Journal: European Journal of Operational Research
Authors: ,
Keywords: graphs, programming: multiple criteria
Abstract:

The authors consider the problem of determining a most preferred path from a start node to a goal node set in an acyclic OR-graph, given a multiattribute preference function, a multiobjective reward structure, and heuristic information about this reward structure. They present an algorithm which is shown to terminate with a most preferred path, given an admissible heuristic set. The algorithm illustrates how Artificial Intelligence techniques can be productively employed to solve multiobjective problems.

Reviews

Required fields are marked *. Your email address will not be published.