Although GA or greedy algorithms are widely used to solve NP-hard combinatorial optimization problems, the solutions are not always optimal.
the summary does not always have a maximum ROUGE n score for the set of reference summaries.