An Evaluation of Best Compromise Search in Graphs

This work evaluates two different approaches for multicriteria graph search problems using compromise preferences. This approach focuses search on a single solution that represents a balanced tradeoff between objectives, rather than on the whole set of Pareto optimal solutions. We review the main concepts underlying compromise preferences, and two main approaches proposed for their solution in heuristic graph problems: naive Pareto search (NAMOA∗ ), and a kshortest-path approach (kA∗ ). The performance of both approaches is evaluated on sets of standard bicriterion road map problems. The experiments reveal that the k-shortest-path approach looses effectiveness in favor of naive Pareto search as graph size increases. The reasons for this behavior are analyzed and discussed.

• Type: Journal
• Year: 2013
• Where: CAEPIA
• Authors: Enrique Machuca, Lawrence Mandow, Lucie Galand
• Keywords: Artificial Intelligence, CAEPIA 2013