11.07.2015 Views

View - Universidad de Almería

View - Universidad de Almería

View - Universidad de Almería

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

118 C. Gil, R. Baños, M. G. Montoya, A. Márquez, and J. Ortegavying for incorporation into the archive. PESA implicitly maintains a hyper-grid division ofphenotype space which allows it to keep track of the crowding <strong>de</strong>gree in different regionsof the archive. However, unlike both PAES and SPEA, selection in PESA is based on thiscrowding measure. Replacement (<strong>de</strong>ciding what must leave the archive if it becomes overfull)is also based on a crowding measure.msPESA (Mixed Spreading between PESA and NSGA-II). A new algorithm, which is ahybrid version between PESA and NSGA-II is implemented in or<strong>de</strong>r to improve the conceptof spreading. In the <strong>de</strong>sign of msPESA, the goal was to eliminate the potential weaknesses ofother MOEAs and to create a powerful MOEA. The main characteristics of msPESA are:- It uses a variation of the fast non-dominated sorting algorithm of NSGA-II where onlyone front is calculated.- A new archiving strategy is implemented for the external population. Once a candidatehas entered the external archive, members of the archive which is dominated will notbe removed.If the archive temporarily exceeding the maximum size, one solution musttherefore be removed from the archive. The choice is ma<strong>de</strong> by first finding the maximalsqueeze factor [4] in the population, and removing an arbitrary chromosome which hasthis squeeze factor.43ZDT1msPESAPESANSGA−IISPEA2f22100 0.2 0.4 0.6 0.8 1f1Figure 2.Non-dominated solutions obtained using NSGA-II, SPEA2, PESA and msPESA on ZDT1.3. Experimental AnalysisIn this section we consi<strong>de</strong>r the issues necessary to compare the performance of these algorithmsover a set of benchmarks. The elaboration of a merit ranking between the variousmethods is not a trivial procedure. In general, an or<strong>de</strong>r of MOEA merit is impossible dueto the NFL Theorem [12], although it is possible to extract some results from the behavior ofeach algorithm. In this paper we have taken into account the proximity to the Pareto frontand the uniformity in the distribution of the solutions. In the search for an impartial, accuratecomparison that exclu<strong>de</strong>s the effects of chance, it is necessary to consi<strong>de</strong>r many aspects, andfor this reason we have ma<strong>de</strong> our own implementation of each algorithm, and all of themhave been integrated in the same platform. Since EAs are highly configurable procedures [1],

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!