No abstract

In this paper, a good portfolio is found through an ant colony algorithm (including a local search) that approximates the Pareto front regarding some kind of project categorization, cardinalities, discrepancies with priorities given by the ranking, and the average rank of supported projects; this approach is an improvement towards a proper modeling of preferences. The available information is only projects' ranking and costs, and usually, resource allocation follows the ranking priorities until they are depleted. Results show that our proposal outperforms previous approaches.

No abstract

No abstract