RT Conference Proceedings
T1 An Alternative Archiving Technique for Evolutionary Polygonal Approximation
A1 Guerrero Madrid, José Luis
A1 Berlanga de Jesús, Antonio
A1 Molina, José M.
AB Archiving procedures are a key parameter for Multi-objective evolutionary algorithms, since they guarantee the algorithm convergence and the good spread of the obtained solutions in the final Pareto front. For many practical applications, the cost of the algorithm is clearly dominated by the computational cost of the underlying fitness functions, allowing complex processes to be incorporated into the archiving procedure. This work presents a study of the archiving technique for evolutionary polygonal approximation (the division of a given curve into a set of n segments represented by a linear model) based on the epsilon-glitch concept, highlighting the cost of the technique compared to the fitness computation, and proposing a novel alternative archiving procedure, which yields statistically significant better results compared to available approaches.
PB International Academy, Research, and Industry Association (IARIA)
SN 978-1-61208-272-1
SN 2308-3735
YR 2013
FD 2013
LK https://hdl.handle.net/10016/18360
UL https://hdl.handle.net/10016/18360
LA eng
NO Proceedings of: Fifth International Conference on Future Computational Technologies and Applications (FUTURE COMPUTING 2013), Valencia, Spain, May 27 - June 1, 2013
NO This work was supported in part by Projects MINECO TEC2012-37832-C02-01, CICYT TEC2011-28626-C02-02, CAM CONTEXTS (S2009/TIC-1485)
DS e-Archivo
RD 1 jun. 2024