Alan de Freitas
Real-world Optimization Problems
Instances and Solutions
Software and Source Code
Files Related to Articles
: An Aggregation Tree is a tool for visualizing results of many-objective problems and also for performing dimensionality reduction.. The high dimensionality of many-objective problems makes it hard to represent the relationship between objectives and solution in such problems and most approaches in the literature are based on the representation of solutions in lower dimensions. The method of aggregation trees is based on an iterative aggregation of objectives which are represented in a tree. The position of the conflict is also calculated and represented in the tree. Thus, the tree can represent which objectives or groups of objectives are most harmonic, which sorts of conflict are present between groups of objectives and which aggregations would be useful to reduce the dimensionality of the problem.
Open Genetic Algorithm Toolbox
: This is a toolbox for running GAs on any problem you might want to model. You can use one of the example problems as reference of model your own problem with a set of simple functions. You can also collaborate by defining new example problems or new functions for the GA, such as scaling methods, selection and adaptation..
PSA: Part-and-Select Algorithm
: Divides the points X into K clusters and also returns the K most representative points.
Easy Friedman Test
: This is a useful function to compare algorithms or treatments. The function receives a 3d table with results of different methods, instances and replicates, and returns a 2d table for the Friedman test. Moreover, the function asks if you want to run the test and compare results.
: The tests takes a table in which each line represents a nominal category and each column represents an analysis of the data. Each element table(i,j) is the number of occurrences of the data in the category i for the mathod j.
: Finds the Pareto fronts for a set of n-dimensional points according to a certain dominance relationship. The function finds and/or plots the first or all Pareto fronts according to 7 possible dominance relationship between points in any dimension.