This thesis analyzes the performance of multiobjective heuristic graph search algorithms. The analysis is focused on the influence of heuristic information, correlation between objectives and solution depth.